A semi-preemptive priority scheduling discipline: performance analysis

DOI10.1016/J.EJOR.2012.08.008MaRDI QIDQ2253433zbMATH OpenOpenAlexFDO

Authors Joris Walraevens, Tom Maertens, Herwig Bruneel

Publication date 27 July 2014

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2012.08.008

zbMATH Keywords

cost functionperformance analysispriority scheduling(non-)preemptive

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Discretionary priority discipline: A reasonable compromise between preemptive and nonpreemptive disciplines
• Analysis of a discrete-time preemptive resume priority buffer
• Performance analysis of a \(GI-Geo-1\) buffer with a preemptive resume priority scheduling discipline
• scientific article; zbMATH DE number 967316
• Analysis of preemptive loss priority queues with preemption distance

Cited in

(6)

• Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation
• Analysis of a two-class single-server discrete-time FCFS queue: the effect of interclass correlation
• Delay analysis of a discrete-timeGI−GI− 1 queue with reservation-based priority scheduling
• Discretionary priority discipline: A reasonable compromise between preemptive and nonpreemptive disciplines
• On the optimization of two-class work-conserving parameterized scheduling policies
• Performance Analysis of Dynamic Priority Shifting

This page was built for publication: A semi-preemptive priority scheduling discipline: performance analysis

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