Abstract
The study of preemptive scheduling is essential to computer systems [15, 12, 3, 4]. Motivated by this, decades of queueing theory research have been done on the subject [19, 18, 16, 13, 21, 8, 17, 2, 11, 20, 10, 1]. However, almost all queuing theoretic literature on preemptive scheduling concerns systems without switching overhead - pausing or resuming a job is assumed to be instant. Practically speaking, switching in computer systems incurs some overhead [14], which causes a divide between models in research and the real world.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
