On saving space in parallel computation (Q1114403)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1114403 |
scientific article; zbMATH DE number 4082978
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On saving space in parallel computation |
scientific article; zbMATH DE number 4082978 |
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
0.793478786945343
0 references
0.774908721446991
0 references
0.7719587683677673
0 references
0.7707370519638062
0 references
