Computation of Buffer Capacities for Throughput Constrained and Data Dependent Inter-Task Communication

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

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

    9 Citations (Scopus)
    135 Downloads (Pure)

    Abstract

    Streaming applications are often implemented as task graphs. Currently, techniques exist to derive buffer capacities that guarantee satisfaction of a throughput constraint for task graphs in which the inter-task communication is data-independent, i.e. the amount of data produced and consumed is independent of the data values in the processed stream. This paper presents a technique to compute buffer capacities that satisfy a throughput constraint for task graphs with data dependent inter-task communication, given that the task graph is a chain. We demonstrate the applicability of the approach by computing buffer capacities for an MP3 playback application, of which the MP3 decoder has a variable consumption rate. We are not aware of alternative approaches to compute buffer capacities that guarantee satisfaction of the throughput constraint for this application.
    Original languageUndefined
    Title of host publicationDesign Automation and Test in Europe
    Place of PublicationSan Jose, CA, USA
    PublisherEDA Consortium
    Pages640-645
    Number of pages6
    ISBN (Print)978-3-9810801-4-8
    DOIs
    Publication statusPublished - 10 Mar 2008
    EventDesign Automation and Test in Europe - Munich, Germany
    Duration: 10 Mar 200814 Mar 2008

    Publication series

    Name
    PublisherEDA Consortium
    Number1

    Conference

    ConferenceDesign Automation and Test in Europe
    Period10/03/0814/03/08
    Other10-14 March 2008

    Keywords

    • IR-64751
    • EWI-12658
    • METIS-250972

    Cite this