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

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedings – Annual report year: 2004Researchpeer-review

View graph of relations

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
Title of host publication16th Euromicro Conference on Real-Time Systems
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

ID: 2863561