On totalistic systolic networks (Q1108796)
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: On totalistic systolic networks |
scientific article; zbMATH DE number 4068288
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On totalistic systolic networks |
scientific article; zbMATH DE number 4068288 |
Statements
On totalistic systolic networks (English)
0 references
1988
0 references
A systolic network is an array of synchronized processors. It is totalistic if the states of its processors are integers and the next state of each processor is determined by the sum of all the states in its neighborhood including its own. Our main result is that every uniform regular network can be simulated by a totalistic systolic network.
0 references
totalistic network
0 references
cellular automaton
0 references
graph coloring
0 references
systolic network
0 references
0.7675676345825195
0 references
0.7321601510047913
0 references
