Performance Analysis of Multimedia Applications using Correlated Streams

Huang, Kai; Thiele, Lothar; Stefanov, Todor; Deprettere, E.F.

doi:10.1109/date.2007.364409

Cited by 8 publications

(6 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, [11] distribute frames over the processors for load distribution, like splitting traffic over two lanes and then merging it again, rather than the synchronous split join of our example.…”

Section: B Previous Workmentioning

confidence: 97%

“…Correlated streams are also used in [11] for the analysis of a fork-join scenario, where the load of a single event stream is split over several processing components and then merged in a scenario similar to the multimedia decoder of Figure 1. However, [11] distribute frames over the processors for load distribution, like splitting traffic over two lanes and then merging it again, rather than the synchronous split join of our example.…”

Section: B Previous Workmentioning

confidence: 99%

See 1 more Smart Citation

A correlation preserving performance analysis for stream processing systems

Smeding

Gößler

2012

Tenth ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMCODE2012)

View full text Add to dashboard Cite

For the design of real-time embedded systems, analysis of performance and resource utilization at an early stage is crucial to evaluate design choices. Network Calculus and its variants provide the tools to perform such analyses for distributed systems processing streams of tasks, based on a max-plus algebra. However, the underlying model employed in Network Calculus cannot capture correlations between the availability of different resources and between the arrivals of tasks, leading to overly conservative performance bounds for some frequently used system topologies. We present a model based on timing constraints relative to pairs of streams, endowed with an analysis technique that can handle such correlations.

show abstract

Section: B Previous Workmentioning

confidence: 97%

Section: B Previous Workmentioning

confidence: 99%

A correlation preserving performance analysis for stream processing systems

Smeding

Gößler

2012

Tenth ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMCODE2012)

View full text Add to dashboard Cite

show abstract

“…But the results in [5,8] do not allow to separate a joined stream again into its individual sub-streams. Timing correlations in the presence of simple split-join scenarios of event streams have been studied in [7,12]. However, the present work is different, as we consider join and fork operations based on event types and focus on the structure of the joined streams.…”

Section: Related Workmentioning

confidence: 99%

Modeling structured event streams in system level performance analysis

et al. 2010

Self Cite

View full text Add to dashboard Cite

This paper extends the methodology of analytic real-time analysis of distributed embedded systems towards merging and extracting sub-streams based on event type information. For example, one may first merge a set of given event streams, then process them jointly and finally decompose them into separate streams again. In other words, data streams can be hierarchically composed into higher level event streams and decomposed later on again. The proposed technique is strictly compositional, hence highly suited for being embedded into well known performance evaluation frameworks such as Symta/S and MPA (Modular Performance Analysis). It is based on a novel characterization of structured event streams which we denote as Event Count Curves. They characterize the structure of event streams in which the individual events belong to a finite number of classes. This new concept avoids the explicit maintenance of streamindividual information when routing a composed stream through a network of system components. Nevertheless it allows an arbitrary composition and decomposition of sub-streams at any stage of the distributed event processing. For evaluating our approach we analyze a realistic case-study and compare the obtained results with other existing techniques.

show abstract

“…Often, RTC delivers precise results, but it cannot accurately capture state information. Efforts in this direction have been the analysis of correlated streams in [5] and lightweight state mechanics in [6]. A FPNS model has been proposed for RTC in [7], but it cannot directly interact with state-based subsystems.…”

Section: Introductionmentioning

confidence: 99%

Automata-theoretic modeling of fixed-priority non-preemptive scheduling for formal timing verification

Kauer¹,

Steinhorst²,

Schneider³

et al. 2014

2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC)

View full text Add to dashboard Cite

The design process of safety-critical systems requires formal analysis methods to ensure their correct functionality without over-sized safety margins and extensive testing. For architectures with state-based events or scheduling, such as load-dependent frequency scaling, model checking has emerged as a promising tool. It formally verifies timing behavior of realtime systems with minimal over-approximation of the worst case delays. In this context, Event Count Automata (ECAs) have become a valuable modeling approach because they are specifically designed to handle typical arrival patterns and integrate well with analytic techniques.In this work, we propose an extension of the ECA framework's semantics and use it in a Fixed-Priority Non-preemptive Scheduling (FPNS) model that correctly abstracts the intra-slot behavior in the slotted-time model of the ECA. This is challenging because straightforward implementations cannot capture the full behavior of event-triggered scheduling with such a time model that the ECA shares with most model checking based methods. In a case study, we obtain bounds via model checking a basic model and then our proposed model. We compare these bounds with a SystemC simulation. This shows that the bounds from the basic model are too optimistic -and exceeded in practicebecause it does not capture the full behavior, while the bounds from the proposed extended model are both safe and reasonably tight.

show abstract

Performance Analysis of Multimedia Applications using Correlated Streams

Cited by 8 publications

References 16 publications

A correlation preserving performance analysis for stream processing systems

A correlation preserving performance analysis for stream processing systems

Modeling structured event streams in system level performance analysis

Automata-theoretic modeling of fixed-priority non-preemptive scheduling for formal timing verification

Contact Info

Product

Resources

About