Combining offsets with precedence constraints to improve temporal analysis of cyclic real-time streaming applications

Philip Sebastian Kurtin, J.P.H.M. Hausmans, Marco Jan Gerrit Bekooij

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

    12 Citations (Scopus)
    51 Downloads (Pure)


    Stream processing applications executed on multiprocessor systems usually contain cyclic data dependencies due to the presence of bounded FIFO buffers and feedback loops, as well as cyclic resource dependencies due to the usage of shared processors. In recent works it has been shown that temporal analysis of such applications can be performed by iterative fixed-point algorithms that combine dataflow and response time analysis techniques. However, these algorithms consider resource dependencies based on the assumption that tasks on shared processors are enabled simultaneously, resulting in a significant overestimation of interference between such tasks. This paper extends these approaches by integrating an explicit consideration of precedence constraints with a notion of offsets between tasks on shared processors, leading to a significant improvement of temporal analysis results for cyclic stream processing applications. Moreover, the addition of an iterative buffer sizing enables an improvement of temporal analysis results for acyclic applications as well. The performance of the presented approach is evaluated in a case study using a WLAN transceiver application. It is shown that 56% higher throughput guarantees and 52% smaller end-to-end latencies can be determined compared to state-of-the-art.
    Original languageUndefined
    Title of host publicationIEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2016
    Place of PublicationUSA
    PublisherIEEE Computer Society
    Number of pages12
    ISBN (Print)978-1-4673-8639-5
    Publication statusPublished - 14 Apr 2016

    Publication series

    PublisherIEEE Computer Society


    • EWI-27005
    • IR-100362
    • METIS-316921

    Cite this