An Algorithm of Scheduling Analysis for Distributed Real-Time Embedded Systems

Aiming at the deficiencies of existing scheduling analysis algorithms, we present a scheduling analysis algorithm for distributed real-time embedded systems. The algorithm uses relative firing domain to decide whether the transitions of scheduling sequence are scheduled. The relative executing time of parallel transition is recorded by introducing parallel space. The correct results of scheduling analysis can be obtained by taking space as executing time of parallel transition.