A graph transformational approach to the multiprocessor scheduling of iterative computations

Abstract

A modular strategy for scheduling iterative computations is proposed. An iterative computation is represented using a cyclic task-graph. The cyclic task-graph is transformed into an acyclic task-graph. This acyclic task-graph is subsequently scheduled using one of the many well-known and high-quality static scheduling strategies from the literature. Graph… (More)

Topics

4 Figures and Tables

Cite this paper

@inproceedings{Sandnes2003AGT, title={A graph transformational approach to the multiprocessor scheduling of iterative computations}, author={Frode Eika Sandnes and Oliver Sinnen}, year={2003} }