A new strategy for multiprocessor scheduling of cyclic task graphs
Source: International Journal of High Performance Computing and Networking, Volume 3, Number 1, 28 September 2005 , pp. 62-71(10)
Publisher: Inderscience Publishers
Abstract:A modular strategy for scheduling iterative computations is proposed. Iterative computations are represented using cyclic task graphs that are transformed into acyclic task graphs. These acyclic task graphs are subsequently scheduled using one of the many well known and high quality static scheduling strategies from the literature. Graph unfolding is not employed and the generated schedules therefore require less memory than schedules generated through graph unfolding. Further, the number of iterations does not need to be known at compile time. The paper experimentally quantifies how the task transformation affects the make span of the schedules and the effectiveness of the approach is compared to other methods including a graph unfolding strategy. A new more intuitive graph unfolding formulation is also presented.
Document Type: Research article
Affiliations: 1: Oslo University College, P.O. Box 4, St Olavs Plass, N-0130 Oslo, Norway. 2: Department of Electrical and Computer Engineering, The University of Auckland, Private Bag 92019, Auckland, New Zealand
Publication date: 2005-09-28
- The International Journal of High Performance Computing and Networking addresses the most innovative developments in high-performance computing and networking such as information and system architectures, grid and web based information management and infrastructures, data storage, management, analysis and visualisation, advanced networking with applications, scalable parallel computing, cluster and grid computing, distributed systems, and high performance scientific and engineering computing with applications.
- Information for Authors
- Submit a Paper
- Subscribe to this Title
- Terms & Conditions
- ingentaconnect is not responsible for the content or availability of external websites