Program partitioning for a control/data driven computer
Jurij Šilc, Borut Robič · Hrčak Portal of scientific journals of Croatia (University Computing Centre) · 1993
The paper examines the problem of dataflow graph partitioning aiming to improve the efficiency of macro-dataflow computing on a hybrid control/data driven architecture. The partitioning consists of dataflow graph synchronization and scheduling of the synchronous graph. A new scheduling algorithm, called Global Arc Minimization (GAM), is introduced. The performance of the GAM algorithm is evaluated relative to some other known heuristic methods for static scheduling. When interprocessor communication delays are taken into account, the GAM algorithm achieves better performance on the simulated hybrid architecture. Keywords: Macro dataflow, ring architecture, program partitioning, synchronization, scheduling. ? This work has been supported by Ministry of Science and Technology of the Republic of Slovenia under Grant Number J2-1133. This report will appear in the Journal of Computing and Information Technology 1(1):47-- 55, 1993. Technical Report CSD-93-7 February 1993 1 Introduction...