Faith E. Fich University of Toronto/MIT Russell Impagliazzo UCSD Bruce Kapron ...  Home/Search
Context Related
| unipaderborn.de/fachber...mkut19.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: unipaderborn.de/fa...papers.Kuty (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The ROBUST PRAM is a concurrent-read concurrent-write (CRCW) parallel random access machine in which any value might appear in a memory cell as a result of a write conflict. This paper addresses the question of whether a PRAM with such a weak form of write conflict resolution can compute functions faster than the concurrent-read exclusive-write (CREW) PRAM. We prove a lower bound on the time required by the ROBUST PRAM to compute Boolean functions in terms of the number of different values each ... (Update)
Context of citations to this paper: More
...in the array which correspond to input values, and find the rightmost one in O(log log s) time. 2 Using an algorithm similar to one in [23], we obtain the following result for finding the maximum of binary inputs (i.e. the global OR) on a Robust ERCW PRAM. Theorem 5.5 An n=...
...in the array which correspond to input values, and find the rightmost one in O(log log n) time. 2 Using an algorithm similar to one in [16], we obtain the following result for finding the maximum of binary inputs (i.e. the global OR) on a Robust ERCW PRAM. Theorem 4.5 An n=...
Cited by: More
ERCW PRAMs and Optical Communication - MacKenzie, Ramachandran (1996) (Correct)
The wakeup problem in synchronous broadcast systems (Extended .. - Gasieniec, al. (2000) (Correct)
Complexity of Boolean Functions on PRAMs - Lower Bound Techniques - Kutylowski (Correct)
Similar documents (at the sentence level):
40.3%: Limits on the Power of Parallel Random Access.. - Fich.. (1993) (Correct)
Active bibliography (related documents): More All
0.3: Simple Fast Parallel Hashing by Oblivious Execution - Gil, Matias (Correct)
0.3: The Complexity of Computation on the Parallel Random Access Machine - Fich (1993) (Correct)
0.2: An Effective Load Balancing Policy for Geometric Decaying.. - Gil, Matias (1996) (Correct)
Similar documents based on text: More All
0.4: Retrieval of scattered information by EREW, CREW and CRCW.. - Fich, Kowaluk, Lorys, al. (1992) (Correct)
0.2: Efektywne Sieci Komparator Ow - Kik (Correct)
0.2: Approximate compaction and padded-sorting on CREW PRAMs - Kutylowski, Wierzbicki (Correct)
Related documents from co-citation: More All
5: Upper and lower time bounds for parallel random access machines without simultan.. (context) - Cook, Dwork et al. - 1986
5: Every robust CRCW PRAM can efficiently simulate a Priority PRAM (context) - Hagerup, Radzik - 1990
4: Relations between concurrent-write models of parallel computation (context) - Fich, Ragde et al. - 1984
BibTeX entry: (Update)
F. E. Fich, R. Impagliazzo, B. Kapron, V. King, and M. Kuty/lowski. Limits on the power of parallel random access machines with weak forms of write conflict resolution. In 10th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science. Springer-Verlag, 1993. http://citeseer.ist.psu.edu/article/fich93limits.html More
@inproceedings{ fich93limits,
author = "Faith E. Fich and Russell Impagliazzo and Bruce M. Kapron and Valerie King and Miroslaw Kutylowski",
title = "Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution",
booktitle = "Symposium on Theoretical Aspects of Computer Science",
pages = "386-397",
year = "1993",
url = "citeseer.ist.psu.edu/article/fich93limits.html" }
Citations (may not include all citations):218 Parallelism in Random Access Machines (context) - Fortune, Wyllie - 1978
189 Algebraic methods in the theory of lower bounds for Boolean .. (context) - Smolensky - 1987
94 Upper and Lower Time Bounds for Parallel Random Access Machi.. (context) - Cook, Dwork et al. - 1986
56 Relations Between Concurrent-Write Models of Parallel Comput.. (context) - Fich, Ragde et al. - 1988
30 Parallel Algorithmic Techniques for Combinatorial Computing - Eppstein, Galil - 1988
20 A Unified Approach to Models of Synchronous Parallel Machine.. (context) - Goldschlager - 1982
15 On Learning Ring-Sum-Expansions (context) - Fischer, Simon - 1990
13 Parallel Computation and Conflicts in Memory Access (context) - Kucera - 1982
12 Every Robust CRCW PRAM can Efficiently Simulate a PRIORITY P.. (context) - Hagerup, Radzik - 1990
12 Incomparability in Parallel Computation (context) - Grolmusz, Ragde - 1990
5 Observations Concerning Synchronous Parallel Models of Compu.. (context) - Borodin, Hopcroft et al. - 1980
2 Exact Time Bounds for Computing Boolean Functions without Si.. (context) - Dietzfelbinger, Kuty et al. - 1990
1 Retrieval of scattered information by EREW, CREW and CRCW PR.. - Fich, Kowaluk et al. - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.uni-paderborn.de/fachbereich/AG/agmadh/WWW/german/LehreKuty/papers.Kuty.html): More
COMPUTATIONAL POWER OF ONE-WAY MULTIHEAD FINITE AUTOMATA.. - Institute Of (Correct)
Fast Generation of Random Permutations via Networks.. - Czumaj, Kanarek.. (1998) (Correct)
Periodic Constant Depth Sorting Networks - Kik, Kutylowski, Stachowiak (1994) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC