Minimizing energy on homogeneous processors with shared memory

DOI10.1016/J.TCS.2021.03.030MaRDI QIDQ5925517zbMATH OpenOpenAlexFDO

Authors Vincent Chau, Chi Kit Ken Fong, Shengxin Liu, Elaine Yinling Wang, Yong Zhang

Publication date 14 April 2021

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

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

zbMATH Keywords

approximation algorithmenergy minimizationschedulingshared memory

Mathematics Subject Classification ID

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

Review text

This paper considers the system-wide energy-efficient task scheduling problem in a system architecture equipped with a multi-core processor and a shared main memory. The focus is on the case when the number of tasks is greater than the number of cores, which has been proved to be NP-hard if the number of cores is at least 2. For the multiple-cores case, based on observation from the single-core case, a polynomial-time approximation algorithm is devised with guaranteed performance.

Recommendations

• Minimizing energy on homogeneous processors with shared memory
• Energy efficient voltage scheduling for multi-core processors with software controlled dynamic voltage scaling
• Minimizing total completion time in multiprocessor job systems with energy constraint
• A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption
• A Monte Carlo algorithm for real time task scheduling on multi-core processors with software controlled dynamic voltage scaling

Cites work

• A fully polynomial-time approximation scheme for speed scaling with a sleep state
• Algorithms for dynamic speed scaling
• Algorithms for power savings
• An O(n^2) algorithm for computing optimal continuous voltage schedules
• Energy-efficient scheduling and routing via randomized rounding
• Flow shop for dual CPUs in dynamic voltage scaling
• scientific article; zbMATH DE number 1306870 (Why is no real title available?)
• Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines
• Minimizing energy on homogeneous processors with shared memory
• On multi-processor speed scaling with migration
• Polynomial-time algorithms for minimum energy scheduling
• Race to idle or not: balancing the memory sleep time with DVS for energy minimization
• Scheduling to minimize gaps and power consumption
• Scheduling unit tasks to minimize the number of idle periods
• Speed scaling on parallel processors
• Speed scaling on parallel processors with migration
• Speed scaling problems with memory/cache consideration

Cited in

(8)

• Energy efficient voltage scheduling for multi-core processors with software controlled dynamic voltage scaling
• A Monte Carlo algorithm for real time task scheduling on multi-core processors with software controlled dynamic voltage scaling
• Race to idle or not: balancing the memory sleep time with DVS for energy minimization
• Thermal implications of energy-saving schedulers
• Energy minimization with loop fusion and multi-functional-unit scheduling for multidimensional DSP
• Multi-Processor Computer System Having Low Power Consumption
• Minimizing energy on homogeneous processors with shared memory
• Multi-core processor scheduling with respect to data bus bandwidth

This page was built for publication: Minimizing energy on homogeneous processors with shared memory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5925517)