Throughput Maximization in Multiprocessor Speed-Scaling

DOI10.1007/978-3-319-13075-0_20zbMath1433.68063arXiv1402.3782OpenAlexW2356268455MaRDI QIDQ2942633

Nguyen Kim Thang, Vincent Chau, Evripidis Bampis, Eric Angel

Publication date: 11 September 2015

Published in: Algorithms and Computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Cites Work

• Non-preemptive speed scaling
• Speed scaling on parallel processors
• Approximation algorithms for variable voltage processors: min energy, max throughput and online heuristics
• A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
• On multi-processor speed scaling with migration
• The bell is ringing in speed-scaled multiprocessor scheduling
• How to Pack Your Items When You Have to Buy Your Knapsack
• New Results for Non-Preemptive Speed Scaling
• Tradeoff between Energy and Throughput for Online Deadline Scheduling
• Energy-Efficient Algorithms for Non-preemptive Speed-Scaling
• Scheduling for Speed Bounded Processors
• Speed Scaling on Parallel Processors with Migration
• Green Scheduling, Flows and Matchings
• Throughput Maximization for Speed-Scaling with Agreeable Deadlines
• From Preemptive to Non-preemptive Speed-Scaling Scheduling
• Online matching with concave returns
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Throughput Maximization in Multiprocessor Speed-Scaling