On Maximally Parallel Schemata

Document Type

Conference Proceeding


Computer Science (HMC)

Publication Date



A model for parallel computation called a schema is presented. This model is similar to that presented in the recent work of Karp and Miller2. Section 1 presents a description of the model, and some results on the characterization of computations within it. Section 2 summarizes some results on determinacy and equivalence. Section 3 presents a formalization of the property of maximal parallelism in schemata. Several alternate characterizations are shown to be equivalent for certain classes. Section 4 presents results on the complexity of a maximally parallel schema equivalent to a given schema.

Rights Information

© 1970 Institute of Electrical and Electronics Engineers

Terms of Use & License Information

Terms of Use for work posted in Scholarship@Claremont.