Heuristic file sorted assignment algorithm of parallel I/O on cluster computing system^①

来源期刊：中南大学学报(英文版)2005年第5期

论文作者：陈志刚 曾碧卿 熊策 邓晓衡 曾志文 刘安丰

文章页码：572 - 577

Key words：cluster computing; parallel I/O; file sorted assignment; variance of service time

Abstract: A new file assignment strategy of parallel I/O, which is named heuristic file sorted assignment algorithm was proposed on cluster computing system. Based on the load balancing, it assigns the files to the same disk according to the similar service time. Firstly, the files were sorted and stored at the setIin descending order in terms of their service time, then one disk of cluster node was selected randomly when the files were to be assigned, and at last the continuous files were taken orderly from the setIto the disk until the disk reached its load maximum. The experimental results show that the new strategy improves the performance by 20.2% when the load of the system is light and by 31.6% when the load is heavy. And the higher the data access rate, the more evident the improvement of the performance obtained by the heuristic file sorted assignment algorithm.

基金信息：the Specialized Research Fund for the Doctoral Program of Higher Education of China