On totalistic systolic networks
type: Item
instance of: scholarly article
title: On totalistic systolic networks
zbMATH Open document ID: 0654.68058
DOI: 10.1016/0020-0190(88)90145-7
author: Karel II Culik
author: Juhani Karhumäki
published in: Information Processing Letters
publication date: 1988-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 68Q80
Mathematics Subject Classification ID: 94C15
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 4068288
zbMATH Keywords: totalistic network
zbMATH Keywords: cellular automaton
zbMATH Keywords: graph coloring
zbMATH Keywords: systolic network
MaRDI profile type: Publication
full work available at URL: 0020-0190(88)90145-7
OpenAlex ID: W1983501217
cites work: Q3802629
cites work: Topological transformations as a tool in the design of systolic networks
cites work: On the computational power of totalistic cellular automata
cites work: Q4190126
cites work: Q3326832
cites work: Computation theory of cellular automata
cites work: Q3675526
description: scientific article; zbMATH DE number 4068288