Deterministic timing schema for parallel programs

Formula or schema for computing the best and worst case execution times of a variety of parallel program constructs are presented. Timing schema are proposed for processes that do not interact but synchronize at their start and end, for shared variable interactions through critical sections and general semaphores, and for distributed message passing and remote procedure call. Also included are representative implementations that obey the schema. In addition various forms of underlying hardware contentions and indeterminacies are discussed, including how to incorporate some of these. It is concluded that predictable timing behavior in concurrent systems is indeed a possibility using the schema approach