Smooth scheduling under variable rates or the analog-digital confinement game

DOI10.1007/S00224-008-9134-XMaRDI QIDQ733734zbMATH OpenOpenAlexFDO

Authors Ami Litman, Shiri Moran-Schein

Publication date 19 October 2009

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-008-9134-x

zbMATH Keywords

concurrent gamesonline schedulingconfinement gamesEDF schemesEDF strategiesnon/concurrent gamessmooth schedulingtwo players gamesvariable rates

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) 2-person games (91A05) Stochastic scheduling theory in operations research (90B36)

Recommendations

• On centralized smooth scheduling
• Fair on-line scheduling of a dynamic set of tasks on a single resource
• General perfectly periodic scheduling
• Resource scheduling with variable requirements over time
• Quantitatively fair scheduling

Cites work

• Fair on-line scheduling of a dynamic set of tasks on a single resource
• General dynamic routing with per-packet delay guarantees of O(Distance + 1/Session rate)
• Nearly optimal perfectly-periodic schedules
• On smooth sets of integers
• Proportionate progress: A notion of fairness in resource allocation
• Size direction games over the real line. II
• The Chairman assignment problem

Cited in

(3)

• On centralized smooth scheduling
• The variable-processor cup game
• The matroid cup game

This page was built for publication: Smooth scheduling under variable rates or the analog-digital confinement game

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q733734)