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

    Research output: Book/ReportReportProfessional

    27 Citations (Scopus)
    67 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 languageUndefined
    Place of PublicationEnschede
    PublisherComputer Architecture for Embedded Systems (CAES)
    Number of pages10
    Publication statusPublished - 30 Jan 2007

    Publication series

    NameCTIT Technical Report Series
    PublisherCentre for Telematics and Information Technology, University of Twente
    No.TR-CTIT-07-65
    ISSN (Print)1381-3625

    Keywords

    • EWI-9263
    • CAES-EEA: Efficient Embedded Architectures
    • IR-66946
    • METIS-242157

    Cite this

    Wiggers, M. H., Bekooij, M. J. G., Bekooij, M., & Smit, G. J. M. (2007). Modelling Run-Time Arbitration by Latency-Rate Servers in Dataflow Graphs. (CTIT Technical Report Series; No. TR-CTIT-07-65). Enschede: Computer Architecture for Embedded Systems (CAES).
    Wiggers, M.H. ; Bekooij, Marco Jan Gerrit ; Bekooij, Marco ; Smit, Gerardus Johannes Maria. / Modelling Run-Time Arbitration by Latency-Rate Servers in Dataflow Graphs. Enschede : Computer Architecture for Embedded Systems (CAES), 2007. 10 p. (CTIT Technical Report Series; TR-CTIT-07-65).
    @book{105fa65f6b904548af1df7a795596978,
    title = "Modelling Run-Time Arbitration by Latency-Rate Servers in Dataflow Graphs",
    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.",
    keywords = "EWI-9263, CAES-EEA: Efficient Embedded Architectures, IR-66946, METIS-242157",
    author = "M.H. Wiggers and Bekooij, {Marco Jan Gerrit} and Marco Bekooij and Smit, {Gerardus Johannes Maria}",
    year = "2007",
    month = "1",
    day = "30",
    language = "Undefined",
    series = "CTIT Technical Report Series",
    publisher = "Computer Architecture for Embedded Systems (CAES)",
    number = "TR-CTIT-07-65",

    }

    Wiggers, MH, Bekooij, MJG, Bekooij, M & Smit, GJM 2007, Modelling Run-Time Arbitration by Latency-Rate Servers in Dataflow Graphs. CTIT Technical Report Series, no. TR-CTIT-07-65, Computer Architecture for Embedded Systems (CAES), Enschede.

    Modelling Run-Time Arbitration by Latency-Rate Servers in Dataflow Graphs. / Wiggers, M.H.; Bekooij, Marco Jan Gerrit; Bekooij, Marco; Smit, Gerardus Johannes Maria.

    Enschede : Computer Architecture for Embedded Systems (CAES), 2007. 10 p. (CTIT Technical Report Series; No. TR-CTIT-07-65).

    Research output: Book/ReportReportProfessional

    TY - BOOK

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

    AU - Wiggers, M.H.

    AU - Bekooij, Marco Jan Gerrit

    AU - Bekooij, Marco

    AU - Smit, Gerardus Johannes Maria

    PY - 2007/1/30

    Y1 - 2007/1/30

    N2 - 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.

    AB - 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.

    KW - EWI-9263

    KW - CAES-EEA: Efficient Embedded Architectures

    KW - IR-66946

    KW - METIS-242157

    M3 - Report

    T3 - CTIT Technical Report Series

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

    PB - Computer Architecture for Embedded Systems (CAES)

    CY - Enschede

    ER -

    Wiggers MH, Bekooij MJG, Bekooij M, Smit GJM. Modelling Run-Time Arbitration by Latency-Rate Servers in Dataflow Graphs. Enschede: Computer Architecture for Embedded Systems (CAES), 2007. 10 p. (CTIT Technical Report Series; TR-CTIT-07-65).