摘要： 研究了并行存储预取优化算法,根据并行存储的主要访问模式,提出要同时对文件内数据块访问和文件间访问进行建模,并对文件内数据块访问和文件间访问建模分别提出了E_IS_PPM算法和Last_N_Successor算法。最后将两个算法结合起来,提出了文件预取综合算法,算法根据计算和存储的可重叠程度以及文件预取页面的可获得性,自适应地决定预取深度。

关键词: 并行存储, 优化, 建模, 自适应

Abstract: This paper researches into the parallel prefetching optimizing algorithm. It argues that this should model both the intra-file and inter-file access pattern according to the parallel I/Os characteristics. It proposes E_IS_PPM and Last_N_Successor algorithms to do this. In the last part of the paper, it integrates them and proposes the integrated prefetching algorithm which adaptively decides prefetching depth according to: (1)the overlapping degree of computing and I/O,(2)the availability of the prefetching buffer page.

中图分类号: 

• TP316