Limits on the power of concurrent-write parallel machines (Q1103403): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0890-5401(88)90040-5 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2061503133 / rank | |||
Normal rank |
Revision as of 20:48, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Limits on the power of concurrent-write parallel machines |
scientific article |
Statements
Limits on the power of concurrent-write parallel machines (English)
0 references
1988
0 references
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.
0 references
concurrent-read-concurrent-write parallel RAM
0 references
function of Boolean inputs
0 references
polynomial number of processors
0 references
integer addition
0 references
parity
0 references