By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Dutta, S.K. ; Dept. of Comput. Sci. & Eng., Jadavpur Univ., Calcutta, India ; Saha, D. ; Das, P.K.

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

Published in:

TENCON '97. IEEE Region 10 Annual Conference. Speech and Image Technologies for Computing and Telecommunications., Proceedings of IEEE  (Volume:2 )

Date of Conference:

2-4 Dec 1997