Conference paper
Schedulability-Driven Partitioning and Mapping for Multi-Cluster Real-Time Systems
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.
| Language: | English |
|---|---|
| Year: | 2004 |
| Pages: | 91-100 |
| Proceedings: | 16th Euromicro Conference on Real-Time Systems |
| ISBN: | 0769521762 and 9780769521763 |
| ISSN: | 21593817 and 10683070 |
| Types: | Conference paper |
| DOI: | 10.1109/EMRTS.2004.1311010 |
| ORCIDs: | Pop, Paul |
Broadcasting Communication channels Communication system control Hardware Information science Joining processes Message passing Processor scheduling Real time systems Time division multiple access branch-and-bound algorithm delays embedded systems gateways intercluster traffic routing internetworking multiclusters multiprocessor interconnection networks processor scheduling queuing delay analysis real-time systems schedulability analysis system mapping system partitioning tree searching
