84 search results - page 5 / 17 » A Parallel Distance-2 Graph Coloring Algorithm for Distribut... |
PPOPP
2012
ACM
12 years 2 months ago
2012
ACM
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
ICPP
2006
IEEE
14 years 20 days ago
2006
IEEE
— This paper presents a parallel external-memory algorithm for performing a breadth-first traversal of an implicit graph on a cluster of workstations. The algorithm is a paralle...
IEEEPACT
2005
IEEE
14 years 7 days ago
2005
IEEE
Scratchpad memory (SPM), a fast software-managed onchip SRAM, is now widely used in modern embedded processors. Compared to hardware-managed cache, it is more efficient in perfor...
ISCA
2002
IEEE
13 years 6 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
IEEEPACT
1998
IEEE
13 years 11 months ago
1998
IEEE
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...