92 search results - page 4 / 19 » Scalable parallel graph coloring algorithms |
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
The Cray MTA-2 system provides exceptional performance on a variety of sparse graph algorithms. Unfortunately, it was an extremely expensive platform. Cray is preparing an Eldorad...
IPPS
1999
IEEE
14 years 8 days ago
1999
IEEE
We investigate the average-case speed and scalability of parallel algorithms executing on multiprocessors. Our performance metrics are average-speed and isospeed scalability. By m...
IPPS
2003
IEEE
14 years 1 months ago
2003
IEEE
Given a vector ( 1 2 ::: t) of non increasing positive integers, and an undirected graph G = (V E), an L( 1 2 ::: t)-coloring of G is a function f from the vertex set V to a set o...
PPL
2007
13 years 7 months ago
2007
Graph algorithms are becoming increasingly important for solving many problems in scientific computing, data mining and other domains. As these problems grow in scale, parallel c...
LCPC
1994
Springer
14 years 2 days ago
1994
Springer
Data parallel programs are sensitive to the distribution of data across processor nodes. We formulate the reduction of inter-node communication as an optimization on a colored gra...