Sciweavers

Share
RTAS
2009
IEEE

Lightweight Modeling of Complex State Dependencies in Stream Processing Systems

12 years 6 months ago
Lightweight Modeling of Complex State Dependencies in Stream Processing Systems
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 thi...
Anne Bouillard, Linh T. X. Phan, Samarjit Chakrabo
Added 21 May 2010
Updated 21 May 2010
Type Conference
Year 2009
Where RTAS
Authors Anne Bouillard, Linh T. X. Phan, Samarjit Chakraborty
Comments (0)
books