Title :
Task clustering algorithm with improved efficiency
Author :
Maiza, M. ; Clarke, T.
Author_Institution :
Dept. of Electron., York Univ., UK
fDate :
6/6/1996 12:00:00 AM
Abstract :
The general problem of scheduling a set of tasks on a given parallel architecture is NP-complete. A scheduling heuristic introduced by Yang and Gerasoulis is considered, and two extensions are proposed which significantly improve efficiency at very low time complexity cost
Keywords :
computational complexity; parallel algorithms; processor scheduling; task analysis; NP-complete problem; efficiency; parallel architecture; scheduling heuristic; task clustering algorithm; time complexity;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19960740
