Calypso: an implementation of the order graph method

Previous efforts to speed up signal and image processing algorithms have focused on executing them in parallel on multiprocessor systems. An important issue in achieving the maximum parallelism is how to automatically partition and schedule algorithms onto the individual processors. We present the order graph method (OGM) as an effective technique for parallel task scheduling which considers interprocessor communication and network topology. Calypso is introduced as an implementation of the OGM. Results from scheduling image processing algorithms are presented. In addition, we propose some standard benchmarks that can be used to compare various methods for parallel task scheduling