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

Paul Pop; Petru Eles; Zebo Peng

doi:10.1109/EMRTS.2004.1311010

Abstract

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 language	English
Publication date	2004
DOIs	https://doi.org/10.1109/EMRTS.2004.1311010
Publication status	Published - 2004
Event	16th Euromicro Conference on Real-Time Systems - Catania, Italy Duration: 30 Jun 2004 → 2 Jul 2004 Conference number: 16 http://www.diit.unict.it/ecrts2004/

Conference

Conference	16th Euromicro Conference on Real-Time Systems
Number	16
Country/Territory	Italy
City	Catania
Period	30/06/2004 → 02/07/2004
Internet address	http://www.diit.unict.it/ecrts2004/

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.

Access to Document

10.1109/EMRTS.2004.1311010

Pop ecrts04Final published version, 204 KB
Pop ecrts04Final published version, 800 KB
Pop ecrts04Final published version, 2.21 MB
Pop ecrts04Final published version, 306 KB

OpenUrl availability

Full text

Cite this

@conference{0e2ebee76ac045669a0d9e86dcee4470,

title = "Schedulability-Driven Partitioning and Mapping for Multi-Cluster Real-Time Systems",

abstract = "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.",

author = "Paul Pop and Petru Eles and Zebo Peng",

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.; 16th Euromicro Conference on Real-Time Systems, ECRTS 04 ; Conference date: 30-06-2004 Through 02-07-2004",

year = "2004",

doi = "10.1109/EMRTS.2004.1311010",

language = "English",

url = "http://www.diit.unict.it/ecrts2004/",

}

TY - ABST

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

AU - Pop, Paul

AU - Eles, Petru

AU - Peng, Zebo

N1 - Conference code: 16

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

U2 - 10.1109/EMRTS.2004.1311010

DO - 10.1109/EMRTS.2004.1311010

M3 - Conference abstract for conference

T2 - 16th Euromicro Conference on Real-Time Systems

Y2 - 30 June 2004 through 2 July 2004

ER -