PODC
2011
ACM
12 years 7 months ago
2011
ACM
Internet supercomputing is becoming an increasingly popular means for harnessing the power of a vast number of interconnected computers. This comes at a cost substantially lower t...
TPDS
2008
13 years 4 months ago
2008
When employing a consensus algorithm for state machine replication, should one optimize for the case that all communication links are usually timely, or for fewer timely links? Do...
JPDC
2008
13 years 4 months ago
2008
We investigate the problem of detecting termination of a distributed computation in systems where processes can fail by crashing. Specifically, when the communication topology is ...
ICALP
2010
Springer
13 years 6 months ago
2010
Springer
Gossip protocols, also known as epidemic dissemination schemes, are becoming increasingly popular in distributed systems. Yet, it has remained a partially open question to determin...
ICDCS
2010
IEEE
13 years 8 months ago
2010
IEEE
—There are several analytical results on distributed hash tables (DHTs) that can tolerate Byzantine faults. Unfortunately, in such systems, operations such as data retrieval and ...
IPTPS
2003
Springer
13 years 9 months ago
2003
Springer
We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is ro...
WDAG
2007
Springer
13 years 10 months ago
2007
Springer
Many recommend planning for the worst and hoping for the best. In this paper we devise efficient indulgent consensus algorithms that can tolerate crash failures and arbitrarily lo...
DSN
2007
IEEE
13 years 10 months ago
2007
IEEE
When employing a consensus algorithm for state machine replication, should one optimize for the case that all communication links are usually timely, or for fewer timely links? Do...