Some practical simulations of impractical parallel computers (Q1100882)
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: Some practical simulations of impractical parallel computers |
scientific article; zbMATH DE number 4045118
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some practical simulations of impractical parallel computers |
scientific article; zbMATH DE number 4045118 |
Statements
Some practical simulations of impractical parallel computers (English)
0 references
1987
0 references
Many popular theoretical models of parallel computers suffer the drawback of being highly impractical. The aim of this paper is to examine simulations of two impractical parallel machine models (shared memory machines and networks of sequential processors) by two more practical models (uniform circuits and feasible networks). We give a single basic simulation theorem which epitomizes a number of related results in this area.
0 references
formal models of parallel computers
0 references
simulation of parallel machine models
0 references
theorem
0 references
simulation theorem
0 references
