An efficient on-line job admission control scheme to guarantee deadlines for QoS-demanding applications

Authors:
Jungkeun Park;Minsoo Ryu;Seongsoo Hong
Affiliations:
Computing Lab., Samsung Advanced Institute of Technology, Korea;College of Information and Communications, Hanyang University, Korea;School of Electrical Engineering and Computer Science, Seoul National University, Korea
Venue:
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
Year:
2005

Citing 8
Cited 0

Some Results of the Earliest Deadline Scheduling Algorithm

IEEE Transactions on Software Engineering
Virtual clock: a new traffic control algorithm for packet switching networks

SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
The Deferrable Server Algorithm for Enhanced Aperiodic Responsiveness in Hard Real-Time Environments

IEEE Transactions on Computers
An Optimal Algorithm for Scheduling Soft Aperiodic Tasks in Dynamic-Priority Preemptive Systems

IEEE Transactions on Software Engineering
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Optimal Deadline Assignment for Scheduling Soft Aperiodic Tasks in Hard Real-Time Environments

IEEE Transactions on Computers
A Utilization Bound for Aperiodic Tasks and Priority Driven Scheduling

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a novel admission control scheme for a mixed set of periodic and aperiodic tasks with hard deadlines under EDF, which can achieve near optimal performance with practical utility. The proposed admission control scheme is based on a novel schedulability measure for a deadline-constrained task, called utilization demand, which can be viewed as a combination of the processor time demand and the utilization factor. We first show that this new schedulability measure provides a necessary and sufficient schedulability condition for aperiodic tasks. We then present an efficient schedulability test for a mixed set of periodic and aperiodic tasks under EDF. The resulting schedulability test can be implemented as an on-line admission control algorithm of O(n) complexity, which in practice incurs sufficiently low overhead. Our experimental results show that the proposed admission control scheme outperforms existing approaches with respect to achievable processor utilization.