Change search
ReferencesLink to record
Permanent link

Direct link
Schedulability-Driven Partitioning and Mapping for Multi-Cluster Real-Time Systems
Linköping University, Sweden.ORCID iD: 0000-0003-1768-6697
2004 (English)Conference paper (Refereed)
Abstract [en]

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 characteristic to multi-clusters: partitioning of the system functionality into time-triggered and event-triggered domains, and mapping of processes onto architecture nodes. We present a branch-and-bound algorithm for solving these problems. Our algorithm 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.

Place, publisher, year, edition, pages
IEEE , 2004. 91-100 p.
, Proceedings - Euromicro Conference on Real-Time Systems, ISSN 1068-3070
National Category
Mechanical Engineering
URN: urn:nbn:se:kth:diva-179570ISI: 000222970300010ScopusID: 2-s2.0-5744222417OAI: diva2:884871
16th Euromicro Conference on Real- Time Systems, Catania, Sicily, Italy.

QC 20160122

Available from: 2015-12-17 Created: 2015-12-17 Last updated: 2016-01-22Bibliographically approved

Open Access in DiVA

No full text


Search in DiVA

By author/editor
Izosimov, Viacheslav
Mechanical Engineering

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 7 hits
ReferencesLink to record
Permanent link

Direct link