On multiprocessor temperature-aware scheduling problems

DOI10.1007/s10951-013-0319-zzbMath1297.68037OpenAlexW2129369051MaRDI QIDQ398885

Ioannis Milis, Giorgio Lucarelli, Evripidis Bampis, Evangelos Markakis, Dimitrios Letsios

Publication date: 18 August 2014

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://basepub.dauphine.fr/handle/123456789/6309

zbMATH Keywords

approximation algorithmsinapproximabilityidentical processorstemperature-aware scheduling

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (1)

Temperature aware online algorithms for minimizing flow time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation schemes for scheduling on parallel machines
• Speed Scaling to Manage Temperature
• Online Algorithms for Maximizing Weighted Throughput of Unit Jobs with Temperature Constraints
• Temperature Aware Online Algorithms for Scheduling Equal Length Jobs
• Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems
• Speed scaling to manage energy and temperature
• Temperature Aware Online Scheduling with a Low Cooling Factor
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: On multiprocessor temperature-aware scheduling problems