Latency-Rate servers & Dataflow models

M.H. Wiggers, Marco Bekooij, Marco Jan Gerrit Bekooij

    Research output: Book/ReportReportProfessional

    16 Downloads (Pure)

    Abstract

    In the signal processing domain, dataflow graphs [2] [10] and their associated analysis techniques are a well-accepted modeling paradigm. The vertices of a dataflow graph represent functionality and are called actors, while the edges model which actors communicate with each other. Traditionally, these actors have been scheduled in a static order or in a fully static fashion [9] [16]. However, for firm real-time applications, run-time scheduling is required if there are tasks, that operate on different streams and share the same resource, for which either the execution time or the execution rate is unknown or impractical to bound.
    Original languageUndefined
    Place of PublicationEnschede
    PublisherCentre for Telematics and Information Technology (CTIT)
    Number of pages26
    Publication statusPublished - 1 Oct 2006

    Publication series

    NameCTIT Technical Report Series
    PublisherCentre for Telematics and Information Technology, University of Twente
    No.06-59
    ISSN (Print)1381-3625

    Keywords

    • METIS-238678
    • EWI-6919
    • IR-66354

    Cite this

    Wiggers, M. H., Bekooij, M., & Bekooij, M. J. G. (2006). Latency-Rate servers & Dataflow models. (CTIT Technical Report Series; No. 06-59). Enschede: Centre for Telematics and Information Technology (CTIT).
    Wiggers, M.H. ; Bekooij, Marco ; Bekooij, Marco Jan Gerrit. / Latency-Rate servers & Dataflow models. Enschede : Centre for Telematics and Information Technology (CTIT), 2006. 26 p. (CTIT Technical Report Series; 06-59).
    @book{8d4e85a362e2405a95a4762132f80f37,
    title = "Latency-Rate servers & Dataflow models",
    abstract = "In the signal processing domain, dataflow graphs [2] [10] and their associated analysis techniques are a well-accepted modeling paradigm. The vertices of a dataflow graph represent functionality and are called actors, while the edges model which actors communicate with each other. Traditionally, these actors have been scheduled in a static order or in a fully static fashion [9] [16]. However, for firm real-time applications, run-time scheduling is required if there are tasks, that operate on different streams and share the same resource, for which either the execution time or the execution rate is unknown or impractical to bound.",
    keywords = "METIS-238678, EWI-6919, IR-66354",
    author = "M.H. Wiggers and Marco Bekooij and Bekooij, {Marco Jan Gerrit}",
    year = "2006",
    month = "10",
    day = "1",
    language = "Undefined",
    series = "CTIT Technical Report Series",
    publisher = "Centre for Telematics and Information Technology (CTIT)",
    number = "06-59",
    address = "Netherlands",

    }

    Wiggers, MH, Bekooij, M & Bekooij, MJG 2006, Latency-Rate servers & Dataflow models. CTIT Technical Report Series, no. 06-59, Centre for Telematics and Information Technology (CTIT), Enschede.

    Latency-Rate servers & Dataflow models. / Wiggers, M.H.; Bekooij, Marco; Bekooij, Marco Jan Gerrit.

    Enschede : Centre for Telematics and Information Technology (CTIT), 2006. 26 p. (CTIT Technical Report Series; No. 06-59).

    Research output: Book/ReportReportProfessional

    TY - BOOK

    T1 - Latency-Rate servers & Dataflow models

    AU - Wiggers, M.H.

    AU - Bekooij, Marco

    AU - Bekooij, Marco Jan Gerrit

    PY - 2006/10/1

    Y1 - 2006/10/1

    N2 - In the signal processing domain, dataflow graphs [2] [10] and their associated analysis techniques are a well-accepted modeling paradigm. The vertices of a dataflow graph represent functionality and are called actors, while the edges model which actors communicate with each other. Traditionally, these actors have been scheduled in a static order or in a fully static fashion [9] [16]. However, for firm real-time applications, run-time scheduling is required if there are tasks, that operate on different streams and share the same resource, for which either the execution time or the execution rate is unknown or impractical to bound.

    AB - In the signal processing domain, dataflow graphs [2] [10] and their associated analysis techniques are a well-accepted modeling paradigm. The vertices of a dataflow graph represent functionality and are called actors, while the edges model which actors communicate with each other. Traditionally, these actors have been scheduled in a static order or in a fully static fashion [9] [16]. However, for firm real-time applications, run-time scheduling is required if there are tasks, that operate on different streams and share the same resource, for which either the execution time or the execution rate is unknown or impractical to bound.

    KW - METIS-238678

    KW - EWI-6919

    KW - IR-66354

    M3 - Report

    T3 - CTIT Technical Report Series

    BT - Latency-Rate servers & Dataflow models

    PB - Centre for Telematics and Information Technology (CTIT)

    CY - Enschede

    ER -

    Wiggers MH, Bekooij M, Bekooij MJG. Latency-Rate servers & Dataflow models. Enschede: Centre for Telematics and Information Technology (CTIT), 2006. 26 p. (CTIT Technical Report Series; 06-59).