Abstract
We present an approach to frame packing for multi-cluster distributed embedded systems consisting of time-triggered and event-triggered clusters, interconnected via gateways. In our approach, the application messages are packed into frames such that the application is schedulable. Thus, we have also proposed a schedulability analysis for applications consisting of mixed event-triggered and time-triggered processes and messages, and a worst case queuing delay analysis for the gateways, responsible for routing inter-cluster traffic. Optimization heuristics for frame packing aiming at producing a schedulable system have been proposed. Extensive experiments and a real-life example show the efficiency of our frame-packing approach.
| Original language | English |
|---|---|
| Journal | ACM SIGPLAN Notices |
| Volume | 38 |
| Issue number | 7 |
| Pages (from-to) | 113-122 |
| ISSN | 0362-1340 |
| DOIs | |
| Publication status | Published - 2003 |
| Event | Association-for-Computing-Machinery SIGPLAN Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES 03) - San Diego, (CA), United States Duration: 11 Jun 2003 → 13 Jun 2003 |
Conference
| Conference | Association-for-Computing-Machinery SIGPLAN Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES 03) |
|---|---|
| Country/Territory | United States |
| City | San Diego, (CA) |
| Period | 11/06/2003 → 13/06/2003 |
Bibliographical note
Copyright note for papers published by ACM: Permission to make digital or hard copies of this work for personal or classroom use is granted without fee provided that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers or to distribute to lists, requires prior specific permission and/or a fee.Keywords
- Algorithms
- Performance
- Design
- Theory
- Frame packing
- Schedulability analysis
- Multi-clusters