Real-time systems often consist of distributed periodic processes that
have critical timing constraints and share resources. This paper pres
ents a set of functions for predicting the timing characteristics of s
uch systems, assuming that they are specified using CaRT-Spec, a langu
age for describing processes and their resource requirements. The pape
r demonstrates the usefulness of the functions for guiding algorithms
that (1) statically assign processes to the computational nodes of par
allel computers or (2) adapt to changing environmental conditions by d
ynamic reassignment.