Abstract
A self-stabilizing distributed file system is presented. The system constructs and maintains a spanning tree for each file volume. The spanning tree consists of the servers that have volume replicas and caches for the specific file volume. The spanning trees are constructed and maintained by self-stabilizing distributed algorithms. File system updates use the tree to implement file read and write operations.
Original language | English |
---|---|
Pages (from-to) | 384-389 |
Number of pages | 6 |
Journal | Proceedings of the IEEE Symposium on Reliable Distributed Systems |
State | Published - 1 Jan 2002 |
Event | The 21st IEEE Symposium on Reliable Distributed Systems (SRDS-2002) - Suita, Japan Duration: 13 Oct 2002 → 16 Oct 2002 |
ASJC Scopus subject areas
- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computer Networks and Communications