Sciweavers

98 search results - page 7 / 20
» Messages, Clocks, and Gravitation
Sort
View
COCO
2010
Springer
153views Algorithms» more  COCO 2010»
14 years 1 months ago
Communication Complexity with Synchronized Clocks
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
Russell Impagliazzo, Ryan Williams
ICDCS
1996
IEEE
14 years 2 months ago
How to Recover Efficiently and Asynchronously when Optimism Fails
We propose a new algorithm for recovering asynchronously from failures in a distributed computation. Our algorithm is based on two novel concepts - a fault-tolerant vector clock t...
Om P. Damani, Vijay K. Garg
EDCC
2010
Springer
14 years 2 months ago
Early Consensus in Message-Passing Systems Enriched with a Perfect Failure Detector and Its Application in the Theta Model
: While lots of consensus algorithms have been proposed for crash-prone asynchronous message-passing systems enriched with a failure detector of the class Ω (the class of eventua...
François Bonnet, Michel Raynal
VLSISP
2010
140views more  VLSISP 2010»
13 years 8 months ago
A Split-Decoding Message Passing Algorithm for Low Density Parity Check Decoders
A Split decoding algorithm is proposed which divides each row of the parity check matrix into two or multiple nearly-independent simplified partitions. The proposed method signific...
Tinoosh Mohsenin, Bevan M. Baas
INFOCOM
2000
IEEE
14 years 2 months ago
Scalable, Low-Overhead Network Delay Estimation
Estimating the network delays between each pair of nodes in a multicast session is the key parameter in reliable multicast; it is used, among other things, in suppressing the impl...
Volkan Ozdemir, S. Muthukrishnan, Injong Rhee