Abstract

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).

Publication Date

1978

Comments

Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works in February 2014.

Document Type

Article

Department, Program, or Center

Computer Science (GCCIS)

Campus

RIT – Main Campus

Share

COinS