Storage requirements for fair scheduling

DOI10.1016/0020-0190(83)90107-2zbMath0519.68054OpenAlexW1994227664MaRDI QIDQ1054474

Michael J. Fischer, Michael S. Paterson

Publication date: 1983

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(83)90107-2

zbMATH Keywords

parallel computationanalysis of algorithmsfair schedulingstorage requirementsstorage bounds

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Proof rules and transformations dealing with fairness
• Unnamed Item

This page was built for publication: Storage requirements for fair scheduling