210 search results - page 16 / 42 » A Scalable Parallel Graph Coloring Algorithm for Distributed... |
108
click to vote
IPPS
1999
IEEE
15 years 6 months ago
1999
IEEE
We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = A;B;E. For p processors with N=p memory per processor, N = jAj+jBj,...
115
Voted
HPCA
2006
IEEE
16 years 2 months ago
2006
IEEE
Allowing loads to issue out-of-order with respect to earlier unresolved store addresses is very important for extracting parallelism in large-window superscalar processors. Blindl...
131
click to vote
IPPS
1999
IEEE
15 years 6 months ago
1999
IEEE
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
139
click to vote
ICPPW
2009
IEEE
14 years 12 months ago
2009
IEEE
Identifying peptides, which are short polymeric chains of amino acid residues in a protein sequence, is of fundamental importance in systems biology research. The most popular appr...
123
click to vote
HPCA
1998
IEEE
15 years 6 months ago
1998
IEEE
This paper describes PRISM, a distributed sharedmemory architecture that relies on a tightly integrated hardware and operating system design for scalable and reliable performance....