摘要
论文提出了一个自适应磁盘分片算法。首先,利用M/G/1排队理论对单个文件和整个阵列的平均存储响应时间建模,并提出了最优分片宽度理论计算公式;考虑到访问流之间的竞争,论文提出了一个磁盘分片的启发算法,它同时计算没有背景负荷和有背景负荷下访问流对应的磁盘优化分片,最终的磁盘分片是两者的结合;模拟试验表明自适应分片算法在四种分片算法中的性能最佳。
A novel disk stripping algorithm is proposed in this paper.Firstly,the queue theory of M/G/1 is used to model single file and RAID's response time,and the optimal strip width is proposed.Secondly,in order to account for the inter-stream competition,a heuristic algorithm is proposed.The algorithm considers the optimal strip width with and without background disk load and the final strip width is decided by both widths.Finally,the simulation shows that the adaptive algorithm is the best among four disk stripping algorithms.
出处
《计算机工程与应用》
CSCD
北大核心
2004年第30期68-70,共3页
Computer Engineering and Applications
