Exact admission-control for integrated aperiodic and periodic tasks

Authors:
Björn Andersson;Cecilia Ekelin
Affiliations:
Department of Computer Engineering, Chalmers University of Technology, SE-412 96 Göteborg, Sweden;Department of Computer Engineering, Chalmers University of Technology, SE-412 96 Göteborg, Sweden
Venue:
Journal of Computer and System Sciences
Year:
2007

Citing 14
Cited 0

Some Results of the Earliest Deadline Scheduling Algorithm

IEEE Transactions on Software Engineering
Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
On-line scheduling in the presence of overload

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Algorithms + Data Structures = Programs

Algorithms + Data Structures = Programs
Efficient Scheduling of Real-Time Multi-Task Applications in Dynamic Systems

RTAS '00 Proceedings of the Sixth IEEE Real Time Technology and Applications Symposium (RTAS 2000)
The Aperiodic Multiprocessor Utilization Bound for Liquid Tasks

RTAS '02 Proceedings of the Eighth IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'02)
Joint scheduling of distributed complex periodic and hard aperiodic tasks in statically scheduled systems

RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Integrating Multimedia Applications in Hard Real-Time Systems

RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Analysis of a Reservation-Based Feedback Scheduler

RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
Partitioned Aperiodic Scheduling on Multiprocessors

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Schedulability Analysis and Utilization Bounds for Highly Scalable Real-Time Services

RTAS '01 Proceedings of the Seventh Real-Time Technology and Applications Symposium (RTAS '01)
Static-Priority Scheduling on Multiprocessors

RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
A Utilization Bound for Aperiodic Tasks and Priority Driven Scheduling

IEEE Transactions on Computers

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.