DocumentCode
2156329
Title
Heterogeneous Dominant Sequence Cluster (HDSC): a low complexity heterogeneous scheduling algorithm
Author
Chan, Wai-Yip ; Li, Chi-Kwong
Author_Institution
Dept. of Electron. Eng., Hong Kong Polytech., Hong Kong
Volume
2
fYear
1997
fDate
20-22 Aug 1997
Firstpage
956
Abstract
A novel list scheduling technique, Heterogeneous List Scheduling technique (HLS), is presented. The technique is a procedure to design a scheduling algorithm for scheduling tasks into a heterogeneous environment. Using the technique, a Heterogeneous Dominant Sequence Cluster algorithm (HDSC) is proposed. This algorithm uses the critical paths and dominant sequence as scheduling heuristics with the goal of minimizing the parallel time. It is found that the proposed algorithm is of lower complexity when compared with ordinary designs and it is also suitable for use in a heterogeneous environment. Details of operations and characteristics of the scheduler being tested in different processor configurations have been conducted and satisfactory results are observed
Keywords
communication complexity; critical path analysis; parallel algorithms; processor scheduling; Heterogeneous Dominant Sequence Cluster algorithm; Heterogeneous List Scheduling technique; complexity; critical paths; dominant sequence; heterogeneous environment; low complexity heterogeneous scheduling algorithm; novel list scheduling technique; parallel time; processor configurations; scheduling heuristics; Algorithm design and analysis; Clustering algorithms; Communication networks; High level synthesis; Optimal scheduling; Polynomials; Processor scheduling; Scheduling algorithm; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, Computers and Signal Processing, 1997. 10 Years PACRIM 1987-1997 - Networking the Pacific Rim. 1997 IEEE Pacific Rim Conference on
Conference_Location
Victoria, BC
Print_ISBN
0-7803-3905-3
Type
conf
DOI
10.1109/PACRIM.1997.620418
Filename
620418
Link To Document