Minimizing flow time nonclairvoyantly
From MaRDI portal
Publication:3452502
DOI10.1145/792538.792545zbMath1325.90042OpenAlexW2124718325MaRDI QIDQ3452502
Bala Kalyanasundaram, Kirk R. Pruhs
Publication date: 12 November 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/792538.792545
schedulingrandomized algorithmflow timeresource augmentationmultilevel feedbackshortest elapsed time first
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Randomized algorithms (68W20)
Related Items (10)
Semi-clairvoyant scheduling ⋮ Online weighted flow time and deadline scheduling ⋮ Approximating total flow time on parallel machines ⋮ An Optimal Strategy for Online Non-uniform Length Order Scheduling ⋮ Nonclairvoyant speed scaling for flow and energy ⋮ Improved results for scheduling batched parallel jobs by using a generalized analysis framework ⋮ Speed scaling of processes with arbitrary speedup curves on a multiprocessor ⋮ Utilization of nonclairvoyant online schedules ⋮ Scheduling in the dark ⋮ Achievable Performance of Blind Policies in Heavy Traffic
This page was built for publication: Minimizing flow time nonclairvoyantly
