Analysis of real-time parallel programs using source-level timing schema

The paper introduces deterministic timing schema or formulae for predicting the best and worst case execution times of real time parallel programs. Timing schema (J. Kim and A.C. Shaw; H.R. Callison and A.C. Shaw) are formulae based on source program elements to calculate the execution time of programs. The total execution time is computed from the schema provided for a variety of parallel program constructs in distributed message passing systems as well as using remote procedure calls. As an initial attempt to validate the proposition, we have conducted a series of experiments on a distributed memory multiprocessor system based on transputer nodes. We present deterministic timing schema for a variety of Occam constructs and test them for their validity with real systems in the parallel processing. An automated program for the determination of timing schema for parallel programs has been developed, which gives quite tolerable predictions.