A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures
Issue No. 02 - February (1993 vol. 4)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.207593
<p>The authors present a compile-time scheduling heuristic called dynamic level scheduling,which accounts for interprocessor communication overhead when mappingprecedence-constrained, communicating tasks onto heterogeneous processorarchitectures with limited or possibly irregular interconnection structures. This techniqueuses dynamically-changing priorities to match tasks with processors at each step, andschedules over both spatial and temporal dimensions to eliminate shared resourcecontention. This method is fast, flexible, widely targetable, and displays promisingperformance.</p>
Index Termsspatial dimensions; compile-time scheduling heuristic; interconnection-constrainedheterogeneous processor architectures; dynamic level scheduling; communicating tasks;temporal dimensions; parallel architectures; scheduling
G. Sih and E. Lee, "A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures," in IEEE Transactions on Parallel & Distributed Systems, vol. 4, no. , pp. 175-187, 1993.