Throughput maximization in multiprocessor speed-scaling

DOI10.1016/J.TCS.2016.03.020zbMath1339.68029OpenAlexW1615011765MaRDI QIDQ278716

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

Publication date: 2 May 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.03.020

zbMATH Keywords

schedulingapproximationenergy efficiencythroughput maximization

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Models and algorithms for energy-efficient scheduling with immediate start of jobs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-preemptive speed scaling
• 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
• 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
• 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

This page was built for publication: Throughput maximization in multiprocessor speed-scaling