DocumentCode
3354171
Title
Dynamic hierarchies and optimization in distributed storage systems
Author
Buck, A.L. ; Coyne, R.A., Jr.
Author_Institution
IBM, Houston, TX, USA
fYear
1991
fDate
7-10 Oct. 1991
Firstpage
85
Lastpage
91
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
distributed processing; file organisation; memory architecture; disk-tape hierarchy; distributed storage system; location transparencies; optimization primitive; Control systems; Costs; Databases; Delay; Distributed computing; High performance computing; Humans; Investments; Processor scheduling; Robots;
fLanguage
English
Publisher
ieee
Conference_Titel
Mass Storage Systems, 1991. Digest of Papers., Eleventh IEEE Symposium on
Conference_Location
Monterey, CA, USA
Print_ISBN
0-8186-2155-9
Type
conf
DOI
10.1109/MASS.1991.160216
Filename
160216
Link To Document