Publication:5743473
From MaRDI portal
zbMath1421.68248MaRDI QIDQ5743473
Benjamin Moseley, Anupam Gupta, Ravishankar Krishnaswamy, Sungjin Im, Kirk R. Pruhs
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095214
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)
Related Items
Energy-efficient scheduling and routing via randomized rounding, Scheduling on power-heterogeneous processors, Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling, Approximation algorithms for energy-efficient scheduling of parallel jobs, Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints, Speed scaling on parallel processors, Energy efficient scheduling of parallelizable jobs, On speed scaling via integer programming, Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems, Unnamed Item
Cites Work
- Unnamed Item
- Online weighted flow time and deadline scheduling
- Nonclairvoyant scheduling
- Speed Scaling with an Arbitrary Power Function
- Scalably scheduling processes with arbitrary speedup curves
- Speed Scaling for Weighted Flow Time
- Non-clairvoyant Speed Scaling for Weighted Flow Time
- Scalably Scheduling Power-Heterogeneous Processors
- Better Scalable Algorithms for Broadcast Scheduling
- Speed is as powerful as clairvoyance
- SRPT optimally utilizes faster machines to minimize flow time
- A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation
- Nonclairvoyant Speed Scaling for Flow and Energy
- Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service
- Online Scheduling with General Cost Functions
- Optimal time-critical scheduling via resource augmentation
