Smart SMART Bounds for Weighted Response Time Scheduling
From MaRDI portal
Publication:4210145
DOI10.1137/S0097539795286831zbMath0914.68094MaRDI QIDQ4210145
Philip S. Yu, Walter Ludwig, John J. Turek, Joel L. Wolf, Uwe Schwiegelshohn
Publication date: 21 September 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15)
Related Items (8)
Resource constrained scheduling on multiple machines ⋮ Improved upper bounds for online malleable job scheduling ⋮ Improved results for scheduling batched parallel jobs by using a generalized analysis framework ⋮ Frameworks for adaptable scheduling algorithms ⋮ Scheduling in the dark ⋮ Malleable scheduling for flows of jobs and applications to MapReduce ⋮ Fairness in parallel job scheduling ⋮ Minimizing total completion time in multiprocessor job systems with energy constraint
This page was built for publication: Smart SMART Bounds for Weighted Response Time Scheduling