Task mapping algorithm for heterogeneous computing system allowing high throughput and load balancing

Authors:
Sung Chune Choi;Hee Yong Youn
Affiliations:
School of Information and Communications Engineering, Sungkyunkwan University, Suwon, Korea;School of Information and Communications Engineering, Sungkyunkwan University, Suwon, Korea
Venue:
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
Year:
2005

Citing 5
Cited 0

Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors

Journal of the ACM (JACM)
A High-Performance Mapping Algorithm for Heterogeneous Computing Systems

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Scheduling Resources in Multi-User, Heterogeneous, Computing Environments with SmartNet

HCW '98 Proceedings of the Seventh Heterogeneous Computing Workshop
Dynamic Matching and Scheduling of a Class of Independent Tasks onto Heterogeneous Computing Systems

HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
Task Execution Time Modeling for Heterogeneous Computing Systems

HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop

Quantified Score

Hi-index	0.00

Visualization

Abstract

The applicability and strength of heterogeneous computing systems are derived from their ability to match computing nodes to appropriate tasks since a suite of different machines are interconnected. A good mapping algorithm offers minimal expected completion time and machine idle time. In this paper we propose a new task scheduling algorithm allowing higher performance than the existing algorithms such as the Min-min, Max-min, and Sufferage algorithm. It is achieved by task swapping approach based on the expected completion time and ready time of each machine. Extensive computer simulation validates the proposed algorithm along with the earlier ones.