Software-based reactive multimedia computation systems are pervasive today in desktops but also in mobile
and ultra-portable devices. Most such systems offer a callback-based architecture to incorporate specific stream
processing. The Synchronous Data flow model (SDF) and its variants are appropriate for many continuous stream
processing problems such as the ones involving video and audio. SDF allows for static scheduling of multi-rate
processing graphs therefore enabling optimal run-time efficiency. But the SDF abstraction does not adapt well to
real-time processing because it lacks the notion of time: executing non-trivial schedules of multi-rate data flows
in a time-triggered callback architecture, though possible through buffering, causes jitter, excessive latency and
run-time inefficiencies. In this paper we formally describe a new Time-Triggered SDF (TTSDF) model with a
static scheduling algorithm that produces periodic schedules than can be split among several callback activations,
solving the above-mentioned problems. The model has the same expressiveness than SDF, in the sense that any
graph computable by one model will also be computable by the other. Additionally, it enables parallelization
and run time load balancing between callback activations.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.