关键词: 并行I/O, 连通图, 极大独立集, 矩阵

Abstract: Many samples suit to use collective I/O in one zone, which needs to find a main process to do I/O of this zone. When more than one zone has the same main process, priority level need be assigned to each zone. This paper presented a new algorithm, multilevel maximal independent sets, to solve the above problem. Through analysis, this algorithm can realize the highest parallel degree of I/O and communication load is the least at the highest degree.

Key words: parallel i/o, connected graph, maximal independent sets, matrix