Sciweavers

1515 search results - page 135 / 303
» Parallel computing on any desktop
Sort
View
IPPS
2006
IEEE
16 years 10 days ago
Distributed algorithm for a color assignment on asynchronous rings
We study a version of the β-assignment problem [3] on asynchronous rings: consider a set of items and a set of m colors, where each item is associated to one color. Consider also...
Gianluca De Marco, Mauro Leoncini, Manuela Montang...
PODC
2003
ACM
15 years 11 months ago
Compact roundtrip routing with topology-independent node names
This paper presents compact roundtrip routing schemes with local tables of size ˜O( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tabl...
Marta Arias, Lenore Cowen, Kofi A. Laing
CLUSTER
2002
IEEE
15 years 11 months ago
Shell over a Cluster (SHOC): Towards Achieving Single System Image via the Shell
With dramatic improvements in cost-performance, the use of clusters of personal computers is fast becoming widespread. For ease of use and management, a Single System Image (SSI) ...
C. M. Tan, C. P. Tan, Weng-Fai Wong
PODC
1997
ACM
15 years 10 months ago
The Load and Availability of Byzantine Quorum Systems
Replicated services accessed via quorums enable each access to be performed at only a subset (quorum) of the servers and achieve consistency across accesses by requiring any two qu...
Dahlia Malkhi, Michael K. Reiter, Avishai Wool
PODC
1998
ACM
15 years 10 months ago
Optimal Efficiency of Optimistic Contract Signing
A contract is a non-repudiable agreement on a given contract text, i.e., a contract can be used to prove agreement between its signatories to any verifier. A contract signing sche...
Birgit Pfitzmann, Matthias Schunter, Michael Waidn...