Multi-disk management algorithms
作者： Miron Livny , Setrag Khoshafian , Haran Boral
DOI: 10.1145/29903.29914
关键词:
摘要: We investigate two schemes for placing data on multiple disks. show that declustering (spreading each file across several disks) is inherently better than clustering (placing a single disk) due to number of reasons including parallelism and uniform load all
acm.org
sci-hub.st 参考文章(6)
Leonard Kleinrock, Theory, Volume 1, Queueing Systems Wiley-Interscience. ,(1975)
M. Y. Kim, Parallel Operation of Magnetic Disk Storage Devices: Synchronized Disk Interleaving Database Machines. pp. 300- 330 ,(1985) , 10.1007/978-1-4612-5144-6_15
Geist, Trivedi, Optimal Design of Multilevel Storage Hierarchies IEEE Transactions on Computers. ,vol. 31, pp. 249- 260 ,(1982) , 10.1109/TC.1982.1675981
Myron Melman, Miron Livny, The DISS methodology of distributed system simulation Simulation. ,vol. 42, pp. 163- 176 ,(1984) , 10.1177/003754978404200404
Lawrence W. Dowdy, Derrell V. Foster, Comparative Models of the File Assignment Problem ACM Computing Surveys. ,vol. 14, pp. 287- 313 ,(1982) , 10.1145/356876.356883
Hector Garcia-Molina, Kenneth Salem, Disk striping international conference on data engineering. pp. 336- 342 ,(1986)