DocumentCode
2801413
Title
Weighted control scheduling
Author
Vijayakumar, Aravind ; Brewer, Forrest
Author_Institution
Dept. of Electr. & Comput. Eng., California Univ., Santa Barbara, CA, USA
fYear
2005
fDate
6-10 Nov. 2005
Firstpage
777
Lastpage
783
Abstract
This paper describes a practical technique for the optimal scheduling of control dominated systems minimizing the weighted average latency over all control branches. Such a weighted metric is crucial for control dependent scheduling to accommodate practical architectural goals. In contrast to most weighting mechanisms, a nonBayesian probabilistic measure is used to avoid assumptions of branch independence. The underlying scheduling model allows general FSM-based models for operations, captures several forms of speculative execution and scales well with increasing control complexity.
Keywords
data flow computing; processor scheduling; control complexity; control dominated systems; nonBayesian probabilistic measure; optimal scheduling; weighted average latency; weighted control scheduling; weighted metric; Automata; Automatic control; Bayesian methods; Bifurcation; Control systems; Costs; Parallel processing; Processor scheduling; Terminology; Weight control;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer-Aided Design, 2005. ICCAD-2005. IEEE/ACM International Conference on
Print_ISBN
0-7803-9254-X
Type
conf
DOI
10.1109/ICCAD.2005.1560169
Filename
1560169
Link To Document