A dynamic communication contention awareness list scheduling algorithm for arbitrary heterogeneous system

  • Authors:

  • Xiaoyong Tang;Kenli Li;Degui Xiao;Jing Yang;Min Liu;Yunchuan Qin

  • Affiliations:

  • School of Computer and Communication, Hunan University, Changsha, China;School of Computer and Communication, Hunan University, Changsha, China;School of Computer and Communication, Hunan University, Changsha, China;School of Computer and Communication, Hunan University, Changsha, China;School of Computer and Communication, Hunan University, Changsha, China;School of Computer and Communication, Hunan University, Changsha, China

  • Venue:
  • ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part II
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Task scheduling is an essential aspect of parallel process system Most heuristics for this NP-hard problem assume fully connected homogeneous processors and ignore contention on the communication links Actually, contention for communication resources has a strong influence on the execution time of a parallel program in arbitrary network topology heterogeneous system This paper investigates the incorporation of contention awareness into task scheduling The innovation is the idea of dynamic scheduling edges to links, which we use the earliest communication finish time search algorithm based on shortest-path search algorithm The other novel idea proposed in this paper is scheduling priority based on recursive rank computation on heterogeneous arbitrary architectures The comparison study, based on randomly generated graphs, shows that our scheduling algorithm significantly surpass classic and static communication contention awareness algorithm, especially for high data transmission rate parallel application