1720 search results - page 294 / 344 » Unranking Combinations in Parallel |
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
Search-based graph queries, such as finding short paths and isomorphic subgraphs, are dominated by memory latency. If input graphs can be partitioned appropriately, large cluster...
ICS
2007
Tsinghua U.
14 years 1 months ago
2007
Tsinghua U.
Large-scale parallel computing is relying increasingly on clusters with thousands of processors. At such large counts of compute nodes, faults are becoming common place. Current t...
ICDCS
2006
IEEE
14 years 1 months ago
2006
IEEE
Network coordinates provide a scalable way to estimate latencies among large numbers of hosts. While there are several algorithms for producing coordinates, none account for the f...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
The need to allow threads to abort an attempt to acquire a lock (sometimes called a timeout) is an interesting new requirement driven by state-of-the-art database applications wit...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
Peer-to-Peer (P2P) cycle sharing over the Internet has become increasingly popular as a way to share idle cycles. A fundamental problem faced by P2P cycle sharing systems is how t...