| 自适应分片算法研究 |
| |
| 引用本文： | 毛友发,杨明福. 自适应分片算法研究[J]. 计算机工程与应用, 2004, 40(30): 68-70 |
| |
| 作者姓名： | 毛友发 杨明福 |
| |
| 作者单位： | 华东理工大学信息学院,上海,200237;华东理工大学信息学院,上海,200237 |
| |
| 摘 要： | 论文提出了一个自适应磁盘分片算法。首先,利用M/G/1排队理论对单个文件和整个阵列的平均存储响应时间建模,并提出了最优分片宽度理论计算公式;考虑到访问流之间的竞争,论文提出了一个磁盘分片的启发算法,它同时计算没有背景负荷和有背景负荷下访问流对应的磁盘优化分片,最终的磁盘分片是两者的结合;模拟试验表明自适应分片算法在四种分片算法中的性能最佳。
|
| 关 键 词： | 分片 M/G/1 自适应 |
| 文章编号： | 1002-8331-(2004)30-0068-03 |
A Novel Adaptive Disk Stripping Algorithm |
| |
| Mao Youfa Yang Mingfu. A Novel Adaptive Disk Stripping Algorithm[J]. Computer Engineering and Applications, 2004, 40(30): 68-70 |
| |
| Authors: | Mao Youfa Yang Mingfu |
| |
| Abstract: | 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. |
| |
| Keywords: | disk stripping M/G/1 adaptive |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
