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

Speeding Up the Response-Time Analysis of Tasks with Offsets

Fulltext:


Authors:

Jukka Mäki-Turja, Mikael Sjödin

Publication Type:

Report - MRTC

ISRN:

MDH-MRTC-154/2004-1-SE

Abstract

We present a method that enables an efficient implementation of the approximative response-time analysis for tasks with offsets presented by Tindell and Palencia Gutierrez et al.The method allows for significantly faster implementations of schedulability tools. To have fast calculations of response-times is paramount in optimising tools that perform automatic configuration of systems, e.g., allocating tasks to CPUs in distributed systems, or assigning priorities to tasks on one CPU. In such tools response-times are calculated repeatedly to evaluate different configurations during optimisation. Besides the increased usability in off-line tools, reducing computation time, from tens of seconds to just a few milliseconds, 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 (lessening the need for calculations during response-time analysis). 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

@techreport{Maki-Turja550,
author = {Jukka M{\"a}ki-Turja and Mikael Sj{\"o}din},
title = {Speeding Up the Response-Time Analysis of Tasks with Offsets},
number = {ISSN 1404-3041 ISRN MDH-MRTC-154/2004-1-SE},
month = {February},
year = {2004},
url = {http://www.es.mdu.se/publications/550-}
}