Skip to main content


eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item:
Title: Parallelism in Random Access Machines
Authors: Fortune, Steven
Wyllie, James C.
Keywords: computer science
technical report
Issue Date: Jan-1978
Publisher: Cornell University
Abstract: A model of computation based on random access machines operating in parallel and sharing a common memory is presented. The computational power of this model is related to that of traditional models. In particular, deterministic parallel RAM's can accept in polynomial time exactly the sets accepted by polynomial tape bounded Turing machines; nondeterministic RAM's can accept in polynomial time exactly the sets accepted by nondeterministic exponential time bounded Turing machines. Similar results hold for other classes. The effect of limiting the size of the common memory is also considered.
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
78-334.pdf787.39 kBAdobe PDFView/Open
78-334.ps236.14 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.


© 2014 Cornell University Library Contact Us