Voltage scheduling problem for dynamically variable voltage processors

Ishihara,; Yasuura, Hiroto

doi:10.1109/lpe.1998.708188

Cited by 92 publications

(182 citation statements)

References 0 publications

Supporting

Mentioning

181

Contrasting

Order By: Relevance

“…Additionally, there are online and offline DVS scheduling algorithms. Offline DVS scheduling algorithms, know beforehand the task parameters, such as arrival time, deadline, worst case execution time ( [14], [15]). Online DVS scheduling algorithms do not have this information during execution, but receive it on a task-by-task basis, once the task arrived in the system and is ready to run ( [16]).…”

Section: Introductionmentioning

confidence: 99%

UML-Based Analysis of Power Consumption for Real-Time Embedded Systems

Hagner

Aniculăesei

Goltz

2011

2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications

View full text Add to dashboard Cite

The complexity of embedded systems has risen significantly in the last years. The model based development approach helped to keep an overview over the development and over the fulfillment of non-functional properties, as it is possible to capture and analyze the scheduling using UML development models. Other aspects, e.g. the power consumption, are not considered in development models, modelling languages, and analysis support based on development models. The common approach is to measure the consumption at the end of the development, but there is no tool support for earlier phases analysis. We present a UML profile for power/energy consumption and a simple algorithm to analyze the power consumption based on an UML model extended with our profile. As more power awareness could result in losing real-time constraints, we consider both aspects, real-time scheduling and power awareness, and present a method to bring both non-functional properties and their analyses in context. Additionally, we present an approach to find a task configuration for a dynamic voltage scaling system that satisfies all real-time requirements, but is most power efficient.2011 International Joint Conference of IEEE TrustCom-11/IEEE ICESS-11/FCST-11 978-0-7695-4600-1/11 $26.00

show abstract

Section: Introductionmentioning

confidence: 99%

UML-Based Analysis of Power Consumption for Real-Time Embedded Systems

Hagner

Aniculăesei

Goltz

2011

2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications

View full text Add to dashboard Cite

show abstract

“…Static (or off-line) scheduling methods to reduce power consumption in real-time systems were proposed in [28, 11,6] .These approaches address task sets with a single period or aperiodic tasks. Heuristics for on-line scheduling of aperiodic tasks while not hurting the feasibility of offline periodic requests are proposed in [7].…”

Section: Relatedmentioning

confidence: 99%

Power-optimized scheduling server for real-time tasks

Mejía-Álvarez

Levner²,

Mossé³

Proceedings. Eighth IEEE Real-Time and Embedded Technology and Applications Symposium

View full text Add to dashboard Cite

In this paper we propose a novel scheduling framework for a dynamic real-time environment with energy constraints. This framework dynamically adjusts the CPU voltage/frequency so that no task in the system misses its deadline and the total energy savings of the system are maximized. In this paper we consider only realistic, discrete-Ievel speeds.Each task in the system consumes a certain amount of energy, which depends on a speed chosen for execution. The process of selecting speeds for execution while maximizing the energy savings of the system requires the exploration of a large number of combinations, which is too time consuming to be computed on-line. Thus, we propose an integrated heuristic methodology which executes an optimization procedure in a low computation time. This scheme allows the scheduler to handle power-aware realtime tasks with low cost while maximizing the use of the available resources and without jeopardizing the temporal constraints of the system. Simulation results show that our heuristic methodology is able to generate power-aware scheduling solutions with near-optimal performance.

show abstract

“…Hong et al [4] proposed a heuristic t o schedule mixed workloads of static and dynamic tasks, based on the Yao et al's algorithm. Ishihara and Yasuura [3] proposed an optimal voltage allocation technique using discontinuously variable voltage processor. However, the optimality of the technique is confined to a single task.…”

Section: Dac2003mentioning

confidence: 99%

“…Specifically, the contributions are two folds: (1) For given multiple discrete supply voltages and tasks with arbitrary arrival-time/deadline constraints, we propose a voltage allocation technique which produces a feasible (task) schedule with optimal processor energy consumption; (2) We then extend the problem to include the case in which tasks have non-uniform switched capacitances, and solve it optimally. The technique in (1) is based on the prior results in [5] (which is optimal for continuously variable voltages, but not for discrete ones) and [3] (which is optimal for a single task, but not for multiple tasks), whereas the technique in (2) is based on an efficient linear programming (LP) formulation. Note that the values of ai, di, Ri and Ci are given for task J i , and the values of s i ( t ) and P i ( s i ( t ) ) vary according to the dynamic allocation of voltages to J i , and thus directly affect the amount of energy consumption.…”

Section: Dac2003mentioning

confidence: 99%

“…There are two optimal results in the literature that are related to Problem 2: (a) Ishihara and Yasuura [3] showed that if there is only a single task (i.e., Problem 2 with N=l), an optimal voltage allocation is to use the two voltages in V that are the immediate neighbors to the (ideal) voltage in which its clock speed leads to a completion of the task exactly at the time of its deadline; (b) Yao et al [5] proposed an optimal allocation for Problem 2 with an infinite number and range of supply voltages (i.e., continuously variable voltages). Consequently, it is natural t o examine the algorithmic procedures used in (a) and (b) to see if they are partially applicable to Problem 2.…”

Section: Allocation With Uniform Capacitancesmentioning

confidence: 99%

See 1 more Smart Citation

Optimal voltage allocation techniques for dynamically variable voltage processors

Kwon¹,

Kim²

Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451)

View full text Add to dashboard Cite

This paper presents a set of new important results for the problem of task scheduling and voltage allocation in dynamically variable voltage processor for minimizing the total processor energy consumption. The contributions are two folds: (1) For given multiple discrete supply voltages and tasks with arbitrary arrival-time/deadline constraints, we propose a voltage allocation technique which produces a feasible task schedule with optimal processor energy consumption; (2) We then extend the problem t o include the case in which tasks have non-uniform load (i.e., switched) capacitances, and solve it optimally.

show abstract

Voltage scheduling problem for dynamically variable voltage processors

Cited by 92 publications

References 0 publications

UML-Based Analysis of Power Consumption for Real-Time Embedded Systems

UML-Based Analysis of Power Consumption for Real-Time Embedded Systems

Power-optimized scheduling server for real-time tasks

Optimal voltage allocation techniques for dynamically variable voltage processors

Contact Info

Product

Resources

About