Approximate schedules for non-migratory parallel jobs in speed-scaled multiprocessor systems
From MaRDI portal
Publication:2633602
DOI10.33048/semi.2019.16.016zbMath1414.90156arXiv1811.11595OpenAlexW3015240845MaRDI QIDQ2633602
Alexander Kononov, Julia Viktorovna Kovalenko
Publication date: 9 May 2019
Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.11595
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Unnamed Item
- A survey of offline algorithms for energy minimization under deadline constraints
- Non-preemptive speed scaling
- Speed scaling on parallel processors
- From preemptive to non-preemptive speed-scaling scheduling
- Scheduling parallel jobs to minimize the makespan
- Scheduling for parallel processing
- On an on-line scheduling problem for parallel jobs
- Energy-efficient scheduling and routing via randomized rounding
- On multi-processor speed scaling with migration
- The bell is ringing in speed-scaled multiprocessor scheduling
- An $$O(n^2)$$ Algorithm for Computing Optimal Continuous Voltage Schedules
- On Speed Scaling Scheduling of Parallel Jobs with Preemption
- Energy-Efficient Algorithms for Non-preemptive Speed-Scaling
- Speed Scaling on Parallel Processors with Migration
This page was built for publication: Approximate schedules for non-migratory parallel jobs in speed-scaled multiprocessor systems