Schedulability-Driven Frame Packing for Multi-Cluster Distributed Embedded Systems
ACM Transactions on Embedded Computing Systems, Vol. 4, No. 1, February 2005, pp. 112-140
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 the end-to-end message communication constraints are satisfied. We have proposed a schedulability analysis for applications consisting of mixed event-triggered and timetriggered 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.
|tecs04.pdf||Adobe Acrobat portable document|
|tecs04.ps.gz||postscript document, compressed (with gzip)|
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.
[PEP04] Paul Pop, Petru Eles, Zebo Peng, "Schedulability-Driven Frame Packing for Multi-Cluster Distributed Embedded Systems", ACM Transactions on Embedded Computing Systems, Vol. 4, No. 1, February 2005, pp. 112-140