Sciweavers

210 search results - page 2 / 42
» A Scalable Parallel Graph Coloring Algorithm for Distributed...
Sort
View
PPOPP
2009
ACM
14 years 5 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
IPPS
2000
IEEE
13 years 9 months ago
Scalable Parallel Matrix Multiplication on Distributed Memory Parallel Computers
Consider any known sequential algorithm for matrix multiplication over an arbitrary ring with time complexity ON , where 2  3. We show that such an algorithm can be parallelize...
Keqin Li
ICPADS
1997
IEEE
13 years 9 months ago
Efficient Algorithms for Prefix and General Prefix Computations on Distributed Shared Memory Systems with Applications
The paper presents eficient scalable algorithms for performing Prefix (PC) and General Prefix (GPC) Computations on a Distributed Shared Memory ( D S M ) system with applications....
V. Kamakoti, N. Balakrishnan
IPPS
2007
IEEE
13 years 11 months ago
Analyzing the Scalability of Graph Algorithms on Eldorado
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...
Keith D. Underwood, Megan Vance, Jonathan W. Berry...