This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
November 1977 (vol. 26 no. 11)
pp. 1101-1112
H.F. Li, Coordinated Science Laboratory, University of Illinois
Scheduling task trees to be executed in parallel and/or pipelined processing systems are examined under individual situations. Processor structural requirements at task nodes are also included in the model of consideration. While simple techniques can serve as heuristics, counterexamples are constructed in some crucial cases. Simple optimal algorithms are presented in two important cases: 1) unistructure, multipipe, uniform latency, and flush time; and 2) vector loops. Finally, the complexity of the remaining cases is scrutinized with different structural parameter combinations.
Index Terms:
Flush time, latency, parallel, pipeline, polynomial completeness, preemption, reconfiguration, scheduling vector, sharing, structure, tree.
Citation:
H.F. Li, "Scheduling Trees in Parallel/Pipelined Processing Environments," IEEE Transactions on Computers, vol. 26, no. 11, pp. 1101-1112, Nov. 1977, doi:10.1109/TC.1977.1674756
Usage of this product signifies your acceptance of the Terms of Use.