On schedulability bounds of static priority schedulers Conference Paper

abstract

• While utilization bound based schedulability test is simple and effective, it is often difficult to derive the bound itself. For its analytical complexity, utilization bound results are usually obtained on a case-by-case basis. In this paper, we develop a general framework that allows one to effectively derive schedulability bounds for a wide range of real-time systems with different workload patterns and schedulers. Our analytical model is capable of describing a wide range of tasks and schedulers' behaviors. We propose a new definition of utilization, called workload rate. While similar to utilization, workload rate enables flexible representation of different scheduling and workload scenarios and leads to uniform derivation of schedulability bounds. We derive a parameterized schedulability bound for static priority schedulers with arbitrary priority assignment. Existing utilization bounds for different priority assignments and task releasing patterns can be derived from our closed-form formula by simple assignments of proper parameters. 2005 IEEE.

name of conference

• 11th IEEE Real Time and Embedded Technology and Applications Symposium

authors

• Liu, Jyh

published proceedings

• RTAS 2005: 11TH IEEE REAL TIME AND EMBEDDED TECHNOLOGY AND APPLICATIONS SYMPOSIUM, PROCEEDINGS

author list (cited authors)

• Wu, J. J., Liu, J. C., & Zhao, W.

citation count

• 17

complete list of authors

• Wu, JJ||Liu, JC||Zhao, W

publication date

• January 2005

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• Proceedings of the IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS  Journal

Digital Object Identifier (DOI)

• 10.1109/rtas.2005.35

International Standard Book Number (ISBN) 10

• 0-7695-2302-1

start page

• 529

end page

• 540

URL

• http%3A%2F%2Fdx.doi.org%2F10.1109%2Frtas.2005.35