Preemptive LCFS scheduling in hard real-time applications

DOI10.1016/0166-5316(92)90035-FzbMath0761.90044MaRDI QIDQ4030468

Johann Blieberger, Ulrich Schmid

Publication date: 1 April 1993

Published in: Performance Evaluation (Search for Journal in Brave)

zbMATH Keywords

asymptoticsprobability generating functionssingularity analysisreal-time behaviourdiscrete time single server systemlast come first servepreemptive LCFS task scheduling

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Related Items (3)

Random trees in queueing systems with deadlines ⋮ FCFS-scheduling in a hard real-time environment under rush-hour conditions ⋮ Some investigations on FCFS scheduling in hard real time applications

This page was built for publication: Preemptive LCFS scheduling in hard real-time applications