Title: Topology Effects on Scheduling in Distributed Memory MIMD Machines
Author: Michal Cierniak, University of Edinburgh.
Source: MSc Thesis, University of Edinburgh, September 1991.
Full text: pdf, ps
Keywords: parallel processing, multiprocessor, DM-MIMD, scheduling, performance

Scheduling programs represented by task graphs (dags) onto multiprocessors represented by processor graphs (undirected graphs) is tackled in this project. A new linear time heuristic (MMH) is proposed for task scheduling. MMH is a simplified version of the Mapping Heuristic. Execution times of programs scheduled by MMH onto different multiprocessors are compared. Finally, a simple way of estimating a quality of a topology is proposed.

Back to Michał's publications

Last updated: 2005-03-23 by Michał Cierniak.