11 search results - page 1 / 3 » A framework for scalable greedy coloring on distributed-memo... |
JPDC
2008
13 years 4 months ago
2008
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
EUROPAR
2005
Springer
13 years 10 months ago
2005
Springer
In large-scale parallel applications a graph coloring is often carried out to schedule computational tasks. In this paper, we describe a new distributedmemory algorithm for doing t...
HPCC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...
ISCOPE
1999
Springer
13 years 8 months ago
1999
Springer
SIFFEA is an automated system for parallel nite element method (PFEM) with unstructured meshes on distributed memory machines. It synthesizes mesh generator, mesh partitioner, line...
ICPP
2008
IEEE
13 years 10 months ago
2008
IEEE
We introduce Scioto, Shared Collections of Task Objects, a lightweight framework for providing task management on distributed memory machines under one-sided and globalview parall...