Limits on the power of concurrent-write parallel machines
type: Item
instance of: scholarly article
title: Limits on the power of concurrent-write parallel machines
zbMATH Open document ID: 0645.68060
DOI: 10.1016/0890-5401(88)90040-5
published in: Information and Computation
publication date: 1988-01-01T00:00:00Z
review text: The computation of specific functions using the most general form of concurrent-read-concurrent-write parallel RAM is considered. It is shown that such a machine can compute any function of Boolean inputs in time log n-\(\log \log n+O(1)\) given a polynomial number of processors and memory cells and that this bound is tight for integer addition. Despite this evidence of the power of the model we show that a very simple function, namely parity, requires time \(\Omega\) (\(\sqrt{\log n})\) to compute given a polynomial bound on the number of processors, independent of the number of memory cells.
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68N25
zbMATH DE Number: 4053025
zbMATH Keywords: concurrent-read-concurrent-write parallel RAM
zbMATH Keywords: function of Boolean inputs
zbMATH Keywords: polynomial number of processors
zbMATH Keywords: integer addition
zbMATH Keywords: parity
author: Paul Beame
MaRDI profile type: Publication
full work available at URL: 0890-5401(88)90040-5
OpenAlex ID: W2061503133
cites work: \(\Sigma_ 1^ 1\)-formulae on finite structures
cites work: Constant Depth Reducibility
cites work: Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
cites work: Parity, circuits, and the polynomial-time hierarchy
cites work: Parallel computation and conflicts in memory access
cites work: Q3746884
cites work: Q4172915
cites work: On Parallel Searching
cites work: Simulation of Parallel Random Access Machines by Circuits
cites work: Trade-Offs between Depth and Width in Parallel Computation
description: scientific article; zbMATH DE number 4053025