Scheduling Program Task Graphs on MIMD Architectures

Abstract

Scheduling is a mapping of parallel tasks onto a set of physical processors and a determination of the starting time of each task. In this paper, we discuss several static scheduling techniques used for distributed memory architectures. We also give an overview of a software system PYRROS [38] that uses the scheduling algorithms to generate parallel code for message passing architectures