Middleware Design Optimization of Wireless Protocols Based on the Exploitation of Dynamic Input Patterns

Mamagkakis,; Soudris,; Catthoor,

doi:10.1109/date.2007.364430

Cited by 6 publications

(7 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Although the concept of system scenarios has been applied before on top of concrete design techniques both in an ad-hoc [Chung et al 2002;Hansson et al 2007;Murali et al 2006b;Sasanka et al 2002] as well as in a systematic way 2008b;Mamagkakis et al 2007;Palkovic et al 2006;Yang et al 2002], it is possible to generalize all those scenario approaches into a common systematic methodology. This section describes such a general and still near-optimal methodology, providing generic solutions whenever available.…”

Section: System Scenario Methodologymentioning

confidence: 99%

System-scenario-based design of dynamic embedded systems

Gheorghita

Palkovic²,

Hamers

et al. 2009

ACM Trans. Des. Autom. Electron. Syst.

Self Cite

131

115

View full text Add to dashboard Cite

Document VersionPublisher's PDF, also known as Version of Record (includes final page, issue and volume numbers) Please check the document version of this publication:• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website.• The final author version and the galley proof are versions of the publication after peer review.• The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publicationCitation for published version (APA): Gheorghita, S. V., Palkovic, M., Hamers, J., Vandecappelle, A., Mamagkakis, S., Basten, T., ... Bosschere, . System scenario based design of dynamic embedded systems. (ES reports; Vol. 2007-06). Eindhoven: Technische Universiteit Eindhoven. General rightsCopyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights.• Users may download and print one copy of any publication from the public portal for the purpose of private study or research.• You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal ? Take down policyIf you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim. In the past decade, real-time embedded systems have become much more complex due to the introduction of a lot of new functionality in one application, and due to running multiple applications concurrently. This increases the dynamic nature of today's applications and systems, and tightens the requirements for their constraints in terms of deadlines and energy consumption. State-of-theart design methodologies try to cope with these novel issues by identifying several most used cases and dealing with them separately, reducing the newly introduced complexity. This paper presents a generic and systematic design-time/run-time methodology for handling the dynamic nature of modern embedded systems, which can be utilized by existing design methodologies to increase their efficiency. It is based on the concept of system scenarios, which group system behaviors that are similar from a multi-dimensional cost perspective, such as resource requirements, delay, and energy consumption, in such a way that the system can be configured to exploit this cost similarity. At design-time, these scenarios are individually optimized. Mechanisms for predicting the current scenario at run-time and for switching between scenarios are ...

show abstract

Section: System Scenario Methodologymentioning

confidence: 99%

System-scenario-based design of dynamic embedded systems

Gheorghita

Palkovic²,

Hamers

et al. 2009

ACM Trans. Des. Autom. Electron. Syst.

Self Cite

131

115

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. Scenario basedanalysis has been applied to homogeneous data-flow graphs in [Poplavko et al 2007] with varying execution times per scenario.…”

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

“…Scenario-based or mode-based design [29,12,18,19] is an approach in which the dynamic behaviour of an application is viewed upon as a collection of different behaviours, called scenarios or modes, occurring in certain known or unknown patterns, but each of which is by itself fairly static and predictable in performance and resource usage and can be dealt with by traditional methods. Some of the difficulties are moved, however, to predicting what scenarios occur and to dealing with scenario transitions.…”

Section: Introductionmentioning

confidence: 99%

Worst-case performance analysis of synchronous dataflow scenarios

Geilen

Stuijk

2010

Proceedings of the Eighth IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis

169

View full text Add to dashboard Cite

Synchronous Dataflow (SDF) is a powerful analysis tool for regular, cyclic, parallel task graphs. The behaviour of SDF graphs however is static and therefore not always able to accurately capture the behaviour of modern, dynamic dataflow applications, such as embedded multimedia codecs. An approach to tackle this limitation is by means of scenarios. In this paper we introduce a technique and a tool to automatically analyse a scenario-aware dataflow model for its worstcase performance. A system is specified as a collection of SDF graphs representing individual scenarios of behaviour and a finite state machine that specifies the possible orders of scenario occurrences. This combination accurately captures more dynamic applications and this way provides tighter results than an existing analysis based on a conservative static dataflow model, which is too pessimistic, while looking only at the 'worst-case' individual scenario, without considering scenario transitions, can be too optimistic. We introduce a formal semantics of the model, in terms of (max, +) linear system-theory and in particular (max, +) automata. Leveraging existing results and algorithms from this domain, we give throughput analysis and state space generation algorithms for worst-case performance analysis. The method is implemented in a tool and the effectiveness of the approach is experimentally evaluated.

show abstract

Middleware Design Optimization of Wireless Protocols Based on the Exploitation of Dynamic Input Patterns

Cited by 6 publications

References 11 publications

System-scenario-based design of dynamic embedded systems

System-scenario-based design of dynamic embedded systems

Synchronous dataflow scenarios

Worst-case performance analysis of synchronous dataflow scenarios

Contact Info

Product

Resources

About