Links

Tools

Export citation

Search in Google Scholar

Bounding the makespan of best pre-scheduling of task graphs with fixed communication delays and random execution times on a virtual distributed system

Journal article published in 1 by M. Nakechbandi, J. Y. Colin, C. Delaruelle
This paper was not found in any repository; the policy of its publisher is unknown or unclear.
This paper was not found in any repository; the policy of its publisher is unknown or unclear.

Full text: Unavailable

Question mark in circle
Preprint: policy unknown
Question mark in circle
Postprint: policy unknown
Question mark in circle
Published version: policy unknown

Abstract

In this paper, we consider the problem of scheduling tasks with fixed small communications delays on a virtual distributed memory multiprocessor when the tasks execution times are random. This problem extends the classical PERT scheduling problem with random execution times and no communications. We first present how to efficiently build pre-schedulings for this problem. We then compute a lower bound of the average makespan of a given pre-scheduling. We finally propose a lower and an upper bound of the execution time of the best pre-scheduling.