期刊文献+

一种基于效益-代价均衡的磁带库调度算法 被引量:3

A Cost-Benefit-Based Scheduling Algorithm of Online Tape Library
下载PDF
导出
摘要 诸如数字图书馆等规模在1012字节以上的大型数据库需要在线存取大容量磁带库中的海量数据.由于这些需求都是对海量数据的随机存取,而磁带库的随机存取性能很差,所以,研究有效的磁带库随机I/O调度策略和算法是改善磁带库系统性能的重要课题.提出并研究了一种基于效益-代价均衡的调度算法,给出一种有效的效益-代价加权比的估算方法.该算法根据系统的工作负载特点,动态调节调度的效益和代价的加权比,从而改善了磁带库系统在各种负载下的系统性能.研究解决了已有磁带库调度算法的对工作负载敏感的问题,极大改善了调度算法在重负载下的有效性. The terabyte-level (1012 bytes) database systems such as digital libraries need to use tape library as an online device to store and retrieve their massive data. Since the access of a tape library is often random and the tape library has low random access performance, thus it is critical to study the random I/O scheduling strategies and algorithms in order to improve the performance of tape library. In this paper we study a cost-benefit-based scheduling algorithm, and as well as give an effective estimating method of cost-benefit weight ratio. This algorithm improves the performance of tape library system under different workloads by dynamically tuning the cost-benefit weight ratio of scheduling policies according to workloads. This algorithm particularly overcomes the problem of workload-sensitive of existing scheduling algorithms, and is significantly effective under heavy workload.
出处 《软件学报》 EI CSCD 北大核心 2002年第2期239-244,共6页 Journal of Software
基金 国家重点基础研究发展规划973资助项目(G1999032704)
关键词 效益-代价估算 磁带库 磁盘存储系统 随机I/O调度算法 online tape library system random I/O scheduling of tapes hot data replication cost-benefit estimating
  • 相关文献

参考文献6

  • 1Cari?o, F., Kaufmann, A., Kostamaa, P. Are you ready for Yottabytes? In: Kobler, B., ed. Proceedings of the 17th IEEE Symposium on Mass Storage Systems in Cooperation with the 8th NASA GSFC Conference on Mass Storage Systems and Technologies. Los Alamitors, CA: IEEE Computer Society Press, 2000. 476~485.
  • 2Cari?o, F., Burgess, J., O'Connell, W., et al. Active storage hierarchy, database systems and applications--socratic exegesis. In: Malcolm, P.A., Maria, E.O., et al., eds. Proceedings of the 25th International Conference on Very Large Data Bases. Edinburgh: Morgan Kaufmann Publishers, Inc., 1999. 611~614.
  • 3Hillyer, B.K., Silberschatz, A. Random I/O scheduling in online tertiary storage systems. In: Jagadish, H.V., Mumick, I.S., eds. Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data. Quebec: ACM Press, 1996. 195~204.
  • 4Triantafillou, P., Georgiadis, I. Hierarchical scheduling algorithms for near-line tape libraries. In: Cammelli, A., Wagner, R. R., eds. Proceedings of the 10th International Conference and Workshop on Database and Expert Systems Applications. Florence: IEEE Computer Society Press, 1999. 50~54.
  • 5Hillyer, B. K., Rastogi, R., Silberschatz, A. Scheduling and data replication to improve tape jukebox performance. In: Papazoglou, M., Pu, C., Kitsuregawa, M., eds. Proceeding of the 15th International Conference on Data Engineering. Sydney: IEEE Computer Society Press, 1999. 532~541.
  • 6Nemoto, T., Kitsuegawa, M. Scalable tape archiver for satellite image database and its performance analysis with access logs--hot declustering and hot replication. In: Miller, E., ed. Proceedings of the 16th IEEE Symposium on Mass Storage Systems in Cooperation with the 7th NASA GSFC Conference on Mass Storage Systems and Technologies. San Diego: IEEE Computer Society Press, 1999. 59~71.

同被引文献25

  • 1Olav Sandsta, ANDERSEN T M, MIDTSTRAUM R, et al. Access time modeling of a MLR1 tape drive[A]. Proceedings of Norsk Informatikkonferanse, NIK' 97 [ C].1997. 267-278.
  • 2HILLYER B K, RASTOGI R, SILBERSCHATZ A.Scheduling and data replication to improve tape jukebox performance[A]. Proceedings of the 15th International Conference on Data Engineering[C]. Sydney, Australia, 1999. 532-541.
  • 3Olav Sandst a ,and Roger Midtstraum. Improving the access time performance of serpentine tape drives[A], proceedings of the 15th International Conference on Data Engineering[C]. Sydney, Australia, 1999. 542-551.
  • 4Peter Triantafillou, GEORGIADIS I. Hierarchical scheduling algorithms for near-line tape libraries[A]. Proc of the 10th Intemation-,d Cxxlference and Workshop on Database and Expert Systems Applications[C]. 1999.50-54.
  • 5HILLYER B K, RASTOGI R, SILBERSCHATZ A.Scheduling and data replication to improve tape jukebox performance[A]. Proceedings of the 15th International Conference on Data Engineering[C]. Sydney, Australia, 1999. 532-541.?A
  • 6Olav Sandst a and Roger Midtstraum. Improving the acce ss time performance of serpentine tape drives[A]. Proceedings of the 15th International Conference on Data Engineering[ C]. Sydney, Australia, 1999. 542-551.?A
  • 7Peter Triantafillou, GEORGIADIS I. Hierarchical scheduling algorithms for near-line tape libraries[A]. Proc of the 10th International Conference and Workshop on Database and Expert Systems Applications[C]. 1999.50-54.?A
  • 8Olav Sandsta, ANDERSEN T M, MIDTSTRAUM R, et al. Access time modeling of a MLR1 tape drive[A]. Proceedings of Norsk Informatikkonferanse, NIK' 97 [C].1997. 267-278.?A
  • 9HILLYER B K, SILBERSCHATZ A. Random I/O scheduling in online tertiary storage[ A]. Proceedings of ACM SIGMOD Int Conf on Management of Data [ C ].ACM press, 1996. 195 - 204.
  • 10SANDSTA O, MIDTSTRAUM R. Improving the access time performance of serpentine tape drives[ A]. Proceedings 15th International Conference on Data Engineering[ C ]. Sydney:IEEE Computer Society,1999. 542-551.

引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部