Composability and Predictability for Independent Application Development, Verification, and Execution

Benny Akesson, Anca Molnos, A. Hansson, Jude Ambrose Angelo, Kees Goossens

    Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

    34 Citations (Scopus)


    System-on-chip (soc) design gets increasingly complex, as a growing number of applications are integrated in modern systems. Some of these applications have real-time requirements, such as a minimum throughput or a maximum latency. To reduce cost, system resources are shared between applications, making their timing behavior inter-dependent. Real-time requirements must hence e verified for all possible combinations of concurrently executing applications, which is not feasible with commonly used simulation-based techniques. This chapter addresses this problem using two complexity-reducing concepts: composability and predictability. Applications in a composable system are completely isolated and cannot affect each other's behaviors, enabling them to be independently verified. Predictable systems, on the other hand, provide lower bounds on performance, allowing applications to be verified using formal performance analysis. Five techniques to achieve composability and/or predictability in soc resources are presented and we explain their implementation for processors, interconnect, and memories in our platform.
    Original languageUndefined
    Title of host publicationMultiprocessor System-on-Chip
    EditorsMichael Hübner, Jürgen Becker
    Place of PublicationLondon
    Number of pages32
    ISBN (Print)978-1-4419-6459-5
    Publication statusPublished - Nov 2010

    Publication series

    NameCircuits & Systems
    PublisherSpringer Verlag


    • METIS-276188
    • Multi-Processor System
    • Composability
    • Arbitration
    • EWI-18983
    • Predictability
    • Resource Management
    • Real Time
    • IR-76026

    Cite this