Pointers versus Arithmetic in PRAMs

  title={Pointers versus Arithmetic in PRAMs},
  author={Patrick W. Dymond and Faith Ellen and Naomi Nishimura and Prabhakar Ragde and Walter L. Ruzzo},
  journal={J. Comput. Syst. Sci.},
Manipulation of pointers in shared data structures is an important communication mechanism used in many parallel algorithms. Indeed, many fundamental algorithms do essentially nothing else. Aparallel pointer machine(or PPM) is a parallel model having pointers as its principal data type. PPMs have been characterized as PRAMs obeying two restrictions?first, restricted arithmetic capabilities and, second, the CROW memory access restriction (concurrent read, owner write, a commonly occurring… 

Figures from this paper

Time-Space Tradeoffs and Query Complexity in Statistics, Coding Theory, and Quantum Computing
Time-Space Tradeoffs and Query Complexity in Statistics, Coding Theory, and Quantum Computing


Pointers versus arithmetic in PRAMs
Results concerning the relative power of PPMs (and other arithmetically restricted PRAMs) versus CROW PR AMs having ordinary arithmetic capabilities are presented and lower bounds separating P PMs from CROWPRAMs are proved.
Parallel RAMs with Owned Global Memory and Deterministic Context-Free Language Recognition (Extended Abstract)
The characterization theorem is based on a new and simpler proof of a result due to Klein and Reif that the recognition problem for any deterministic context free language can be solved in time O(logn) on a CREW-PRAM, and the simulation can actually be carried out on the CROW- PRAM model.
Relations between concurrent-write models of parallel computation
By fixing the number of processors and parametrizing theNumber of shared memory cells, tight separation results between the models are obtained, thereby partially answering open questions of Vishkin [V].
Towards understanding exclusive read
This paper describes a natural Boolean function of n variables and shows that the expected running time of any probabilistic ERow PRAM computing this function is in fl(,Cqo~'~), although it can be computed by a CROW PRAM in O(loglogn) steps.
The power of parallel pointer manipulation
This paper proves tile equivalence of HMM's and a restricted version of the PRAM, which is stripped of ar i thmetic capabilities except for the successor (+1) and doubling (x2) operations, and which observes a certMn very naturM restriction on writes to global memory, the turnerwrite restriction, below.
Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution
A lower bound on the time required by the ROBUST PRAM to compute Boolean functions in terms of the number of different values each memory cell of the PRAM can contain and the degree of the function when expressed as a polynomial over a finite field is proved.
On pointers versus addresses
This work addresses the problem of random access to memory by studying the simulation of random addressing by a machine which lacks it, a “pointer machine”, and formalizes the formalization of incompressibility for general data types.
Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
It is shown that even if the authors allow nonuniform algorithms, an arbitrary number of processors, and arbitrary instruction sets, $\Omega (\log n)$ is a lower bound on the time required to compute various simple functions, including sorting n keys and finding the logical “or” of n bits.
Sorting on a parallel pointer machine with applications to set expression evaluation
This work presents optimal algorithms for sorting on parallel CREW and EREW versions of the pointer machine model based on a parallel mergesort using linked lists rather than arrays, and shows how to exploit the “locality” of the approach to solve the set expression evaluation problem.
Data-Independences of Parallel Random Access Machines
A PRAM model with in some sense built-in data-independence is introduced and proposed as a tool for the development of data-independent parallel algorithms.