ÿþ<!doctype html public "-//w3c//dtd html 4.0 transitional//en"> <html> <head> <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1"> <title>Topology Effects on Scheduling in DM-MIMD Machines</title> </head> <body> <b>Title:</b> Topology Effects on Scheduling in Distributed Memory MIMD Machines<br> <b>Author:</b> <a href="http://cierniak.org/research">Michal Cierniak</a>, University of Edinburgh.<br> <b>Source:</b> MSc Thesis, University of Edinburgh, September 1991.<br> <b>Full text:</b> <a href="scheduling-1991.pdf">pdf</a>, <a href="scheduling-1991.ps">ps</a><br> <b>Keywords:</b> parallel processing, multiprocessor, DM-MIMD, scheduling, performance<br> <p> <b>Abstract:</b><br> 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. <p> <a href="index.html">Back to MichaB's publications</a> <p><hr> <font size=-2> Last updated: 2005-03-23 by MichaB Cierniak.</font> </body> </html>