Task Merging for Better Scheduling

摘要：

This paper proposes a new algorithm to restructure task graphs for suitable scheduling. The algorithM reduces communication costs by merging those tasks within a task graph whose communication costs exceeds their execution time. Task duplication techniques are applied before the merge, to avoid any delay in the execution of the tasks dependent on the merged tasks. Our experiments with a number of known benchmark task graphs demonstrate the distinguished scheduling results provided by applying our task merging algorithm before the scheduling.

作者: Saeed Parsa Neda Reza Soltani Saeed Shariati

作者单位: Department of Computer Engineering,Iran University of Science and Technology, Tehran, Iran

会议类型: 国际会议

会议名称: The Second International Conference on High Performance Computing and Applications(第二届高性能计算及应用国际会议)

会议地点: 上海

会议语种:英文

页码: 311-316

在线出版日期: 2009-08-10（万方平台首次上网日期，不代表论文的发表时间）