全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
软件学报  2002 

Random I/O Scheduling Algorithms in Online Tape Library Systems
磁带库系统的随机I/O调度算法

Keywords: tape library system,random I/O scheduling algorithm,static scheduling,dynamic scheduling,replication-based scheduling,benefit-cost-based scheduling
磁带库系统
,随机I/O调度算法,静态调度,动态调度,基于复制的调度,基于效益-代价均衡的调度

Full-Text   Cite this paper   Add to My Lib

Abstract:

Since the tape libraries have very poor random access performance, it is critical to study random I/O scheduling strategies and algorithms in order to improve the performance of tape library. In this paper, the existing scheduling algorithms are summarized first, and then the analytical results of the effectiveness of static scheduling, dynamic scheduling and replication-based scheduling are presented through simulations. In particular, a benefit-cost-based scheduling algorithm is given, which aims to improve the effectiveness of exosting scheduling algorithms under heavy workloads by tuning the weight ratio of cost and benefit of scheduling policies according to workloads.This algorithm is significantly effective under heavy workloads.The research of this paper forms the basis of the design of adaptive scheduling algorithms that can be used in massiv storage systems.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133