A static multiprocessor scheduling algorithm for arbitrary directed task graphs in uncertain environments

Jun Yang*, Xiaochuan Ma, Chaohuan Hou, Zheng Yao

*Corresponding author af dette arbejde

Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskningpeer review

4 Citationer (Scopus)

Abstract

The objective of a static scheduling algorithm is to minimize the overall execution time of the program, represented by a directed task graph, by assigning the nodes to the processors. However, sometimes it is very difficult to estimate the execution time of several parts of a program and the communication delays under different circumstances. In this paper, an uncertain intelligent scheduling algorithm based on an expected value model and a genetic algorithm is presented to solve the multiprocessor scheduling problem in which the computation time and the communication time are given by stochastic variables. In simulation examples, it shows that the algorithm performs better than other algorithms in uncertain environments.

OriginalsprogEngelsk
TitelAlgorithms and Architectures for Parallel Processing - 8th International Conference, ICA3PP 2008, Proceedings
Antal sider12
ForlagSpringer
Publikationsdato2008
Sider18-29
ISBN (Trykt)9783540695004
DOI
StatusUdgivet - 2008
Udgivet eksterntJa
Begivenhed8th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2008 - , Cypern
Varighed: 9 jun. 200811 jun. 2008

Konference

Konference8th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2008
Land/OmrådeCypern
Periode09/06/200811/06/2008
NavnLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Vol/bind5022 LNCS
ISSN0302-9743

Citationsformater