Analytical Derivation of Traffic Patterns in Shared Memory Architectures from Task Graphs

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

    283 Downloads (Pure)

    Abstract

    Task Graphs is a commonly used application model in research in computer-aided design tools for design space exploration of embedded systems, including system synthesis, scheduling and application mapping. These design tools need an estimate of the actual communication in the target system caused by the application modelled by the task graph. In this paper, we present a method for analytically deriving the worst-case traffic pattern when a task graph is mapped to a multiprocessor system-on-chip with a shared memory architecture. We describe the additionally needed information besides the dependencies in the task graph in order to derive the traffic pattern. Finally, we construct a simulator that we use to find the actual traffic pattern in a system and compare this to the derived pattern. Results show that our worst-case derivation overestimates the bandwidth by 9% for systems with small caches and between 32% and 52% for systems with large caches.
    Original languageEnglish
    Title of host publicationNORCHIP, 2009
    PublisherIEEE
    Publication date2009
    Pages1-4
    ISBN (Print)978-1-4244-4310-9
    ISBN (Electronic)978-1-4244-4311-6
    DOIs
    Publication statusPublished - 2009
    EventNORCHIP, 2009 -
    Duration: 1 Jan 2009 → …

    Conference

    ConferenceNORCHIP, 2009
    Period01/01/2009 → …

    Bibliographical note

    Copyright 2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

    Fingerprint Dive into the research topics of 'Analytical Derivation of Traffic Patterns in Shared Memory Architectures from Task Graphs'. Together they form a unique fingerprint.

    Cite this