Abstract
Tertiary storages, such as tape libraries and optical disc libraries, are becoming the important storage devices in massive data applications. With the massive storage space they have, the tertiary storages have very low access efficiency. Designing good schedule algorithms is an important method to improve the access efficiency in tertiary storage. Stochastic Markov model is used for predicting the expected number of accesses to the data on tertiary storage. Two new schedule algorithms named MarkovMR and MarkovSRF are given also. Generally, in a tape library, there is a robot arm, a few of tape drives and a magazine where a lot of tapes located in. When the tapes are kept in tape drives, we call them online tapes. Otherwise, we call the tapes in the magazine offline tapes. Weight factors are used to above schedule algorithms to favor online tapes so that the requests for online tapes are served first before online tapes are ejected. The weighted algorithms are named wMarkovMR and wMarkovSRF. By compared to the Round-robin policy, the experimental results show that the four schedule algorithms based on Markov model have higher efficiency of data access in tertiary storage. The efficiency of wMarkovMR is highest among all the algorithms. Furthermore, the optimal factors can be derived from experiments.
Supported by the National Natural Science Foundation of China under Grant No.60273082; the National High-Tech Research and Development Plan of China under Grant No.2001AA41541; the National Grand Fundamental Research 973 Program of China under Grant No.G1999032704.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Sarawagi, S., Stonebraker, M.: Efficient organization of large multidimensional arrays. In: Proceedings of the Tenth International Conference on Data Engineering, Houston, Texas, USA, pp. 328–336. IEEE Computer Society Press, Los Alamitos (1994)
Ford, D.A., Christodoulakis, S.: Optimal Placement of High-Probability Randomly Retrieved Blocks on CLV Optical Discs. ACM Transactons On Information System 9(1), 1–30 (1991)
Triantafillou, P., Christodoulakis, S., Georgiadis, C.: Optimal Data Placement on Discs: A Comprehensive Solution for Different Technologies. HERMES Technical Report. Multimedia Systems Institute of Crete, Greece (1996)
Christodoulakis, S., Triantafillou, P., Zioga, F.: Principles of Optimally Placing Data in Tertiary Storage Libraries. In: VLDB Conf., Athens, Greece, pp. 236–245 (1997)
Shoshani, A., Bernardo, L.M., Nordberg, H., Rotem, D., Sim, A.: Multidimensional Indexing and Query Coordination for Tertiary Storage Management, SSDBM 1999 (1999)
Shoshani, A., Sim, A., Bernardo, L.M., Nordberg, H.: Coordinating Simultaneous Caching of File Bundles from Tertiary Storage. In: 12th International Conference on Scientific and Statistical Database Management, SSDBM 2000 (2000)
Johnson, T.: Coarse Indices for a Tape-Based Data Warehouse. In: Proceedings of the Fourteenth International conference on Data Engineering, Orlando, Florida, USA, pp. 231–240. IEEE Computer Society, Los Alamitos (1998)
Hillyer, A.K., Silberschatz, A.: Random I/O scheduling in online tertiary storage. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, Canada, pp. 195–204 (1996) (Other references are omitted)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, Y., Li, J., Zhang, Z., Liu, B. (2004). Dynamical Schedule Algorithms Based on Markov Model in Tertiary Storage. In: Li, Q., Wang, G., Feng, L. (eds) Advances in Web-Age Information Management. WAIM 2004. Lecture Notes in Computer Science, vol 3129. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27772-9_76
Download citation
DOI: https://doi.org/10.1007/978-3-540-27772-9_76
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22418-1
Online ISBN: 978-3-540-27772-9
eBook Packages: Springer Book Archive