CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Exact admission-control for integrated aperiodic and periodic tasks

Björn Andersson (Institutionen för data- och informationsteknik (Chalmers)) ; Cecilia Ekelin (Institutionen för data- och informationsteknik (Chalmers))
Journal of Computer and System Sciences (0022-0000). Vol. 73 (2007), 2, p. 225-241.
[Artikel, refereegranskad vetenskaplig]

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.

Nyckelord: real-time systems, schedulability analysis, operating systems, online, scheduling, earliest-deadline-first, AVL tree, lazy evaluation

Denna post skapades 2008-11-18.
CPL Pubid: 78250


Läs direkt!

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för data- och informationsteknik (Chalmers)


Information Technology

Chalmers infrastruktur