BibTeX
@MISC{Rossmanith91theowner,
author = {Peter Rossmanith},
title = {The Owner Concept for PRAMs},
year = {1991}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We analyze the owner concept for PRAMs. In OROW-PRAMs each memory cell has one distinct processor that is the only one allowed to write into this memory cell and one distinct processor that is the only one allowed to read from it. By symmetric pointer doubling, a new proof technique for OROW-PRAMs, it is shown that list ranking can be done in O(log n) time by an OROWPRAM and that LOGSPACE ` OROW-TIME(log n). Then we prove that OROW-PRAMs are a fairly robust model and recognize the same class of languages when the model is modified in several ways and that all kinds of PRAMs intertwine with the NC -hierarchy without timeloss. Finally it is shown that EREWPRAMs can be simulated by OREW-PRAMs and ERCW-PRAMs by ORCW-PRAMs. 3 This research was partially supported by the Deutsche Forschungsgemeinschaft, SFB 342, Teilprojekt A4 "Klassifikation und Parallelisierung durch Reduktionsanalyse" y E-mail: rossmani@lan.informatik.tu-muenchen.dbp.de Introduction Fortune and Wyllie introduced in...
