<E-385> by

<E-18> Karp and Miller's computation graphs have been widely studied because they are a useful<E-412> abstraction of multiprocessor computation. A system has the determinacy property if whenever the<E-471> same set of input streams is entered into the system the resultant output is the same set of output<E-439> streams. Karp and Miller showed that computation graphs have this property; Woo, Smith, and<E-454> Agrawala showed that data flow schema, a generalization of computation graphs, also have the<E-451> property of determinacy. An earlier paper, coauthored by this author, defined the multiple<E-404> component system model (MCSM), a more general model with the determinacy property, and<E-443> proved some properties about deadlocking MSCMs. This paper investigates the asymptotic<E-399> behavior of MCSMs which do not deadlock. 2<E-249> 1. INTRODUCTION<E-54> Karp and Miller [1] introduced computation graphs, which led to the well known data flow model<E-450> for programming networks..