Browse by author
Lookup NU author(s): Emeritus Professor Isi Mitrani
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
Round robin (RR) is a widely adopted scheduling policy in modern computer systems. The scheduler handles the concurrency by alternating the run processes in such a way that they can use the processor continuously for at most a quantum of time. When the processor is assigned to another process, a context switch occurs. Although modern architectures handle context switches quite efficiently, the processes may incur in some indirect costs mainly due to cache overwriting.RR is widely appreciated both in case of interactive and CPU intensive processes. In the latter case, with respect to the First-Come-First-Served approach (FCFS), RR does not penalise the small jobs.In this paper, we study a scheduling policy, namely PS-FCFS, that fixes a maximum level of parallelism N and leaves the remaining jobs in a FCFS queue. The idea is that of exploiting the advantages of RR without incurring in heavy slowdowns because of context switches.We propose a queueing model for PS-FCFS allowing us to: (i) find the optimal level of multiprogramming and (ii) study important properties of this policy such as the mean performance measures and results about its sensitivity to the moments of the jobs' service demands.
Author(s): Balsamo S, Marin A, Mitrani I
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: ICPE '22: Proceedings of the 2022 ACM/SPEC on International Conference on Performance Engineering
Year of Conference: 2022
Pages: 199-210
Online publication date: 09/04/2022
Acceptance date: 02/04/2018
Publisher: ACM
URL: https://doi.org/10.1145/3489525.3511678
Library holdings: Search Newcastle University Library for this item
ISBN: 9781450391436
