Energy-efficient multiprocessor scheduling for flow time and makespan
From MaRDI portal
Publication:401300
DOI10.1016/j.tcs.2014.07.007zbMath1360.68288arXiv1010.4110OpenAlexW1503605537MaRDI QIDQ401300
Publication date: 26 August 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1010.4110
competitive analysismakespanmultiprocessorstotal flow timeonline schedulingdynamic speed scalingenergy-performance tradeoff
Analysis of algorithms (68W40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simultaneous job scheduling and resource allocation on parallel machines
- Nonclairvoyant speed scaling for flow and energy
- Speed scaling of processes with arbitrary speedup curves on a multiprocessor
- Online scheduling of parallel programs on heterogeneous systems with applications to Cilk
- Semi-clairvoyant scheduling
- Online speed scaling based on active job count to minimize flow plus energy
- Non-clairvoyant multiprocessor scheduling of jobs with changing execution characteristics
- Speed Scaling with an Arbitrary Power Function
- Energy-Efficient Due Date Scheduling
- Speed Scaling for Energy and Performance with Instantaneous Parallelism
- Using parallel program characteristics in dynamic processor allocation policies
- Scheduling multithreaded computations by work stealing
- Scalably scheduling processes with arbitrary speedup curves
- Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough
- Speed Scaling for Weighted Flow Time
- Non-clairvoyant Speed Scaling for Weighted Flow Time
- How to Schedule When You Have to Buy Your Energy
- An Analysis of Preemptive Multiprocessor Job Scheduling
- Speed is as powerful as clairvoyance
- Preemptive Scheduling of Parallel Jobs on Multiprocessors
- Energy-efficient algorithms for flow time minimization
- Energy Efficient Scheduling of Parallelizable Jobs
- Scheduling in the dark
This page was built for publication: Energy-efficient multiprocessor scheduling for flow time and makespan
