Faith E. Fich  Home/Search
Context Related
| cs.utoronto.ca/~fich/PRAMsurvey.ps 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: cs.utoronto.ca/~fich/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: PRAMs also approximate the situation where communication to and from shared memory is much more expensive than local operations, for example, where each processor is located on a separate chip and access to shared memory is through a combining network. Not surprisingly, abstract PRAMs can be much more powerful than restricted instruction set PRAMs. THEOREM 21.16 Any function of n variables can be computed by an abstract EROW PRAM in O(log n) steps using n= log 2 n processors and n=2 log 2 n... (Update)
Context of citations to this paper: More
...for any #. Sensitivity can be used to obtain lower bounds for the CREW PRAM complexity of Boolean functions (see [25, 18, 19, 27, 32]) The average sensitivity of a function # can be defined equivalently as the sum of the influences of all variables on #, where the influence of...
...attempts to write to a given location, the processor with the highest priority succeeds. This model is known as the PRIORITY CRCW P RAM [18]. We adopt this model and simply refer to it as the P RAM. In the P RAM model any processor can access any global memory location in one...
Cited by: More
On the Power of Reading and Writing - Simultaneously In Parallel (Correct)
Relationships between Broadcast and Shared Memory in.. - Aspnes, Fich, Ruppert (2004) (Correct)
Switching Networks for Generating Random Permutations - Czumaj, Kanarek, Lorys.. (2001) (Correct)
Active bibliography (related documents): More All
1.1: Sensitive Functions and Approximate Problems - Shiva Chaudhuri.. (1993) (Correct)
0.9: Unknown - Information Processing Letters (Correct)
0.8: Information Broadcasting by Exclusive-Read Prams - Beame, al. (1992) (Correct)
Similar documents based on text: More All
0.3: Stand-Alone Hardware-Based Learning System - Trevor Clarkson And (Correct)
0.2: Generalization In Probabilistic RAM Nets - Dr Trevor Clarkson (1993) (Correct)
0.1: On the Harmonic Means of Branching Processes - Piau (Correct)
Related documents from co-citation: More All
13: Upper and lower time bounds for parallel random access machines without simultan.. (context) - Cook, Dwork et al. - 1986
8: The Complexity of Boolean Functions - - 1987
8: CREW PRAMs and decision trees (context) - Nisan - 1991
BibTeX entry: (Update)
Faith E. Fich. The complexity of computation on the Parallel Random Access Machine. In Synthesis of Parallel Algorithms, J.H. Reif (ed.) (Morgan Kaufmann, San Mateo, 1993) 843--899. http://citeseer.ist.psu.edu/fich93complexity.html More
@incollection{ fich93complexity,
author = "Fich",
title = "The Complexity of Computation on the Parallel Random Access Machine",
booktitle = "John H. Reif (Ed.), Synthesis of Parallel Algorithms, Morgan Kaufmann",
year = "1993",
url = "citeseer.ist.psu.edu/fich93complexity.html" }
Citations (may not include all citations):1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
218 Parallelism in random access machines (context) - Fortune, Wyllie - 1978
196 How to emulate shared memory (context) - Ranade - 1987
189 Algebraic methods in the theory of lower bounds for boolean .. (context) - Smolensky - 1987
112 Randomized and deterministic simulation of prams by parallel.. (context) - Mehlhorn, Vishkin - 1984
110 Ramsey Theory (context) - Graham, Rothschild et al. - 1980
102 A survey of parallel algorithms for shared-memory machines (context) - Karp, Ramachandran - 1990
100 Optimal bounds for decision problems on the CRCW PRAM (context) - Beame, Hastad - 1989
92 Constant depth reducibility (context) - Chandra, Stockmeyer et al. - 1984
75 and the polynomial-time hierarchy (context) - Furst, Saxe et al. - 1984
70 A complexity theory of efficient parallel algorithms (context) - Kruskal, Rudolph et al. - 1990
68 Computational Limitations for Small Depth Circuits (context) - Hastad - 1987
66 Data broadcasting in SIMD computers (context) - Nassimi, Sahni - 1981
62 Parallel computational geometry (context) - Aggarwal, Chazelle et al. - 1988
60 Generic oracles and oracle classes (context) - Blum, Impagliazzo - 1987
58 On relating time and space to size and depth (context) - Borodin - 1977
57 the degree of boolean functions as real polynomials - Nisan, Szegedy - 1992
48 A complexity theory based on boolean algebra (context) - Skyum, Valiant - 1985
46 A fast parallel algorithm for routing in permutation network.. (context) - Lev, Pippenger et al. - 1981
44 CREW PRAMS and decision trees (context) - Nisan - 1989
42 Time bounded random access machines (context) - Cook, Reckow - 1973
38 Simulation of parallel random access machines by circuits (context) - Stockmeyer, Vishkin - 1984
30 Parallel algorithmic techniques for combinatorial computing - Eppstein, Galil - 1988
28 Deterministic simulation of idealized parallel computers on .. (context) - Alt, Hagerup et al. - 1987
24 Optimal separations between concurrent-write parallel machin.. (context) - Boppana - 1989
23 Parallel RAMs with owned global memory and deterministic con.. - Dymond, Ruzzo - 1986
23 Bounding Fan-Out in Logical Networks (context) - Hoover, Klawe et al. - 1984
21 Upper and lower bounds for parallel random access machines w.. (context) - Cook, Dwork et al. - 1986
20 A unified approach to models of synchronous parallel machine.. (context) - Goldschlager - 1982
18 Lower bounds for parallel random access machines with read o.. (context) - Fich, Li et al. - 1989
18 Lower bounds for parallel random access machines with unboun.. (context) - Fich, auf et al. - 1987
15 tree parallel data structure (context) - Berkman, Vishkin - 1989
14 The complexity of parallel sorting (context) - auf, Wigderson - 1987
13 SIAM Journal on Computing (context) - Snir, searching - 1985
13 Algebraic Methods in Lower Bounds for Computational Models w.. (context) - Szegedy - 1989
13 Parallel computation and conflicts in memory access (context) - Kucera - 1982
13 Improved upper and lower time bounds for parallel random acc.. (context) - Parberry, Yan - 1991
13 Towards understanding exclusive read (context) - Fich, Wigderson - 1990
12 Every robust CRCW PRAM can efficiently simulate a PRIORITY P.. (context) - Hagerup, Radzik - 1990
12 Incomparability in parallel computation (context) - Grolmusz, Ragde - 1990
11 bound on the time for parallel RAM's to compute nondegenerat.. (context) - Simon, tight et al. - 1982
10 Intersecting line segments in parallel with an output-sensit.. (context) - Goodrich - 1989
10 Finding all nearest neighbors for convex polygons in paralle.. (context) - Schieber, Vishkin - 1990
9 Some doubly logarithmic optimal parallel algorithms based on.. (context) - Berkman, Schieber et al. - 1988
8 Lower Bounds in Parallel Machine Computation (context) - Beame - 1987
8 Exact time bounds for computing boolean functions on PRAMs w.. (context) - Dietzfelbinger, Kutylowski et al. - 1990
7 Lower bounds with smaller domain size on concurrent write pa.. (context) - Edmonds - 1991
6 New lower bounds for parallel computation (context) - Li, Yesha - 1989
6 or why is it difficult to separate (context) - Tardos
6 New lower bounds for parallel computation (context) - Li, Yesha - 1986
6 The tera computer system (context) - Smith - 1990
5 Data-movement-intensive problems: Two folk theorems in paral.. (context) - Akl, Cosnard et al. - 1990
5 Properties of complexity measures for PRAMs and WRAMs (context) - Bublitz, Schurfeld et al. - 1986
5 Tight bounds for the chaining problem (context) - Chaudhuri - 1991
5 Limits on the power of concurrent-write parallel machines (context) - Beame - 1988
4 Parallel RAMs with bounded memory wordsize (context) - Bellantoni - 1991
4 Parallel RAMs with bounded memory wordsize (context) - Bellantoni - 1988
4 RAM simulation with constant redundancy (context) - Hornick, Preparata - 1989
4 Efficient simulations between CRCW PRAMs (context) - Chelbus, Diks et al. - 1988
3 Simultaneous memory access (context) - Eckstein - 1979
3 Processor-time tradeoffs in PRAM simulations (context) - Ragde - 1992
2 The parallel complexity of element distinctness is (context) - Ragde, Steiger et al. - 1988
2 personal communication (context) - Rubinstein
2 personal communication (context) - Ruzzo
2 private communication (context) - Snir
1 Lower Bound Techniques (context) - Shiloach, Vishkin et al. - 1981
1 Complexity classes without machines: On complete sets for UP (context) - Hartmanis, Hemachandra - 1986
1 Limits to speed up parallel machines by large hardware and u.. (context) - auf, Reischuk - 1984
1 Simulations among between concurrent-write PRAMs (context) - Fich, Ragde et al. - 1988
1 Theoretical Computer Science (context) - Gafni, Naor et al. - 1989
1 The probabilistic and deterministic parallel complexity of s.. (context) - Li, Yesha - 1987
1 Lower bounds for parallel computation on linked structures (context) - Fich, Ramachandran - 1990
1 Programming Lang (context) - Schwartz, Trans - 1980
1 unpublished manuscript (context) - Ragde
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.utoronto.ca/~fich/): More
End-To-End Communication - Fich (1998) (Correct)
Optimal Bounds for the Predecessor Problem and Related Problems - Beame, Fich (Correct)
Tables Should Be Sorted (on Random Access Machines) - Fich, Miltersen (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