Skip to Main content Skip to Navigation
Conference papers

Lightweight Modeling of Complex State Dependencies in Stream Processing Systems

Anne Bouillard 1 Linh T. X. Phan 2 Samarjit Chakraborty 2 
1 DISTRIBCOM - Distributed and Iterative Algorithms for the Management of Telecommunications Systems
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : Over the last few years, Real-Time Calculus has been used extensively to model and analyze embedded systems processing continuous data/event streams. Towards this, bounds on the arrival process of streams and bounds on the processing capacity of resources serve as inputs to the model, which are used to calculate end-to-end delays suffered by streams, maximum backlog, utilization of resources, etc. This “functional” model, although amenable to computationally inexpensive analysis methods, has limited modeling capability. In particular, “state-based” processing, e.g. blocking write – where the processing depends on the “state” or fill-level of the buffer – cannot be modeled in a straightforward manner. This has led to a number of recent proposals on using automata-theoretic models for stream processing systems (e.g. Event Count Automata [RTSS 2005]). Although such models offer better modeling flexibility, they suffer from the usual state-space explosion problem. In this paper we show that a number of complex state-dependencies can be modeled in a lightweight manner, using a feedback control technique. This avoids explicit state modeling, and hence the state-space explosion problem. Our proposed modeling and analysis therefore extend the original Real-Time Calculus-based functional modeling in a very useful way, and cover much larger problem domain compared to what was previously possible without explicit state-modeling. We illustrate its utility through two case studies and also compare our analysis results with those obtained from detailed system simulations (which are significantly more time consuming).
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download
Contributor : Anne Bouillard Connect in order to contact the contributor
Submitted on : Wednesday, November 4, 2009 - 1:59:49 PM
Last modification on : Friday, February 4, 2022 - 3:22:18 AM
Long-term archiving on: : Thursday, June 17, 2010 - 7:20:52 PM


Files produced by the author(s)


  • HAL Id : inria-00429776, version 1


Anne Bouillard, Linh T. X. Phan, Samarjit Chakraborty. Lightweight Modeling of Complex State Dependencies in Stream Processing Systems. 15th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS 2009), Apr 2009, San Francisco, United States. 10 p. ⟨inria-00429776⟩



Record views


Files downloads