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

Jungkeun Park, Minsoo Ryu, Seongsoo Hong

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish
Title of host publicationComputer and Information Sciences - ISCIS 2005 - 20th International Symposium, Proceedings
Pages54-63
Number of pages10
StatePublished - 2005 Dec 1
Event20th International Symposium on Computer and Information Sciences, ISCIS 2005 - Istanbul, Turkey
Duration: 2005 Oct 262005 Oct 28

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3733 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other20th International Symposium on Computer and Information Sciences, ISCIS 2005
CountryTurkey
CityIstanbul
Period05/10/2605/10/28

Fingerprint Dive into the research topics of 'An efficient on-line job admission control scheme to guarantee deadlines for QoS-demanding applications'. Together they form a unique fingerprint.

  • Cite this

    Park, J., Ryu, M., & Hong, S. (2005). An efficient on-line job admission control scheme to guarantee deadlines for QoS-demanding applications. In Computer and Information Sciences - ISCIS 2005 - 20th International Symposium, Proceedings (pp. 54-63). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3733 LNCS).