Scalably scheduling processes with arbitrary speedup curves
From MaRDI portal
Publication:3189069
DOI10.1145/2229163.2229172zbMath1295.68048OpenAlexW2124402683MaRDI QIDQ3189069
Publication date: 9 September 2014
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2010/2546/
Nonnumerical algorithms (68W05) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (14)
Energy-efficient multiprocessor scheduling for flow time and makespan ⋮ Nonclairvoyant speed scaling for flow and energy ⋮ Competitive online adaptive scheduling for sets of parallel jobs with fairness and efficiency ⋮ Fair Scheduling via Iterative Quasi-Uniform Sampling ⋮ Scheduling parallel jobs online with convex and concave parallelizability ⋮ Speed scaling of processes with arbitrary speedup curves on a multiprocessor ⋮ Scheduling to minimize energy and flow time in broadcast scheduling ⋮ Non-Clairvoyant Precedence Constrained Scheduling. ⋮ Set function optimization ⋮ Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems ⋮ Non-clairvoyantly scheduling to minimize convex functions ⋮ Online scheduling of parallelizable jobs in the directed acyclic graphs and speed-up curves models ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication: Scalably scheduling processes with arbitrary speedup curves
