Combined approach to system level performance analysis of embedded systems
CODES+ISSS '07 Proceedings of the 5th IEEE/ACM international conference on Hardware/software codesign and system synthesis
EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
Modeling buffers with data refresh semantics in automotive architectures
EMSOFT '10 Proceedings of the tenth ACM international conference on Embedded software
EMSOFT '10 Proceedings of the tenth ACM international conference on Embedded software
Enabling parametric feasibility analysis in real-time calculus driven performance evaluation
CASES '11 Proceedings of the 14th international conference on Compilers, architectures and synthesis for embedded systems
Performance analysis of AADL models using real-time calculus
Monterey'08 Proceedings of the 15th Monterey conference on Foundations of Computer Software: future Trends and Techniques for Development
Performance Analysis of Reconfigurations in Adaptive Real-Time Streaming Applications
ACM Transactions on Embedded Computing Systems (TECS)
State-based scheduling with tree schedules: analysis and evaluation
Real-Time Systems
Model-based development and verification of control software for electric vehicles
Proceedings of the 50th Annual Design Automation Conference
| Hi-index | 0.00 |
Recently there has been a growing interest in models and methods targeted towards the (co)design of stream processing applications; e.g. those for audio/video processing. Streams processed by such applications tend to be highly bursty and exhibit a high data-dependent variability in their processing requirements. As a result, classical event and service models such as periodic, sporadic, etc. can be overly pessimistic when dealing with such applications. In this paper, we present a new model called Event Count Automata (ECA) for capturing the timing properties of such streams. Our model can be used to cleanly formulate properties relevant to stream processing on heterogeneousmultiprocessor architectures, such as buffer overflow/underflow constraints. It can also provide the basis for developing analysis methods to compute delay/timing properties of the processed streams under different scheduling policies. Our ECAs, though similar in flavor to timed and hybrid automata, have a different semantics, are more light-weight, and are specifically suited for modeling stream processing applicationsand architectures. We present the basic aspects of this model and illustrate its modeling potential. We then apply it in a specific stream processing setting and develop an analysis technique based on the formalism of Colored Petri Nets (CPNs). Finally, we validate our modeling and analysis techniques with the help of preliminary experimental results generated using the CPN simulation tool.