On maximally parallel schemata

  • Authors:
  • Robert M. Keller

  • Affiliations:
  • -

  • Venue:
  • SWAT '70 Proceedings of the 11th Annual Symposium on Switching and Automata Theory (swat 1970)
  • Year:
  • 1970

Quantified Score

Hi-index 0.01

Visualization

Abstract

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.