On Nonpreemptive LCFS Scheduling with Deadlines

DOI10.1006/JAGM.1995.1004MaRDI QIDQ4327816zbMATH OpenOpenAlexFDO

Authors Ulrich Schmid, Johann Blieberger

Publication date 9 April 1995

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1995.1004

zbMATH Keywords

asymptotic separationLCFS task schedulingsingle server system

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Preemptive LCFS scheduling in hard real-time applications
• scientific article; zbMATH DE number 986997
• 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

(2)

• Preemptive LCFS scheduling in hard real-time applications
• Random trees in queueing systems with deadlines

This page was built for publication: On Nonpreemptive LCFS Scheduling with Deadlines

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