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

An Adaptive Server-Based Scheduling Framework with Capacity Reclaiming and Borrowing

Fulltext:


Authors:

Meng Liu, Moris Behnam, Shinpei Kato , Thomas Nolte

Research group:

Complex Real-Time Embedded Systems

Publication Type:

Conference/Workshop Paper

Venue:

The 20th IEEE International Conference on embedded and Real-Time Computing Systems and Applications

Abstract

In this paper, we present a new reservation based scheduling framework for soft real-time systems using EDF algorithm (called CARB-EDF). This framework has the features of Capacity Adaptation, Reclaiming and Borrowing. This framework can simplify the initial configuration of the system, where the system designer does not need to provide any estimations of task execution times. We also present a Chebyshev’s inequality based predictor to estimate task execution times. A number of simulation-based experiments have been implemented. According to the results compared with some related works, our scheduling framework can provide a better performance with acceptable extra scheduling overhead.

Bibtex

@inproceedings{Liu3753,
author = {Meng Liu and Moris Behnam and Shinpei Kato and Thomas Nolte},
title = {An Adaptive Server-Based Scheduling Framework with Capacity Reclaiming and Borrowing},
month = {August},
year = {2014},
booktitle = {The 20th IEEE International Conference on embedded and Real-Time Computing Systems and Applications},
url = {http://www.es.mdu.se/publications/3753-}
}