You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

Probabilistic Application Interfaces for Hierarchical Scheduling

Fulltext:


Publication Type:

Conference/Workshop Paper

Venue:

IEEE Real-Time Systems Symposium Work-in-Progress (WiP) session


Abstract

The concept of hierarchical scheduling is widely used for scheduling complex real-time systems that are composed of a number of components. In the conventional hierarchical scheduling framework, targeting hard real-time systems, the size of processor capacities assigned to components is derived based on the worst case execution times of tasks. In this paper, we present our ongoing work on bringing the notation of probabilistic execution times in the context of hierarchical scheduling and deriving probabilistic component processor requirements. When dealing with soft real-time systems, this approach can eliminate the unaffordable pessimism that exists in worst-case timing analyses.

Bibtex

@inproceedings{Khalilzad3166,
author = {Nima Khalilzad and Meng Liu and Moris Behnam and Thomas Nolte},
title = {Probabilistic Application Interfaces for Hierarchical Scheduling},
month = {December},
year = {2013},
booktitle = {IEEE Real-Time Systems Symposium Work-in-Progress (WiP) session},
url = {http://www.es.mdh.se/publications/3166-}
}