A snapshot differential refresh algorithm
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Serverless network file systems
ACM Transactions on Computer Systems (TOCS) - Special issue on operating system principles
Petal: distributed virtual disks
Proceedings of the seventh international conference on Architectural support for programming languages and operating systems
Logical vs. physical file system backup
OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
A snapshot algorithm for distributed mobile systems
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
File system design for an NFS file server appliance
WTEC'94 Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference
VLDB '80 Proceedings of the sixth international conference on Very Large Data Bases - Volume 6
| Hi-index | 0.00 |
Snapshots are a useful mechanism to manage data, particularly for backups in high-availability storage systems. This paper presents the Instant Image algorithm for handling snapshots of storage volumes in a distributed storage system. The algorithm places no restrictions on the choice of storage volumes, allowing snapshot relationships between storage volumes that can be transitive and cyclical. In addition, in a distributed environment with snapshot relationships involving n storage subsystems per read or write to storage volumes involve only O(1) storage subsystems per read or write, thereby reducing messaging costs. Finally, the algorithm is not specific to storage systems and can be applied to other contexts requiring snapshots. A performance analysis indicates doubling of average read and write performance on a cluster of storage subsystems.