On saving space in parallel computation (Q1114403): 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/0020-0190(88)90233-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W137867423 / rank | |||
Normal rank | |||
Revision as of 02:04, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On saving space in parallel computation |
scientific article |
Statements
On saving space in parallel computation (English)
0 references
1988
0 references
The literature on parallel computing describes a number of algorithms whose space requirements exceed their time-processor product. Generalizing an idea by \textit{R. Cole} and \textit{U. Vishkin} [Approximate parallel scheduling II, Preprint (1987)] and combining it with a well known trick for avoiding initialization of memory areas, we show that in the CRCW PRAM model of computation, such anomalies can always be kept within bounds.
0 references
parallel algorithm
0 references
space requirements
0 references
CRCW PRAM model of computation
0 references
