A priority queue with interruptions of service permitted after a time quantum
From MaRDI portal
Queueing theory is applied to analyse a model of a multi-programming operating system in which preemptive priorities are used for scheduling the service of concurrent streams of requests. Preemptions are permitted at the end of each service quantum. Mean waiting times and the Laplace transforms of waiting times in the M/G/1 system analyzed are computed. The mean waiting times have been compared for the preemptive, non- preemptive and the studied disciplines in a queueing system described by way of example.
Recommendations
Cited in
(5)- scientific article; zbMATH DE number 4145639 (Why is no real title available?)
- scientific article; zbMATH DE number 4033053 (Why is no real title available?)
- Simulation of computer systems with FIFO-discipline interrupt handling
- An execution/sleep scheduling policy for serving an additional job in priority queueing systems
- Priority Queues with Setup Times
This page was built for publication: A priority queue with interruptions of service permitted after a time quantum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q760337)