ANALYSIS OF REAL-TIME PARALLEL PROGRAMS USING
Source-Level Timing Schema · 1997
This paper introduces deterministic timing schema or formulae for predicting the best and worst case execution times of real-time parallel programs. Timing schema [I]. 121 are formulac based on source program elements to calculate the execution time of’ programs. The total execution time is cotnputcd trom the schema provided for a variety of‘ putallel 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. In this paper, we have presented deterministic timing schema for a variety of Occam constructs and tested 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.