Schedulability-Driven Partitioning and Mapping for Multi-Cluster Real-Time Systems

Paul Pop, Petru Eles, Zebo Peng

    Research output: Contribution to conferenceConference abstract for conferenceResearchpeer-review

    708 Downloads (Pure)


    We present an approach to partitioning and mapping for multi-cluster embedded systems consisting of time-triggered and event-triggered clusters, interconnected via gateways. We have proposed a schedulability analysis for such systems, including a worst-case queuing delay analysis for the gateways, responsible for routing inter-cluster traffic. Based on this analysis, we address design problems which are characteristic to multi-clusters: partitioning of the system functionality into time-triggered and event-triggered domains, and process mapping. We present a branch and bound algorithm for solving these problems. Our heuristic is able to find schedulable implementations under limited resources, achieving an efficient utilization of the system. The developed algorithms are evaluated using extensive experiments and a real-life example.
    Original languageEnglish
    Publication date2004
    Publication statusPublished - 2004
    Event16th Euromicro Conference on Real-Time Systems - Catania, Italy
    Duration: 30 Jun 20042 Jul 2004
    Conference number: 16


    Conference16th Euromicro Conference on Real-Time Systems
    Internet address

    Bibliographical note

    Copyright note for papers published by the IEEE Computer Society: Copyright 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.


    Dive into the research topics of 'Schedulability-Driven Partitioning and Mapping for Multi-Cluster Real-Time Systems'. Together they form a unique fingerprint.

    Cite this