Non-clairvoyant scheduling for minimizing mean slowdown
From MaRDI portal
Publication:1884774
DOI10.1007/s00453-004-1115-0zbMath1082.68010OpenAlexW2123219527MaRDI QIDQ1884774
Nikhil Bansal, Jochen Könemann, Amitabh Sinha, Kedar Dhamdhere
Publication date: 5 November 2004
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-004-1115-0
Analysis of algorithms (68W40) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (5)
Minimizing the mean slowdown in a single-server queue ⋮ Minimizing the mean slowdown in the M/G/1 queue ⋮ Optimizing the stretch of independent tasks on a cluster: from sequential tasks to moldable tasks ⋮ Improved results for scheduling batched parallel jobs by using a generalized analysis framework ⋮ Multi-core real-time scheduling for generalized parallel task models
This page was built for publication: Non-clairvoyant scheduling for minimizing mean slowdown
