Scheduling heterogeneous processors isn't as easy as you think

zbMATH Open1421.68248MaRDI QIDQ5743473FDOQ5743473

Authors Anupam Gupta, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Kirk Pruhs

Publication date 10 May 2019

Full work available at URL https://dl.acm.org/citation.cfm?id=2095214

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Scheduling on power-heterogeneous processors
• Scheduling on power-heterogeneous processors
• Online algorithms for non-preemptive speed scaling on power-heterogeneous processors
• Energy-efficient multiprocessor scheduling for flow time and makespan
• Scheduling for Speed Bounded Processors

Cites work

• A competitive algorithm for minimizing weighted flow time on unrelated machines with speed augmentation
• Better Scalable Algorithms for Broadcast Scheduling
• Non-clairvoyant Speed Scaling for Weighted Flow Time
• Nonclairvoyant scheduling
• Nonclairvoyant speed scaling for flow and energy
• Online scheduling on identical machines using SRPT
• Online scheduling with general cost functions
• Online weighted flow time and deadline scheduling
• Optimal time-critical scheduling via resource augmentation
• SRPT optimally utilizes faster machines to minimize flow time
• Scalably Scheduling Power-Heterogeneous Processors
• Scalably scheduling processes with arbitrary speedup curves
• Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service
• Speed is as powerful as clairvoyance
• Speed scaling for weighted flow time
• Speed scaling with an arbitrary power function

Cited in

(13)

• Scheduling on power-heterogeneous processors
• Scheduling on power-heterogeneous processors
• Energy efficient scheduling of parallelizable jobs
• Online scheduling with general cost functions
• Machine speed scaling by adapting methods for convex optimization with submodular constraints
• The dynamic priority based scheduling algorithm for hard real-time heterogeneous CMP application
• Energy-efficient scheduling and routing via randomized rounding
• Greed works -- online algorithms for unrelated machine stochastic scheduling
• Approximation algorithms for energy-efficient scheduling of parallel jobs
• Online algorithms for non-preemptive speed scaling on power-heterogeneous processors
• Online dispatching and parallel processing algorithms for saving money in systems with heterogeneous, single-buffered, speed-scalable processors
• Speed scaling on parallel processors
• On speed scaling via integer programming

This page was built for publication: Scheduling heterogeneous processors isn't as easy as you think

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5743473)