Exact admission-control for integrated aperiodic and periodic tasks
Artikel i vetenskaplig tidskrift, 2007

Admission-controllers are used to prevent overload in systems with dynamically arriving tasks. Typically, these admission-controllers are based on sufficient (but not necessary) capacity bounds in order to maintain a low computational complexity. In this paper we present how exact admission-control for aperiodic tasks can be efficiently obtained. Our first result is an admission-controller for purely aperiodic task sets where the test has the same runtime complexity as utilization-based tests. Our second result is an extension of the previous controller for a baseload of periodic tasks. The runtime complexity of this test is lower than for any known exact admission-controller. In addition to presenting our main algorithm and evaluating its performance, we also discuss some general issues concerning admission-controllers and their implementation. (C) 2006 Elsevier Inc. All rights reserved.

online

AVL tree

schedulability analysis

scheduling

lazy evaluation

real-time systems

operating systems

earliest-deadline-first

Författare

Björn Andersson

Chalmers, Data- och informationsteknik

Cecilia Ekelin

Chalmers, Data- och informationsteknik

Journal of Computer and System Sciences

0022-0000 (ISSN) 1090-2724 (eISSN)

Vol. 73 225-241

Ämneskategorier

Data- och informationsvetenskap

DOI

10.1016/j.jcss.2006.04.001