Proportional-share scheduling in single-server and multiple-server computing systems

D.H.J. Epema; J.F.C.M. Jongh, de

doi:10.1145/340242.340295

Proportional-share scheduling in single-server and multiple-server computing systems

D.H.J. Epema, J.F.C.M. Jongh, de

Research output: Contribution to journal › Article › Academic › peer-review

Abstract

Proportional Share Scheduling (PSS), which is the allocation of prespecified fractions of a certain resource to different classes of customers, has been studied both in the context of the allocation of network bandwidth and of processors. Much of this work has focused on systems with a single scheduler and when all classes of customers are constantly backlogged. We study the objectives and performance of PSS policies for processor scheduling when these conditions do not hold.

Original language	English
Pages (from-to)	7-10
Journal	Performance Evaluation Review
Volume	27
Issue number	3
DOIs	https://doi.org/10.1145/340242.340295
Publication status	Published - 1999

Access to Document

10.1145/340242.340295

Cite this

@article{0060dedb41774eb7a8587b6e0f6be281,

title = "Proportional-share scheduling in single-server and multiple-server computing systems",

abstract = "Proportional Share Scheduling (PSS), which is the allocation of prespecified fractions of a certain resource to different classes of customers, has been studied both in the context of the allocation of network bandwidth and of processors. Much of this work has focused on systems with a single scheduler and when all classes of customers are constantly backlogged. We study the objectives and performance of PSS policies for processor scheduling when these conditions do not hold.",

author = "D.H.J. Epema and {Jongh, de}, J.F.C.M.",

year = "1999",

doi = "10.1145/340242.340295",

language = "English",

volume = "27",

pages = "7--10",

journal = "Performance Evaluation Review",

issn = "0163-5999",

publisher = "Association for Computing Machinery, Inc",

number = "3",

}

TY - JOUR

T1 - Proportional-share scheduling in single-server and multiple-server computing systems

AU - Epema, D.H.J.

AU - Jongh, de, J.F.C.M.

PY - 1999

Y1 - 1999

N2 - Proportional Share Scheduling (PSS), which is the allocation of prespecified fractions of a certain resource to different classes of customers, has been studied both in the context of the allocation of network bandwidth and of processors. Much of this work has focused on systems with a single scheduler and when all classes of customers are constantly backlogged. We study the objectives and performance of PSS policies for processor scheduling when these conditions do not hold.

AB - Proportional Share Scheduling (PSS), which is the allocation of prespecified fractions of a certain resource to different classes of customers, has been studied both in the context of the allocation of network bandwidth and of processors. Much of this work has focused on systems with a single scheduler and when all classes of customers are constantly backlogged. We study the objectives and performance of PSS policies for processor scheduling when these conditions do not hold.

U2 - 10.1145/340242.340295

DO - 10.1145/340242.340295

M3 - Article

SN - 0163-5999

VL - 27

SP - 7

EP - 10

JO - Performance Evaluation Review

JF - Performance Evaluation Review

IS - 3

ER -

Proportional-share scheduling in single-server and multiple-server computing systems

Abstract

Access to Document

Fingerprint

Cite this