Back to Search Start Over

Utilization Bound Revisited.

Authors :
Deji Chen
Mok, Aloysius K.
Tei-Wei Kuo
Source :
IEEE Transactions on Computers. Mar2003, Vol. 52 Issue 3, p351. 11p. 3 Black and White Photographs, 2 Diagrams, 2 Graphs.
Publication Year :
2003

Abstract

Discusses the concepts of extremely and critically utilizing task set and an approach to find the utilization bound as a function of the information about the task set. Preemptive fixed-priority scheduling; Rate-monotonic priority assignment; Linear programming; Bound algorithms.

Details

Language :
English
ISSN :
00189340
Volume :
52
Issue :
3
Database :
Academic Search Index
Journal :
IEEE Transactions on Computers
Publication Type :
Academic Journal
Accession number :
9202063
Full Text :
https://doi.org/10.1109/TC.2003.1183949