Recovery management in QuickSilver
ACM Transactions on Computer Systems (TOCS)
A simple and efficient implementation of a small database
SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
The Sprite Network Operating System
Computer
A case for redundant arrays of inexpensive disks (RAID)
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Fault-tolerant computing based on Mach
ACM SIGOPS Operating Systems Review
The Design of the POSTGRES Storage System
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Naming, State Management, and User-Level Extensions in the Sprite
Naming, State Management, and User-Level Extensions in the Sprite
| Hi-index | 0.00 |
In the Sprite environment, tolerating faults means recovering from them quickly. Our position is that performance and availability are the desired features of the typical locally-distributed office/engineering environment, and that very fast server recovery is the most cost-effective way of providing such availability. Mechanisms used for reliability are often inappropriate in systems with the primary goal of performance, and some availability-oriented methods using replicated hardware or processes cost too much for these systems. In contrast, availability via fast recovery need not slow down a system, and our experience in Sprite shows that in some cases the same techniques that provide high performance also provide fast recovery. In our first attempt to reduce server recovery times to less than a minute, we take advantage of the distributed state already present in our file system, and a high-performance log-structured file system currently under implementation.