The Community for Technology Leaders
Green Image
Issue No. 06 - June (1992 vol. 41)
ISSN: 0018-9340
pp: 776-779
<p>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.</p>
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. , pp. 776-779, June 1992, doi:10.1109/12.144630
94 ms
(Ver 3.3 (11022016))