This Article 
 Bibliographic References 
 Add to: 
Determinacy of Generalized Schema
June 1992 (vol. 41 no. 6)
pp. 776-779

R.M. Karp and R.E. Miller's (1966) computation graphs have been widely studied because they are a useful abstraction of multiprocessor computation. A system has the determinacy property if whenever the same set of input streams are entered into the system, the resultant output is the same set of output streams. Karp and Miller showed that computation graphs have this property; N.S. Woo et al. (1984) showed that dataflow schema also have the property of determinacy. A more general model than either of the foregoing, called a multiple component system model (MCSM), is presently defined. It is proved that MCSMs have the determinacy property. Deadlocking is then defined, and some additional properties of deadlocking MCSMs are proved.

[1] R. M. Karp and R. E. Miller, "Properties of a model for parallel computations: Determinacy, termination, queueing,"SIAM J. Appl. Math, vol. 14, no. 6, pp. 1390-1411, 1966.
[2] N. S. Woo, C. H. Smith, and A. Agrawala, "A proof of the determinacy property of the data flow schema,"Inform. Processing Lett., vol. 19, pp. 13-16, 1984.
[3] R. M. Karp and R. E. Miller, "Parallel program schemata,"J. Comput. Syst. Sci., vol. 3, pp. 147-195, 1969.

Index Terms:
generalized schema; computation graphs; multiprocessor computation; determinacy; multiple component system model; deadlocking; graph theory; multiprocessing systems.
R.S. Stevens, D.J. Kaplan, "Determinacy of Generalized Schema," IEEE Transactions on Computers, vol. 41, no. 6, pp. 776-779, June 1992, doi:10.1109/12.144630
Usage of this product signifies your acceptance of the Terms of Use.