On the Evaluation of Schedulability Tests for Real-Time Scheduling Algorithms

Research output: Contribution to conferencePaper


This short paper discusses the criteria and methods that can be used to evaluate the performance of schedulability tests for real-time scheduling algorithms. We summarize the different theoretical and empirical methods that can be used and outline their advantages and disadvantages. The main focus of the paper is on empirical techniques. Here we set out some of the potential pitfalls, and describe a defacto standard approach based on visualizing results using success ratio and weighted schedulability plots. We discuss how these can be augmented using other graphs such as difference plots and frequency distributions for breakdown utilization. For more complex task models, we note that a consistent set of parameters can be obtained from benchmarks, and we show how a moderate number of benchmarks can be used to produce a large number of related task sets with a variety of utilization levels suitable for use in empirical evaluation. Finally, we remark on the dearth of real-time benchmarks, and call for more
benchmarks or benchmark generators to be developed in conjunction with industry. This paper accompanies an invited talk given at the WATERS workshop in 2016.
Original languageEnglish
Number of pages9
Publication statusPublished - Jul 2016
EventInternational Workshop on Analysis Tools and Methodologies for Embedded and Real-time Systems (WATERS) - Toulouse, France
Duration: 5 Jul 2016 → …


ConferenceInternational Workshop on Analysis Tools and Methodologies for Embedded and Real-time Systems (WATERS)
Period5/07/16 → …


  • real-time
  • scheduling
  • schedulability tests
  • evaluation

Cite this