264 search results - page 33 / 53 » Bounding the number of tolerable faults in majority-based sy... |
88
Voted
PDCAT
2005
Springer
15 years 2 months ago
2005
Springer
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
OTM
2009
Springer
15 years 4 months ago
2009
Springer
Byzantine Quorum Systems is a replication technique used to ensure availability and consistency of replicates data even in presence of arbitrary faults. This paper presents a Byzan...
84
Voted
STOC
2006
ACM
15 years 3 months ago
2006
ACM
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...
WDAG
1999
Springer
15 years 1 months ago
1999
Springer
This short paper establishes lower bounds on the time complexity of algorithms solving the generic broadcast problem. The paper shows that (a) to deliver messages in one round, no...
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
— Many distributed systems may be limited in their performance by the number of transactions they are able to support per unit of time. In order to achieve fault tolerance and to...