Toward the Placement of Power Management Points in Real-Time Applications

AbouGhazaleh, Nevine; Mossé, Daniel; Childers, Bruce R.; Melhem, Rami

doi:10.1007/978-1-4419-9292-5_3

Cited by 25 publications

(21 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We compare the results of our algorithm VAR-TB with a DVS algorithm which considers the worst-case only (WC-DVS), a worst-case DVS algorithm which performs dynamic slack reclamation [27] (WC-Reclaim) and a hypothetical method that can accurately determine the workloads of each task before hand and performs optimal scheduling (Oracle). WC-Reclaim allocates dynamic slack proportional to worst-case WorkLoad(v).…”

Section: Resultsmentioning

confidence: 99%

Energy efficient multiprocessor task scheduling under input-dependent variation

Cong

Gururaj

2009

2009 Design, Automation &Amp; Test in Europe Conference &Amp; Exhibition

View full text Add to dashboard Cite

-In this paper, we propose a novel, energy aware scheduling algorithm for applications running on DVS-enabled multiprocessor systems, which exploits variation in execution times of individual tasks. In particular, our algorithm takes into account latency and resource constraints, precedence constraints among tasks and input-dependent variation in execution times of tasks to produce a scheduling solution and voltage assignment such that the average energy consumption is minimized. Our algorithm is based on a mathematical programming formulation of the scheduling and voltage assignment problem and runs in polynomial time. Experiments with randomly generated task graphs show that up to 30% savings in energy can be obtained by using our algorithm over existing techniques. We perform experiments on two real-world applications -MPEG-4 decoder and MJPEG encoder. Simulations show that the scheduling solution generated by our algorithm can provide up to 25% reduction in energy consumption over greedy dynamic slack reclamation algorithms.

show abstract

Section: Resultsmentioning

confidence: 99%

Energy efficient multiprocessor task scheduling under input-dependent variation

Cong

Gururaj

2009

2009 Design, Automation &Amp; Test in Europe Conference &Amp; Exhibition

View full text Add to dashboard Cite

show abstract

“…Pillai et al also proposed a set of scheduling algorithms (static and dynamic) for periodic tasks based on EDF/RM scheduling policy [19]. AbouGhazaleh et al have studied the effect of voltage/speed adjustment overhead on choosing the granularity of inserting power management points in a program [1].…”

Section: Related Workmentioning

confidence: 99%

Energy aware scheduling for distributed real-time systems

Mishra

Rastogi

Zhu

et al.

Proceedings International Parallel and Distributed Processing Symposium

135

View full text Add to dashboard Cite

show abstract

“…However, in practice, the energy and time overhead associated with each speed adjustment can overshadow the DVS energy savings. In past work [AbouGhazaleh et al 2001], we studied a special case in which we consider only sequential code. Our goal then was to determine how many PMPs should be inserted in the code to minimize energy consumption while taking into account the overhead of computing and setting a new speed.…”

Section: Os Compiler Collaborationmentioning

confidence: 99%

Collaborative operating system and compiler power management for real-time applications

AbouGhazaleh

Mossé

Childers

et al. 2006

ACM Trans. Embed. Comput. Syst.

Self Cite

View full text Add to dashboard Cite

Managing energy consumption has become vitally important to battery-operated portable and embedded systems. Dynamic voltage scaling (DVS) reduces the processor's dynamic power consumption quadratically at the expense of linearly decreasing the performance. When reducing energy with DVS for real-time systems, one must consider the performance penalty to ensure that deadlines can be met. In this paper, we introduce a novel collaborative approach between the compiler and the operating system (OS) to reduce energy consumption. We use the compiler to annotate an application's source code with path-dependent information called power-management hints (PMHs). This fine-grained information captures the temporal behavior of the application, which varies by executing different paths. During program execution, the OS periodically changes the processor's frequency and voltage based on the temporal information provided by the PMHs. These speed adaptation points are called power-management points (PMPs). We evaluate our scheme using three embedded applications: a video decoder, automatic target recognition, and a sub-band tuner. Our scheme shows an energy reduction of up to 57% over no power-management and up to 32% over a static power-management scheme. We compare our scheme to other schemes that solely utilize PMPs for power-management and show experimentally that our scheme achieves more energy savings. We also analyze the advantages and disadvantages of our approach relative to another compiler-directed scheme.

show abstract

Toward the Placement of Power Management Points in Real-Time Applications

Cited by 25 publications

References 8 publications

Energy efficient multiprocessor task scheduling under input-dependent variation

Energy efficient multiprocessor task scheduling under input-dependent variation

Energy aware scheduling for distributed real-time systems

Collaborative operating system and compiler power management for real-time applications

Contact Info

Product

Resources

About