No abstract

No abstract

No abstract

Energy-efficient scheduling is a step towards meeting green computing requirements. The work in this direction mainly aims at reducing dynamic energy consumption that includes clock gating, cache subbanking, and dynamic voltage and frequency scaling of underlying processors. However, the emergence of fast and compact transistor sizes has exponentially added onto the processor static power consumption, which has not been paid much attention. This article proposes a duplication-controlled static energy-efficient scheduling (C-SEED) algorithm for scheduling precedence constrained applications on parallel computing systems. The C-SEED algorithm couples adaptive threshold-based duplication with system level dynamic power management technique to achieve its objectives. Dynamic power management works by selectively putting the energy-consuming resources to efficient low-power states for idle times to reduce energy consumption. Efficacy of the proposed algorithm is analyzed and compared against other relevant works on the basis of makespan and total energy (dynamic + static + communication)consumption. The extensive simulation results carried over large set of random and regular task graphs show that the proposed C-SEED algorithm has potential to reduce energy consumption as well as makespan.KEYWORDS duplication-based scheduling, dynamic power management, list-based scheduling, multiprocessor scheduling, static power consumption

No abstract