An $$O(n^2)$$ Algorithm for Computing Optimal Continuous Voltage Schedules

DOI10.1007/978-3-319-55911-7_28zbMath1485.68113arXiv1408.5995OpenAlexW1827775541MaRDI QIDQ2988837

Minming Li, Hao Yuan, Frances F. Yao

Publication date: 19 May 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.5995

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (6)

Approximate schedules for non-migratory parallel jobs in speed-scaled multiprocessor systems ⋮ Approximation algorithms for energy-efficient scheduling of parallel jobs ⋮ Continuous speed scaling with variability: a simple and direct approach ⋮ Minimizing energy on homogeneous processors with shared memory ⋮ A pseudo-linear time algorithm for the optimal discrete speed minimizing energy consumption ⋮ Models and algorithms for energy-efficient scheduling with immediate start of jobs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Min-energy scheduling for aligned jobs in accelerate model
• Min-energy voltage allocation for tree-structured tasks
• Scheduling for Speed Bounded Processors
• Speed scaling to manage energy and temperature
• How to Schedule When You Have to Buy Your Energy
• Efficiency of a Good But Not Linear Set Union Algorithm
• Algorithm Theory - SWAT 2004
• Energy Efficient Deadline Scheduling in Two Processor Systems
• Online Deadline Scheduling with Bounded Energy Efficiency
• Average Rate Speed Scaling
• An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules
• Race to idle

This page was built for publication: An $$O(n^2)$$ Algorithm for Computing Optimal Continuous Voltage Schedules