Starvation-proof priority round-robin queues for time-sharing systems

James W. McGuffee, R. Andrew Cabezas · Journal of computing sciences in colleges · 2006

The concept of a starvation-proof modification to priority robin-robin queues for time-sharing systems is presented. The use of this modification in computer science education and undergraduate computer science research is explored.

Read the paper · More papers on PaperTik