@inproceedings{d4bf0e5259ba4ab2907061feb5b10697,

title = "Rate monotonic scheduling algorithm: Exact characterization and average case behavior",

abstract = "An exact characterization of the ability of the rate monotonic scheduling algorithm to meet the deadlines of a periodic task set is represented. In addition, a stochastic analysis which gives the probability distribution of the breakdown utilization of randomly generated task sets is presented. It is shown that as the task set size increases, the task computation times become of little importance, and the breakdown utilization converges to a constant determined by the task periods. For uniformly distributed tasks, a breakdown utilization of 88% is a reasonable characterization. A case is shown in which the average-case breakdown utilization reaches the worst-case lower bound of C. L. Liu and J. W. Layland (1973).",

author = "John Lehoczky and Lui Sha and Ye Ding",

year = "1989",

language = "English (US)",

isbn = "0818620048",

series = "Proceedings - Real-Time Systems Symposium",

publisher = "Publ by IEEE",

pages = "166--171",

editor = "Anon",

booktitle = "Proceedings - Real-Time Systems Symposium",

note = "Proceedings - Real-Time Systems Symposium ; Conference date: 05-12-1989 Through 07-12-1989",

}