PERFORMANCE ESTIMATION FOR REAL-TIME DISTRIBUTED EMBEDDED SYSTEMS

Many embedded computing systems are distributed systems: communicating processes executing on several CPUs/ASICs. This paper describes a per formance analysis algorithm for a set of tasks executing on a heteroge neous 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 ge neral problem model: The system can contain several tasks with hard re al-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 a nd can be specified by a lower bound and an upper bound. Such a model requires a more sophisticated algorithm, but leads to more accurate re sults than previous work. Our algorithm both provides tighter bounds a nd is faster than previous methods.