We investigate a certain model of synchronous parallelism. Syntax, semantics and complexity of programs within it are defined. We consider algorithmic properties of synchronous parallel programs in connection with sequential programs with arrays. The complexity theorem states that the class PP-time (polynomial-time bounded parallel languages) is equal to P-space (languages requiring polynomial amount of memory).
Department, Program, or Center
Computer Science (GCCIS)
Radziszowski, Stanislaw, "Logic and complexity of synchronous parallel computations" (1978). Colloquia Mathematica Societatis Janos Bolyai, vol. 26 (),Accessed from
RIT – Main Campus