Evolution-Based Scheduling of Computations and Communications on Distributed Memory Multicomputers

We present a compiler optimization approach that uses the simulated evolution (SE) paradigm to enhance the finish time of heuristically scheduled computations with communication times. This is specially beneficial to the class of Synchronous dataflow computations which are generally compiled once and run many times over different data sets. Unlike genetic approaches which generally use task swapping to create differential variation our approach consists of adding pseudo-edges to the task graph to guide the scheduler in the alignment and clustering of dominant tasks. Added edges alter only the task graph without modifying the scheduler which provides useful flexibility in the implementation of compiler optimization option. The intelligence of iterative methods is used by SE to reduce the run-time and to avoid local minima by using the hill climbing property of search-based methods. Evaluation is carried out for a wide category of computation graphs with communication times which are st...

• Type: Journal
• Year: 1999
• Where: CJ
• Authors: Mayez A. Al-Mouhamed
• Keywords: CJ 1999, Compiler Optimization, Edge Addition Se, Task Graph