The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - November (1998 vol.9)
pp: 1125-1136
ABSTRACT
<p><b>Abstract</b>—Many embedded computing systems are distributed systems: communicating processes executing on several CPUs/ASICs. This paper describes a performance analysis algorithm for a set of tasks executing on a heterogeneous distributed system. Tight bounds are essential to the synthesis and verification of application-specific distributed systems, such as embedded computing systems. Our bounding algorithms are valid for a general problem model: The system can contain several tasks with hard real-time deadlines and different periods; each task is partitioned into a set of processes related by data dependencies. The periods of tasks and the computation times of processes are not necessarily constant and can be specified by a lower bound and an upper bound. Such a model requires a more sophisticated algorithm, but leads to more accurate results than previous work. Our algorithm both provides tighter bounds and is faster than previous methods.</p>
INDEX TERMS
Embedded systems, distributed systems, real-time systems, performance analysis, periodic tasks
CITATION
Ti-Yen Yen, Wayne Wolf, "Performance Estimation for Real-Time Distributed Embedded Systems", IEEE Transactions on Parallel & Distributed Systems, vol.9, no. 11, pp. 1125-1136, November 1998, doi:10.1109/71.735959
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool