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