Title :
Parallel task scheduling using the order graph method
Author :
Cato, Gavin R. ; Reeves, Douglas S.
Author_Institution :
Dept. of Comput. Sci., North Carolina State Univ., Raleigh, NC, USA
Abstract :
This paper proposes a new approach for task scheduling of fully specified flow graphs (FSFG) on parallel processing systems. This new approach is based on the enumeration and manipulation of linear extensions identified from a FSFG. The objective is to obtain a multiprocessor schedule which meets a set of admissibility conditions (iteration period, number of processors, precedence, and non-preemption). Feedback and a system-wide iteration period for multiple input data streams are investigated. In addition, flexible models for communications and network topology are introduced to improve the reliability of generated multiprocessor schedules. The resulting order graph method for parallel task scheduling provides an effective, generalized mapping methodology for DSP multiprocessor systems
Keywords :
feedback; flow graphs; parallel processing; processor scheduling; scheduling; signal processing; admissibility conditions; fully specified flow graphs; generalized mapping methodology; linear extensions; multiprocessor schedule; order graph method; parallel processing systems; parallel task scheduling; Digital signal processing; Flow graphs; Iterative algorithms; Multiprocessing systems; Network topology; Parallel processing; Processor scheduling; Scheduling algorithm; Signal mapping; Signal processing algorithms;
Conference_Titel :
Computers and Communications, 1995., Conference Proceedings of the 1995 IEEE Fourteenth Annual International Phoenix Conference on
Conference_Location :
Scottsdale, AZ
Print_ISBN :
0-7803-2492-7
DOI :
10.1109/PCCC.1995.472509
