Sciweavers

219 search results - page 29 / 44
» Byzantine Quorum Systems
Sort
View
ISPDC
2006
IEEE
14 years 3 months ago
How to Achieve High Throughput with Dynamic Tree-Structured Coterie
Data replication permits a better network bandwidth utilization and minimizes the effect of latency in large-scale systems such as computing grids. However, the cost of maintainin...
Ivan Frain, Abdelaziz Mzoughi, Jean Paul Bahsoun
DSN
2004
IEEE
14 years 1 months ago
A Decentralized Algorithm for Erasure-Coded Virtual Disks
A Federated Array of Bricks is a scalable distributed storage system composed from inexpensive storage bricks. It achieves high reliability with low cost by using erasure coding a...
Svend Frølund, Arif Merchant, Yasushi Saito...
IAW
2003
IEEE
14 years 3 months ago
Assuring Consistency and Increasing Reliability in Group Communication Mechanisms in Computational Resiliency
— The Computational Resiliency library (CRLib) provides distributed systems with the ability to sustain operation and dynamically restore the level of assurance in system functio...
Norka B. Lucena, Steve J. Chapin, Joohan Lee
OPODIS
2004
13 years 11 months ago
Optimal Resilience Asynchronous Approximate Agreement
Consider an asynchronous system where each process begins with an arbitrary real value. Given some fixed > 0, an approximate agreement algorithm must have all non-faulty process...
Ittai Abraham, Yonatan Amit, Danny Dolev
IPTPS
2004
Springer
14 years 3 months ago
A Practical Distributed Mutual Exclusion Protocol in Dynamic Peer-to-Peer Systems
— Mutual exclusion is one of the well-studied fundamental primitives in distributed systems. However, the emerging P2P systems bring forward several challenges that can’t be co...
Shiding Lin, Qiao Lian, Ming Chen, Zheng Zhang