PREEMPTIVE LCFS SCHEDULING IN HARD REAL-TIME APPLICATIONS

被引：3

作者：

BLIEBERGER, J ^{[1
]}

SCHMID, U ^{[1
]}

机构：

[1] VIENNA TECH UNIV,DEPT AUTOMAT 1831,A-1040 VIENNA,AUSTRIA

来源：

PERFORMANCE EVALUATION | 1992年 / 15卷 / 03期

关键词：

REAL-TIME BEHAVIOR; LCFS SCHEDULING; TREES; PROBABILITY GENERATING FUNCTIONS; SINGULARITY ANALYSIS; ASYMPTOTICS;

D O I：

10.1016/0166-5316(92)90035-F

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

We investigate the real-time behaviour of a (discrete time) single server system with preemptive LCFS task scheduling. The main result deals with the probability distribution of a random variable SRD(T), which describes the time the system operates without violating a fixed task service time deadline T. The tree approach, used for the derivation of our results, is also suitable for revisiting problems in queueing theory. Relying on a simple general probability model, asymptotic formulas concerning all moments of SRD(T) are determined; for instance, the expectation of SRD(T) is proved to grow exponentially in T, i.e., E[SRD(T)] is similar to Crho(T)T3/2 for some rho > 1.

引用

页码：203 / 215

页数：13

共 50 条

[1] SCHEDULING IN HARD REAL-TIME APPLICATIONS
ZHU, J
LEWIS, TG
JACKSON, W
WILSON, RL
[J]. IEEE SOFTWARE, 1995, 12 (03) : 54 - 63
[2] Preemptive transaction scheduling in hard real-time database systems
Lam, KW
Hung, SL
[J]. JOURNAL OF SYSTEMS ARCHITECTURE, 1997, 43 (09) : 625 - 637
[3] Genealogy of Hard Real-Time Preemptive Scheduling Algorithms for Identical Multiprocessors
Muller, Dirk
Werner, Matthias
[J]. OPEN COMPUTER SCIENCE, 2011, 1 (03): : 253 - 265
[4] Energy aware non-preemptive scheduling for hard real-time systems
Jejurikar, R
Gupta, R
[J]. 17TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS, PROCEEDINGS, 2005, : 21 - 30
[5] Scheduling non-preemptive hard real-time tasks with strict periods
Marouf, Mohamed
Sorel, Yves
[J]. 2011 IEEE 16TH CONFERENCE ON EMERGING TECHNOLOGIES AND FACTORY AUTOMATION (ETFA), 2011,
[6] Deterministic preemptive scheduling of real-time tasks
Jackson, LE
Rouskas, GN
[J]. COMPUTER, 2002, 35 (05) : 72 - +
[7] Non-preemptive fixed priority scheduling of hard real-time periodic tasks
Park, Moonju
[J]. COMPUTATIONAL SCIENCE - ICCS 2007, PT 4, PROCEEDINGS, 2007, 4490 : 881 - 888
[8] Robust non-preemptive hard real-time scheduling for clustered multicore platforms
Lombardi, Michele
Milano, Michela
Benini, Luca
[J]. DATE: 2009 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION, VOLS 1-3, 2009, : 803 - 808
[9] The DPK scheduling algorithm for CMP hard real-time applications
Wang, Man
Du, Zhihui
Liu, Zhiqiang
Hao, Song
[J]. DCABES 2007 PROCEEDINGS, VOLS I AND II, 2007, : 1183 - 1187
[10] SOME INVESTIGATIONS ON FCFS SCHEDULING IN HARD REAL-TIME APPLICATIONS
SCHMID, U
BLIEBERGER, J
[J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1992, 45 (03) : 493 - 512

← 1 2 3 4 5 →