1095 search results - page 211 / 219 » A Parallel Algorithm for Computing Betweenness Centrality |
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
Dynamic real-time systems require adaptive resource management to accommodate varying processing needs. We address the problem of resource management with multiple shared resource...
PODC
2005
ACM
14 years 29 days ago
2005
ACM
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...
ICPP
2003
IEEE
14 years 20 days ago
2003
IEEE
Aggressive hardware-based and software-based prefetch algorithms for hiding memory access latencies were proposed to bridge the gap of the expanding speed disparity between proces...
SPAA
2003
ACM
14 years 19 days ago
2003
ACM
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
HPCA
1998
IEEE
13 years 11 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....