Referenced Items are not available for this document.
The Mapping Heuristic (MH) proposed by EI-Rewini and Lewis (1990) is a list scheduling technique that considers several real world parameters-the interconnection topology, link transfer rates and contention delay-neglected in other list scheduling algorithms. This work is to implement the mapping heuristic algorithm for a system with mesh interconnection topology. During implementation, some modifications were made to the original algorithm. The aim was to get a shorter schedule, to minimize contention delay and to minimize the number of processors used for execution without lengthening execution time. Some problems with the updating of the routing tables in the algorithm were identified and solutions were offered to solve them. Experiment results showed that the modified algorithm outperformed the original MH. The modified algorithm also works for systems with other topologies
Published in:
Algorithms & Architectures for Parallel Processing, 1996. ICAPP 96. 1996 IEEE Second International Conference on
Date of Conference: 11-13 Jun 1996
- Page(s):
- 456 - 463
- Meeting Date :
- 11 Jun 1996-13 Jun 1996
- Print ISBN:
- 0-7803-3529-5
- INSPEC Accession Number:
- 5485382
- Digital Object Identifier :
- 10.1109/ICAPP.1996.562909
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
