Premium
Recent sojourn time results for multilevel processor‐sharing scheduling disciplines
Author(s) -
Aalto Samuli,
Ayesta Urtzi
Publication year - 2008
Publication title -
statistica neerlandica
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.52
H-Index - 39
eISSN - 1467-9574
pISSN - 0039-0402
DOI - 10.1111/j.1467-9574.2008.00393.x
Subject(s) - computer science , unix , processor sharing , scheduling (production processes) , queue , the internet , distributed computing , computer network , operating system , mathematical optimization , software , mathematics
Multilevel Processor‐Sharing (MLPS) disciplines refer to a family of age‐based scheduling disciplines introduced decades ago. A time‐discretized version of an MLPS discipline is applied in the scheduler of the traditional UNIX operating system. In recent years, MLPS disciplines have been used to study the way that packet level scheduling mechanisms impact the performance perceived at the flow level in the Internet. Inspired by this latter application, many new sojourn time results have been discovered for these disciplines in the context of the M/G/1 queue. The aim of this paper was to give a consistent overview of these new results. In addition, it points out some intriguing open problems for further research.