Synchronous Data Flow Scenarios1

m.c.w.geilen a©tue.nl 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 Data-Flow 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 worst-case 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. Categories and Subject Descriptors: F.1.1 [Computation by Abstract Devices]: Models of Computation 1