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

Efficient Response-Time Analysis for Tasks with Offsets

Fulltext:


Authors:

Jukka Mäki-Turja, Mikael Sjödin

Publication Type:

Conference/Workshop Paper

Venue:

10th IEEE Real-Time Technology and Applications Symposium (RTAS04)

Publisher:

IEEE Computer Society Press

Abstract

We present a method that enables an efficient implementation of the approximative response-time analysis (RTA) for tasks with offsets presented by Tindell and Palencia Gutierrez et. al. The method allows for significantly faster implementations of schedulability tools using RTA. Furthermore, reducing computation time, from tens of milliseconds to just a fraction of a millisecond, as we will show, is a step towards on-line RTA in for example admission control systems.We formally prove that our reformulation of earlier presented equations is correct and allow us to statically represent parts of the equation, reducing the calculations during fix-point iteration. We show by simulations that the speed-up when using our method is substantial. When task sets grow beyond a trivial number of tasks and/or transactions a speed-up of more than 100 times (10 transactions and 10 tasks/transaction) compared to the original analysis can be obtained.

Bibtex

@inproceedings{Maki-Turja614,
author = {Jukka M{\"a}ki-Turja and Mikael Sj{\"o}din},
title = {Efficient Response-Time Analysis for Tasks with Offsets},
month = {May},
year = {2004},
booktitle = {10th IEEE Real-Time Technology and Applications Symposium (RTAS04)},
publisher = {IEEE Computer Society Press},
url = {http://www.es.mdu.se/publications/614-}
}