1515 search results - page 167 / 303 » Parallel computing on any desktop |
121
click to vote
PODC
2012
ACM
13 years 6 months ago
2012
ACM
In the Byzantine agreement problem, a set of n processors, any f of whom may be arbitrarily faulty, must reach agreement on a value proposed by one of the correct processors. It i...
154
click to vote
PCRCW
1997
Springer
15 years 7 months ago
1997
Springer
In recent years, theChaos Project at theUniversityofWashingtonhas analyzed and simulated a dozen routing algorithms. Three new routing algorithms have been invented; of these, the...
SPAA
2004
ACM
15 years 9 months ago
2004
ACM
A key capability of data-race detectors is to determine whether one thread executes logically in parallel with another or whether the threads must operate in series. This paper pr...
121
click to vote
PODC
2005
ACM
15 years 9 months ago
2005
ACM
In this paper we consider the weighted, capacitated vertex cover problem with hard capacities (capVC). Here, we are given an undirected graph G = (V, E), non-negative vertex weigh...
133
Voted
SPAA
2005
ACM
15 years 9 months ago
2005
ACM
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...