Modelling Run-Time Arbitration by Latency-Rate Servers in Dataflow Graphs

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

    1 Downloads (Pure)

    Abstract

    In order to obtain a cost-efficient solution, tasks share resources in a Multi-Processor System-on-Chip. In our architecture, shared resources are run-time scheduled. We show how the effects of Latency-Rate servers, which is a class of run-time schedulers, can be included in a dataflow model. The resulting dataflow model, which can have an arbitrary topology, enables us to provide guarantees on the temporal behaviour of the implementation. Traditionally, the end-to-end behaviour of multiple Latency-Rate servers has been analysed with Latency-Rate analysis, which is a Network Calculus. This paper bridges a gap between Network Calculi and dataflow analysis techniques, since we show that a class of run-time schedulers can now be included in dataflow models, or, from a Network Calculus perspective, that restrictions on the topology of graphs that include run-time scheduling can be removed.
    Original languageEnglish
    Title of host publicationProceedings of the 10th International Workshop on Software and Compilers for Embedded Systems (SCOPES)
    EditorsH. Falk, P. Marwedel
    Place of PublicationNew York
    PublisherACM Press
    Pages11-22
    Number of pages12
    DOIs
    Publication statusPublished - 20 Apr 2007
    Event10th International Workshop on Software and Compilers for Embedded Systems, SCOPES 2007 - Acropolis, Nice, France
    Duration: 20 Apr 200720 Apr 2007
    Conference number: 10
    http://www.scopesconf.org/scopes-07/

    Publication series

    NameACM International Conference Proceeding Series
    PublisherACM Press
    NumberP2773
    Volume235

    Workshop

    Workshop10th International Workshop on Software and Compilers for Embedded Systems, SCOPES 2007
    Abbreviated titleSCOPES
    CountryFrance
    CityNice
    Period20/04/0720/04/07
    Internet address

    Keywords

    • EWI-10367
    • METIS-242180
    • IR-61769
    • CAES-EEA: Efficient Embedded Architectures

    Fingerprint Dive into the research topics of 'Modelling Run-Time Arbitration by Latency-Rate Servers in Dataflow Graphs'. Together they form a unique fingerprint.

  • Cite this

    Wiggers, M. H., Bekooij, M. J. G., Bekooij, M. J. G., & Smit, G. J. M. (2007). Modelling Run-Time Arbitration by Latency-Rate Servers in Dataflow Graphs. In H. Falk, & P. Marwedel (Eds.), Proceedings of the 10th International Workshop on Software and Compilers for Embedded Systems (SCOPES) (pp. 11-22). (ACM International Conference Proceeding Series; Vol. 235, No. P2773). New York: ACM Press. https://doi.org/10.1145/1269843.1269846