RAID: high-performance, reliable secondary storage
ACM Computing Surveys (CSUR)
Fast concurrent access to parallel disks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Algorithmic Studies in Mass Storage Systems
Algorithmic Studies in Mass Storage Systems
Stochastic Analysis of Computer Storage
Stochastic Analysis of Computer Storage
| Hi-index | 0.00 |
In the seventies and eighties extensive work on mathematical modeling and performance evaluation of disks and disk arrays was carried out. The main tools were stochastic and combinatorial analysis. For the combinatorial approach led by C. K. Wong and his collaborators the reader is urged to consult [11]. for the stochastic approach led by E. G. Coffman and his collaborators one should consult [3]. Both references provide rather extensive bibliographies. In the late eighties and the nineties with the coming of the RAID "revolution", most of the work in the area has become rather heuristic in nature, see [5] for a survey, with a few notable exceptions.In this abstract we would like to report on two recent results which relate performance and modeling issues in disks and disk arrays to the theory of metric spaces and the theory of graph evolution and phase transition. We hope this will revive the spirit of the work done in the seventies and eighties (in other walks of life this may not be advisable). The results are taken from [2] and [4]