High Level Synthesis

Hong, Inki; Kirovski, Darko; Potkonjak, Miodrag

doi:10.1002/047134608x.w1803

Cited by 5 publications

(5 citation statements)

References 72 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To cover a spectrum of the power function, we looked a t the following two cases: 0 Uniform Distribution, where the coefficient of the power funct,ions of the tasks are distributed uniformly bebween 1 and k . In the experiments k E [1,8]; in other words, the power functions are of the form kS3, where k varies uniformly between 1 and 8. 0 Bimodal distribution, represents the case in which there are two types of tasks in the system: those that consume little power and those that consume much power.…”

Section: Experiments Resultsmentioning

confidence: 99%

Determining optimal processor speeds for periodic real-time tasks with different power characteristics

Aydın

Melhem

Mossé

et al.

Proceedings 13th Euromicro Conference on Real-Time Systems

138

137

View full text Add to dashboard Cite

In this paper, we provide a n efficient solution for periodic real-time tasks with (potentially) different power consumption characteristics. We show that, a task T, can run a t a constant speed 5';. at every instance without hurting optimality. We sketch an O(n2 log n ) algorithm to compute the optimal S;. values. We also prove that the EDF (Earliest Deadline First) scheduling policy can be used to obtain a feasible schedule with these optimal speed values.

show abstract

Section: Experiments Resultsmentioning

confidence: 99%

Determining optimal processor speeds for periodic real-time tasks with different power characteristics

Aydın

Melhem

Mossé

et al.

Proceedings 13th Euromicro Conference on Real-Time Systems

138

137

View full text Add to dashboard Cite

show abstract

“…Consider two tasks τ 1 (20, 10, 7) and τ 2 (30,8,3), and the schedule is {τ 1 , τ 2 , τ 1 , τ 2 , τ 1 }. From the equation (11) and (12), the minimum buffer sizes are calculated: h min(1) = 1 and h min(2) = 1.…”

Section: Examplementioning

confidence: 99%

“…VS techniques for real-time applications, in either static or dynamic manners, were proposed in [3,4,5]. The limitation of their approaches is that they do not consider the VST.…”

Section: Introductionmentioning

confidence: 99%

Dynamic voltage scheduling technique for low-power multimedia applications using buffers

Kim

2001

Proceedings of the 2001 International Symposium on Low Power Electronics and Design - ISLPED '01

View full text Add to dashboard Cite

As multimedia applications are used increasingly in many embedded systems, power efficient design for the applications becomes more important than ever. This paper proposes a simple dynamic voltage scheduling technique, which suits the multimedia applications well. The proposed technique fully utilizes the idle intervals with buffers in a variable speed processor. The main theme of this paper is to determine the minimum buffer size to achieve the maximum energy saving in three cases: single-task, multiple subtasks, and multi-task. Experimental results show that the proposed technique is expected to obtain significant power reduction for several real-world multimedia applications.

show abstract

“…Using checkpoints, total reexecution is replaced with partial rollback and recovery. On the other hand, as one of the most commonly used power management techniques, DVS techniques can be used to save energy [1]. Accordingly, the main goal of this paper is to jointly handle time and energy constraints of energy harvesting embedded real-time systems in the presence of failures (e.g., security attacks) by optimal placement of checkpoints.…”

Section: Introductionmentioning

confidence: 99%

Adaptive checkpoint placement in energy harvesting real-time systems

Dehghan

Kargahi

2010

2010 18th Iranian Conference on Electrical Engineering

View full text Add to dashboard Cite

Most of the current embedded systems work in unsecure and fault-prone environments. Such systems usually harvest their required energy from the environment with many sources of unpredictability. On the other hand, more than often, these systems have timing constraints that should be satisfied in spite of the existing problems and limitations mentioned above. In this paper, we propose two checkpoint placement algorithms to manage the harvesting energy through dynamic voltage scaling (DVS) while satisfying the system timing constraints. An offline algorithm is proposed that unformly distributes the checkpoints according to the predicted harvesting energy from the environment. An online algorithm is also proposed which takes the harvesting energy variability into account and dynamically adjusts the checkpoint placement as well as the processor voltage and speed. Therefore, the latter algorithm non-uniformly distributes the checkpoints. The obtained reward by these algorithms have been compared in different energy and workload scenarios through simulation. According to the comparisons, different situation that each of these algorithms may be preferrable are specified. Keywords-Energy managemen; Checkpointing; Real-time embedded systems; Dynamic voltage scaling (DVS); Fault Recovery I. IntroductionAlmost all the emerging real-time systems share a vision of small, inexpensive and battery-operated networked processing devices. Therefore, besides their timing constraints, these systems usually have serious energy limitations. For example, the limited life time of a device battery is an energy constraint. Recently, in order to increase the battery life-time of such devices, energy harvesting techniques are used. Such techniques can help to relax the energy constraints dictated by the initial limitations of the battery capacity. However, since the harvesting energy by such methods does not follow a deterministic behavior, the predictability of the real-time services provided by such systems is extremely affected. On the other hand, since many embedded real-time systems work in harsh and failure prone environments, they suffer from possible security attacks (e.g., Denial of Service attack) and other kinds of damages (e.g., noises in the environments). Such problems can have negative effect on the real-time service availability by causing the service deadline to be missed. In order to avoid such inconveniences and due to the fact that total reexecution of the affected services is not applicable in many real-time services with relatively short deadlines, we can use

show abstract

High Level Synthesis

Abstract: The sections in this article are Transformations for High Level Synthesis High Level Synthesis Techniques for Design Debugging Considering Testability in High Level Synthesis High Level Synthesis for Low Power Conclusion

Cited by 5 publications

References 72 publications

Determining optimal processor speeds for periodic real-time tasks with different power characteristics

Determining optimal processor speeds for periodic real-time tasks with different power characteristics

Dynamic voltage scheduling technique for low-power multimedia applications using buffers

Adaptive checkpoint placement in energy harvesting real-time systems

Contact Info

Product

Resources

About