By Topic

The modified mapping heuristic algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Boon Ping Gan ; School of Appl. Sci., Nanyang Technol. Univ., Singapore ; Shell Ying Huang

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