A faster exact schedulability analysis for fixed-priority scheduling

  • Lu W
  • Hsieh J
  • Shih W
 et al. 
  • 14


    Mendeley users who have this article in their library.
  • 5


    Citations of this article.


Real-time scheduling for task sets has been studied, and the corresponding schedulability analysis has been developed. Due to the considerable overheads required to precisely analyze the schedulability of a task set (referred to as exact schedulability analysis), the trade-off between precision and efficiency is widely studied. Many efficient but imprecise (i.e., sufficient but not necessary) analyses are discussed in the literature. However, how to precisely and efficiently analyze the schedulability of task sets remains an important issue. The Audsley's Algorithm was shown to be effective in exact schedulability analysis for task sets under rate-monotonic scheduling (one of the optimal fixed-priority scheduling algorithms). This paper focuses on reducing the runtime overhead of the Audsley's Algorithm. By properly partitioning a task set into two subsets and differently treating these two subsets during each iteration, the number of iterations required for analyzing the schedulability of the task set can be significantly reduced. The capability of the proposed algorithm was evaluated and compared to related works, which revealed up to a 55.5% saving in the runtime overhead for the Audsley's Algorithm when the system was under a heavy load. © 2006 Elsevier Inc. All rights reserved.

Author-supplied keywords

  • Fixed-priority preemptive scheduling
  • Periodic tasks
  • Real-time systems
  • Schedulability analysis

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Get full text


  • Wan Chen Lu

  • Jen Wei Hsieh

  • Wei Kuan Shih

  • Tei Wei Kuo

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free