210 search results - page 13 / 42 » A Scalable Parallel Graph Coloring Algorithm for Distributed... |
126
click to vote
IPPS
2010
IEEE
15 years 1 days ago
2010
IEEE
Sorting is a commonly used process with a wide breadth of applications in the high performance computing field. Early research in parallel processing has provided us with comprehen...
133
Voted
PPOPP
2012
ACM
13 years 9 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...
153
click to vote
STTT
2010
15 years 15 days ago
2010
Recent development in computer hardware has brought more wide-spread emergence of shared memory, multi-core systems. These architectures offer opportunities to speed up various ta...
121
click to vote
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
In this paper, we present a tree-partition algorithm for parallel mining of frequent patterns. Our work is based on FP-Growth algorithm, which is constituted of tree-building stag...
100
Voted
IEEEPACT
2008
IEEE
15 years 8 months ago
2008
IEEE
In a hardware transactional memory system with lazy versioning and lazy conflict detection, the process of transaction commit can emerge as a bottleneck. This is especially true ...