The modified mapping heuristic algorithm

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.