| Heuristic file sorted assignment algorithm of parallel I/O on cluster computing system |
| |
| 作者姓名： | 陈志刚 曾碧卿 熊策 邓晓衡 曾志文 刘安丰 |
| |
| 作者单位： | School of Information Science and Engineering, Central South University, Changsha 410083, China |
| |
| 基金项目： | 湖南省自然科学基金，The Natural Science Foundation of Hunan Province |
| |
| 摘 要： | 1INTRODUCTION Withthedevelopmentofcomputertechnolo gies,dataprocessing,transferringandstoringareadvancedgreatly.ButtheperformanceofI/Osub systemisnotimprovedaccordingly.SotheI/Osubsystembecomesabottleneckofthehighper formancecomputing13].Theeffectivemethodofsolvingtheproblemreliesonsoftware,thatis,tostoreandaccessdatainparallelI/Oacrossmulti nodesofclusterintermsofsomefileallocatingstrategies4].TheprofessionalpracticeprovesthatparallelI/Oisaneffectivemethodtoeliminatethebottleneck.T…
|
| 关 键 词： | 计算机 数据处理 I/O次系统 程序 |
| 文章编号： | 1005-9784（2005）05-0572-06 |
| 收稿时间： | 2004-10-31 |
| 修稿时间： | 2004-12-10 |
Heuristic file sorted assignment algorithm of parallel I/O on cluster computing system |
| |
| Chen Zhi-gang , Zeng Bi-qing , Xiong Ce , Deng Xiao-heng , Zeng Zhi-wen and Liu An-feng.Heuristic file sorted assignment algorithm of parallel I/O on cluster computing system[J].Journal of Central South University of Technology,2005,12(5):572-577. |
| |
| Authors: | Chen Zhi-gang Zeng Bi-qing Xiong Ce Deng Xiao-heng Zeng Zhi-wen and Liu An-feng |
| |
| Affiliation: | (1) School of Information Science and Engineering, Central South University, 410083 Changsha, China |
| |
| 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 set I in 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 set I to 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. |
| |
| Keywords: | cluster computing parallel I/O file sorted assignment variance of service time |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ |
