A General Framework for Parameterized Schedulability Bound Analysis of Real-Time Systems Academic Article

abstract

• In real-time systems, utilization-based schedulability test is a common approach to determine whether or not tasks can be admitted without violating deadline requirements. The test is extremely simple, since it only needs to compare the utilization of the tasks with a predetermined bound. As such, utilization-based schedulability tests are suitable for online use. The challenge is how to derive a reasonable utilization bound for a given system. Most existing results are obtained on a case-by-case basis because of their analytical complexity. In this paper, we develop a flexible and unified representation framework of real-time systems (i.e., tasks and schedulers) based on network calculus techniques. Our representation framework, together with the proposed bound derivation method, leads to a general bound result, which is applicable to a large family of real-time systems. 2006 IEEE.

authors

• Liu, Jyh

published proceedings

• IEEE TRANSACTIONS ON COMPUTERS

author list (cited authors)

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

citation count

• 8

complete list of authors

• Wu, Jianjia||Liu, Jyh-Charn Steve||Zhao, Wei

publication date

• June 2010

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE Transactions on Computers  Journal

keywords

• Network Calculus
• Schedulability Test
• Utilization
• Workload Rate

Digital Object Identifier (DOI)

• 10.1109/TC.2010.31

start page

• 776

end page

• 783

volume

• 59

issue

• 6

URL

• http%3A%2F%2Fdx.doi.org%2F10.1109%2Ftc.2010.31