Running ASCEND, DESCEND and PIPELINE algorithms in parallel using small processors (Q1210315)
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: Running ASCEND, DESCEND and PIPELINE algorithms in parallel using small processors |
scientific article; zbMATH DE number 178055
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Running ASCEND, DESCEND and PIPELINE algorithms in parallel using small processors |
scientific article; zbMATH DE number 178055 |
Statements
Running ASCEND, DESCEND and PIPELINE algorithms in parallel using small processors (English)
0 references
23 May 1993
0 references
We propose a scheme for generating addresses using ``small'' processors. We use this scheme to show that a large class of parallel algorithms (of size \(n\)) can be run (without overheads in time) using \(n\) processors (each of wordsize \(\Omega(\log\log\log n)\) bits) and \(\text{poly}(n)\) memory, where \(\text{poly}(n)\) is \(O(n^ c)\), for constant \(c\). Though the word size of the processors still increases with the number of processors used, it does so extremely slowly.
0 references
address generation
0 references
ASCEND and DESCEND algorithms
0 references
PIPELINE algorithms
0 references
