Efficient Computation of Buffer Capacities for Cyclo-Static Real-Time Systems with Back-Pressure

M.H. Wiggers, Marco J.G. Bekooij, Marco Jan Gerrit Bekooij, P.G. Jansen, Gerardus Johannes Maria Smit

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    29 Citations (Scopus)
    167 Downloads (Pure)


    This paper describes a conservative approximation algorithm that derives close to minimal buffer capacities for an application described as a cyclo-static dataflow graph. The resulting buffer capacities satisfy constraints on the maximum buffer capacities and end-to-end throughput and latency constraints. Furthermore we show that the effects of run-time arbitration can be included in the response times of dataflow actors. We show that modelling an MP3 playback application as a cyclo-static dataflow graph instead of a multi-rate dataflow graph results in buffer capacities that are reduced up to 39%. Furthermore, the algorithm is applied to a real-life car-radio application, in which two independent streams are processed.
    Original languageUndefined
    Title of host publicationProceedings of the 13th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS'07
    Place of PublicationLos Alamitos, CA, United States
    PublisherIEEE Computer Society
    Number of pages12
    ISBN (Print)0-7695-2800-7
    Publication statusPublished - Apr 2007
    Event13th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS - Seattle, WA, United States
    Duration: 3 Apr 20076 Apr 2007

    Publication series

    PublisherIEEE Computer Society
    ISSN (Print)1080-1812


    Conference13th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS
    Other3-6 April 2007


    • METIS-242168
    • IR-67100
    • EWI-9806
    • CAES-EEA: Efficient Embedded Architectures

    Cite this