In this paper, we present multi-threaded algorithms for graph coloring suitable to the shared memory programming model. Initially, we describe shared memory implementations to the algorithms widely known in the literature like Jones Plassman graph coloring. Later, we propose new approaches to solve the problem of coloring using mutex locks while making sure that deadlocks do not occur. Using datasets from real world graphs, we evaluate the performance of all these algorithms on the Intel platform. We compare the performance of sequential graph coloring v/s our proposed approaches and analyze the speedup obtained against the existing algorithms from the literature. The results show that the speedup obtained by our proposed algorithms in term...
Algorithms operating on a graph setting are known to be highly irregular and un- structured. This le...
Article dans revue scientifique avec comité de lecture.We present the first efficient parallel algor...
in Journées Informatiques de Metz - JIM'2000 (IUT Metz). Colloque avec actes sans comité de lecture....
We explore the interplay between architectures and algorithm design in the context of shared-memory ...
Abstract. In large-scale parallel applications a graph coloring is often carried out to schedule com...
In recent times an evident trend in hardware is to opt for multi-core CPUs. This has lead to a situa...
Identifying the sets of operations that can be executed simultaneously is an important problem ap-pe...
In parallel computing, a valid graph coloring yields a lock-free processing of the colored tasks, da...
Many modern applications are modeled using graphs of some kind. Given a graph, assigning labels (usu...
The problem of computing good graph colorings arises in many diverse applications, such as in the es...
We present an efficient and scalable Coarse Grained Multicomputer(CGM) coloring algorithm that color...
Matrix partitioning problems that arise in the efficient estimation of sparse Jacobians and Hessians...
AbstractWe present an efficient and scalable coarse grained multicomputer (CGM) coloring algorithm t...
Graph coloring is an abstraction of scheduling problems. Using an exclusive-read and exclusive-write...
We discover a surprising connection between graph coloring in two orthogonal paradigms: parallel and...
Algorithms operating on a graph setting are known to be highly irregular and un- structured. This le...
Article dans revue scientifique avec comité de lecture.We present the first efficient parallel algor...
in Journées Informatiques de Metz - JIM'2000 (IUT Metz). Colloque avec actes sans comité de lecture....
We explore the interplay between architectures and algorithm design in the context of shared-memory ...
Abstract. In large-scale parallel applications a graph coloring is often carried out to schedule com...
In recent times an evident trend in hardware is to opt for multi-core CPUs. This has lead to a situa...
Identifying the sets of operations that can be executed simultaneously is an important problem ap-pe...
In parallel computing, a valid graph coloring yields a lock-free processing of the colored tasks, da...
Many modern applications are modeled using graphs of some kind. Given a graph, assigning labels (usu...
The problem of computing good graph colorings arises in many diverse applications, such as in the es...
We present an efficient and scalable Coarse Grained Multicomputer(CGM) coloring algorithm that color...
Matrix partitioning problems that arise in the efficient estimation of sparse Jacobians and Hessians...
AbstractWe present an efficient and scalable coarse grained multicomputer (CGM) coloring algorithm t...
Graph coloring is an abstraction of scheduling problems. Using an exclusive-read and exclusive-write...
We discover a surprising connection between graph coloring in two orthogonal paradigms: parallel and...
Algorithms operating on a graph setting are known to be highly irregular and un- structured. This le...
Article dans revue scientifique avec comité de lecture.We present the first efficient parallel algor...
in Journées Informatiques de Metz - JIM'2000 (IUT Metz). Colloque avec actes sans comité de lecture....