Static Scheduling of Instructions on Micronet-based Asynchronous Processors
ASYNC '96 Proceedings of the 2nd International Symposium on Advanced Research in Asynchronous Circuits and Systems
Scheduling task graphs optimally with A*
The Journal of Supercomputing
| Hi-index | 0.00 |
Effective and efficient automated parallelization of code is an objective of much research in parallel computing. One of the steps in going from serial source code to parallel executable code is scheduling -- the assignment of tasks to processors. Researchers often use a graphical intermediate representation of the program such as a program dependence graph (PDG) to help identify groups of tasks that can be executed in parallel and tasks that are to be scheduled on the same processor. Because the scheduling problem is NP-hard, many heuristic solutions have been proposed. This research is a comparison of some of the proposed solutions for the scheduling problem.