Scheduling heterogeneous processors isn't as easy as you think

MaRDI QIDQ5743473zbMATH OpenFDO

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

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

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
• 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
• SRPT optimally utilizes faster machines to minimize flow time

Cited in

(14)

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

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)