By Topic

Calypso: an implementation of the order graph method

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Cato, G.R. ; Dept. of Comput. Sci., North Carolina State Univ., Raleigh, NC, USA ; Reeves, D.S.

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

Published in:

Acoustics, Speech, and Signal Processing, 1996. ICASSP-96. Conference Proceedings., 1996 IEEE International Conference on  (Volume:6 )

Date of Conference:

7-10 May 1996