An Evolutionary Approach to Task Graph Scheduling

  • Saeed Parsa
  • Shahriar Lotfi
  • Naser Lotfi
Conference paper

DOI: 10.1007/978-3-540-71618-1_13

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4431)
Cite this paper as:
Parsa S., Lotfi S., Lotfi N. (2007) An Evolutionary Approach to Task Graph Scheduling. In: Beliczynski B., Dzielinski A., Iwanowski M., Ribeiro B. (eds) Adaptive and Natural Computing Algorithms. ICANNGA 2007. Lecture Notes in Computer Science, vol 4431. Springer, Berlin, Heidelberg

Abstract

Effective scheduling is of great importance to parallel programming environments. The aim is to minimize the completion time of task graphs. The completion time of a task graph is directly affected by the length of its critical path. Hence, the trend of an evolutionary approach for task graph scheduling can be biased towards reduction of the critical path. In this paper, a new genetic scheduling algorithm is presented. The algorithm, in the first priority, minimizes the critical path length of the parallel program task graph and in the second priority minimizes the inter-processor communication time. Thereby, it achieves a better scheduling in comparison with the existing approaches.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Saeed Parsa
    • 1
  • Shahriar Lotfi
    • 1
  • Naser Lotfi
    • 1
  1. 1.Faculty of Computer Engineering, Iran University of Science and Technology, TehranIran

Personalised recommendations