Task merging for better scheduling

Authors:
Saeed Parsa;Neda Reza Soltani;Saeed Shariati
Affiliations:
Department of Computer Engineering, Iran University of Science and Technology, Tehran, Iran;Department of Computer Engineering, Iran University of Science and Technology, Tehran, Iran;Department of Computer Engineering, Iran University of Science and Technology, Tehran, Iran
Venue:
HPCA'09 Proceedings of the Second international conference on High Performance Computing and Applications
Year:
2009

Citing 7
Cited 1

Automatic determination of grain size for efficient parallel processing

Communications of the ACM - Special issue: multiprocessing
An efficient heuristic for code partitioning

Parallel Computing
Static scheduling algorithms for allocating directed task graphs to multiprocessors

ACM Computing Surveys (CSUR)
Hypertool: A Programming Aid for Message-Passing Systems

IEEE Transactions on Parallel and Distributed Systems
DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors

IEEE Transactions on Parallel and Distributed Systems
A Comparison of Heuristics for Scheduling DAGs on Multiprocessors

Proceedings of the 8th International Symposium on Parallel Processing
An Evolutionary Approach to Task Graph Scheduling

ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I

Task graph pre-scheduling, using Nash equilibrium in game theory

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.