Abstract
This paper presents a new algorithm implementing reconfigurable atomic read/write memory for highly dynamic environments. The original RAMBO algorithm, recently developed by Lynch and Shvartsman, guarantees atomicity for arbitrary patterns of asynchrony, message loss, and node crashes. RAMBO II implements a different approach to establishing new configurations: instead of operating sequentially, the new algorithm reconfigures aggressively, transferring information from old configurations to new configurations in parallel. This improvement substantially reduces the time to establish a new configuration and to remove obsolete configurations. This, in turn, substantially increases fault tolerance and reduces the latency of read/write operations when the network is unstable or reconfiguration is bursty. This paper presents RAMBO II, a correctness proof, and a conditional analysis of its performance. Preliminary empirical studies illustrate the advantages of the new algorithm.
Original language | English (US) |
---|---|
Pages | 259-268 |
Number of pages | 10 |
DOIs | |
State | Published - 2003 |
Externally published | Yes |
Event | 2003 International Conference on Dependable Systems and Networks - San Francisco, CA, United States Duration: Jun 22 2003 → Jun 25 2003 |
Conference
Conference | 2003 International Conference on Dependable Systems and Networks |
---|---|
Country/Territory | United States |
City | San Francisco, CA |
Period | 6/22/03 → 6/25/03 |
ASJC Scopus subject areas
- Software
- Hardware and Architecture
- Computer Networks and Communications