ReVive
Milos Prvulović, Zheng Zhang, Josep Torrellas · ACM SIGARCH Computer Architecture News · 2002
This paper presents ReVive, a novel general-purpose rollback recovery mechanism for shared-memory multiprocessors. ReVive carefully balances the conflicting requirements of availability, performance, and hardware cost. ReVive performs checkpointing, logging, and distributed parity protection, all memory-based. It enables recovery from a wide class of errors, including the permanent loss of an entire node. To maintain high performance, ReVive includes specialized hardware that performs frequent operations in the background, such as log and parity updates. To keep the cost low, more complex checkpointing and recovery functions are performed in software, while the hardware modifications are limited to the directory controllers of the machine. Our simulation results on a 16-processor system indicate that the average error-free execution time overhead of using ReVive is only 6.3%, while the achieved availability is better than 99.999% even when the errors occur as often as once per day.
Cited by 237 works. doi:10.1145/545214.545228
Authors
References
- A case for redundant arrays of inexpensive disks (RAID)
- A case for redundant arrays of inexpensive disks (RAID)
- System structure for software fault tolerance
- The SPLASH-2 programs
- System structure for software fault tolerance
- Database System Concepts
- A survey of rollback-recovery protocols in message-passing systems
- The Stanford Dash multiprocessor
- The SGI Origin
- DIVA: A Reliable Substrate for Deep Submicron Microarchitecture Design