Dynamic hierarchies and optimization in distributed storage systems
- 1 January 1991
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The authors propose techniques to allow controlled penetration of the location transparencies of a distributed storage system by generalizing the simple disk-tape hierarchy paradigm of current storage systems to include multiple co-existing dynamic storage hierarchies. An orthogonal, semantics-free optimization primitive is proposed to manipulate the relation between an object and its hierarchy. By managing the hierarchy attribute of a storage object and a systemwide configuration of storage device hierarchies, one can position objects on any desired set of devices without destroying the fundamental transparencies of the system. The level of detail concerning the storage location of an object can range from general (somewhere in the 'fast' storage hierarchy) to very explicit (a specific disk drive).Keywords
This publication has 9 references indexed in Scilit:
- Specifying data availability in multi-device file systemsACM SIGOPS Operating Systems Review, 1991
- Architectural Adaptability in Parallel Programming via Control AbstractionPublished by Defense Technical Information Center (DTIC) ,1991
- Distributed file systems: concepts and examplesACM Computing Surveys, 1990
- Edge: An extendible graph editorSoftware: Practice and Experience, 1990
- Dynamic Partial Orders and Generalized HeapsPublished by Springer Nature ,1990
- Object storage hierarchy managementIBM Systems Journal, 1990
- System-managed storageIBM Systems Journal, 1989
- Para-Functional ProgrammingComputer, 1986
- The Eden System: A Technical ReviewIEEE Transactions on Software Engineering, 1985