Preemptive LCFS scheduling in hard real-time applications

DOI10.1016/0166-5316(92)90035-FMaRDI QIDQ4030468zbMATH OpenFDO

Authors Johann Blieberger, Ulrich Schmid

Publication date 1 April 1993

Published in Performance Evaluation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-5316(92)90035-F

zbMATH Keywords

asymptoticsdiscrete time single server systemlast come first servepreemptive LCFS task schedulingprobability generating functionsreal-time behavioursingularity analysis

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Recommendations

• On Nonpreemptive LCFS Scheduling with Deadlines
• Random trees in queueing systems with deadlines
• Some investigations on FCFS scheduling in hard real time applications
• Extremal scheduling of parallel processing with and without real-time constraints
• FCFS-scheduling in a hard real-time environment under rush-hour conditions

Cited in

(5)

• FCFS-scheduling in a hard real-time environment under rush-hour conditions
• Some investigations on FCFS scheduling in hard real time applications
• scientific article; zbMATH DE number 986997 (Why is no real title available?)
• On Nonpreemptive LCFS Scheduling with Deadlines
• Random trees in queueing systems with deadlines

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4030468)