Managing dynamic concurrent tasks in embedded real-time multimedia systems

Yang, Pingxiong; Marchal, Paul Alfred; Wong, Chun; Himpe, Stefaan; Catthoor, Francky; David, Patrick; Vounckx, Johan; Lauwereins, Rudy

doi:10.1145/581199.581226

Cited by 67 publications

(38 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Yang et al [71] propose technique for mapping concurrent tasks onto a heterogeneous multiprocessor platform in an energy efficient manner. On different processors, the execution time and energy consumption of the tasks are different and hence, their technique finds different task-ordering and processor-assignment possibilities , and generate a Pareto-optimal set, where every point is better than any other one in at least one way (i.e., either energy efficiency or execution speed).…”

Section: Dvfs and Power-aware Scheduling Based Techniquesmentioning

confidence: 99%

A survey of techniques for improving energy efficiency in embedded computing systems

Mittal¹

2014

IJCAET

133

View full text Add to dashboard Cite

Recent technological advances have greatly improved the performance and features of embedded systems. With the number of just mobile devices now reaching nearly equal to the population of earth, embedded systems have truly become ubiquitous. These trends, however, have also made the task of managing their power consumption extremely challenging. In recent years, several techniques have been proposed to address this issue. In this paper, we survey the techniques for managing power consumption of embedded systems. We discuss the need of power management and provide a classification of the techniques on several important parameters to highlight their similarities and differences. This paper is intended to help the researchers and application-developers in gaining insights into the working of power management techniques and designing even more efficient high-performance embedded systems of tomorrow.

show abstract

Section: Dvfs and Power-aware Scheduling Based Techniquesmentioning

confidence: 99%

A survey of techniques for improving energy efficiency in embedded computing systems

Mittal¹

2014

IJCAET

133

View full text Add to dashboard Cite

show abstract

“…State-of-the-art scenario-based analysis Yang et al 2002;Mamagkakis et al 2007] mostly deals with sequential code and not with parallel applications such as SDF graphs. In [Mamagkakis et al 2007], scenarios are applied from a system perspective on a concrete design case.…”

Section: Related Workmentioning

confidence: 99%

“…Models used in this process often capture aspects of both the application behaviour as well as of the platform on which the applications are mapped and of the impact of other applications contending for the resources and the arbitration of those resources. A second emerging trend is scenario-based design [Yang et al 2002;Gheorghita et al 2006;Mamagkakis et al 2007]. In this approach, the dynamic behaviour of an application is viewed upon as a collection of different behaviours (scenarios) occurring in some arbitrary order, but each of which is by itself fairly static and predictable in performance and resource usage and can be dealt with by traditional methods.…”

Section: Introductionmentioning

confidence: 99%

Synchronous dataflow scenarios

Geilen

2010

ACM Trans. Embed. Comput. Syst.

View full text Add to dashboard Cite

The Synchronous Data-Flow (SDF) model of computation by Lee and Messerschmitt has become popular for modelling concurrent applications on a multi-processor platform. It is used to obtain a guaranteed, predictable performance. The model is on the other hand quite restrictive in its expressivity, making it less applicable to many modern, more dynamic applications. A common technique to deal with dynamic behaviour is to consider different scenarios in separation. This analysis is however, currently limited mainly to sequential applications.In this paper, we present a new analysis approach that allows analysis of Synchronous DataFlow models across different scenarios of operation. The dataflow graphs corresponding to the different scenarios can be completely different. Execution times, consumption and production rates and the structure of the SDF may change. Our technique allows to derive or prove worstcase performance guarantees of the resulting model and as such extends the model-driven approach to designing predictable systems to significantly more dynamic applications and platforms. The approach is illustrated with three MP3 and MPEG-4 related case studies.

show abstract

“…Researchers from IMEC were the first to identify and exploit these types of scenarios. 2 The cost space is defined over a specific problem's dimensions of interest. For example, we might be interested in operation modes that share the same source code or that execute in the same number of CPU cycles.…”

Section: Use-case Versus Application Scenariosmentioning

confidence: 99%

“…2 Other work applies this concept several times in an ad hoc manner, with an emphasis on the exploitation of scenarios, mostly ignoring (automatic) identification and prediction. Sasanka, Hughes, and Adve concentrated on saving energy for a sequential application.…”

mentioning

confidence: 99%

Application Scenarios in Streaming-Oriented Embedded-System Design

Gheorghita

Basten

Corporaal

2008

IEEE Des. Test. Comput.

View full text Add to dashboard Cite

&EMBEDDED SYSTEMS USUALLY consist of processors that execute domainspecific applications. Much of their functionality is implemented in software, which runs on one or multiple processors, leaving only the high-performance functions implemented in hardware. Most typical embedded systems (such as TVs, cellular phones, and MP3 players) run multimedia or telecom applications that exhibit dynamic behavior, and their execution costs (such as the number of cycles and energy) depend on the input data. Moreover, these applications are often implemented as a main loop, called the loop of interest, that is executed over and over again, reading, processing, and writing out individual stream objects (see Figure 1). A stream object could be a bit belonging to a compressed bitstream representing a coded video clip, or it could be a macroblock, video frame, audio sample, or network package. Usually, these applications must deliver a given throughput (number of objects per second), which imposes a time constraint on each loop iteration. The read part of the loop of interest takes a stream object from the input stream and separates it into a header and the object's data. The processing part consists of several kernels. The write part sends the processed data to output devices, such as a screen or speakers, and saves the application's internal state for further use; for example, in a video decoder, the previous decoded frame might be necessary to decode the current frame. The dynamism existing in modern applications leads to the use of different kernels for each stream object, depending on the object type. The actions executed in a particular loop iteration form the application's internal operation mode.In this article, we describe a method that provides a systematic way of detecting and exploiting, at design time and runtime, the different internal operation modes. The fact that applications have different internal operation modes has not been fully exploited in embedded-system design thus far. Our approach combines a static analysis and profiling of the system at design time with information collected at runtime about the system's environment. By knowing a system's possible operation modes and information about their resource consumption at design time, it is possible to make specific and aggressive design decisions for each operation mode at different design steps.To avoid complexity problems, we cluster the operation modes that are closely related to one another from a resource consumption perspective in application scenarios, distinguishing the truly different operation modes via different scenarios. It is then possible to derive a faster or lower-energy implementation (for example, by using different source-code optimizations per scenario) or a better estimation of required resources (such as the number of computation cycles or bandwidth). This leads to a smaller, lessexpensive, and more energy-efficient system that can deliver the required performance. 581A design method for handling increasingly dynamic real-time embeddeds...

show abstract

Managing dynamic concurrent tasks in embedded real-time multimedia systems

Cited by 67 publications

References 34 publications

A survey of techniques for improving energy efficiency in embedded computing systems

A survey of techniques for improving energy efficiency in embedded computing systems

Synchronous dataflow scenarios

Application Scenarios in Streaming-Oriented Embedded-System Design

Contact Info

Product

Resources

About