### 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).

Original language | English (US) |
---|---|

Title of host publication | Proceedings - Real-Time Systems Symposium |

Editors | Anon |

Publisher | Publ by IEEE |

Pages | 166-171 |

Number of pages | 6 |

ISBN (Print) | 0818620048 |

State | Published - Dec 1 1989 |

Externally published | Yes |

Event | Proceedings - Real-Time Systems Symposium - Santa Monica, CA, USA Duration: Dec 5 1989 → Dec 7 1989 |

### Publication series

Name | Proceedings - Real-Time Systems Symposium |
---|

### Other

Other | Proceedings - Real-Time Systems Symposium |
---|---|

City | Santa Monica, CA, USA |

Period | 12/5/89 → 12/7/89 |

### ASJC Scopus subject areas

- Software
- Hardware and Architecture
- Computer Networks and Communications

## Fingerprint Dive into the research topics of 'Rate monotonic scheduling algorithm: Exact characterization and average case behavior'. Together they form a unique fingerprint.

## Cite this

*Proceedings - Real-Time Systems Symposium*(pp. 166-171). (Proceedings - Real-Time Systems Symposium). Publ by IEEE.