You need JavaScript to view this

Theory of spatial networks

Journal Article:

Abstract

A new framework of synchronous parallel processing systems called spatial networks is examined, in which the family of all cellular automata is included perfectly. This framework is free from the two restrictions of cellular automata of which one is the finiteness of the set of states of a cell and the other is the countability of an array space. Throughout this article, the relationships between function and structure of spatial networks are considered. First, the necessary and sufficient condition for spatial networks to be uniformly interconnected is given. That for spatial networks to be finitely interconnected is also given with a topological approach. The characterization theorem of cellular automata comes from these results. Second, it is shown that finitely and uniformly interconnected linear spatial networks can be characterized by the convolution form. Last, the conditions for their global mappings to be injective or surjective are discussed. 10 references.
Authors:
Publication Date:
Jan 01, 1983
Product Type:
Journal Article
Reference Number:
EDB-86-012968
Resource Relation:
Journal Name: Technol. Rep. Iwate Univ.; (Japan); Journal Volume: 17
Subject:
99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; COMPUTER NETWORKS; PARALLEL PROCESSING; SYNCHRONIZATION; TOPOLOGY; MATHEMATICS; PROGRAMMING; 990200* - Mathematics & Computers
OSTI ID:
6189937
Research Organizations:
Iwate Univ., Morioka, Japan
Country of Origin:
Japan
Language:
English
Other Identifying Numbers:
Journal ID: CODEN: TIWUA
Submitting Site:
HEDB
Size:
Pages: 23-38
Announcement Date:
Jul 01, 1985

Journal Article:

Citation Formats

Watanabe, T. Theory of spatial networks. Japan: N. p., 1983. Web.
Watanabe, T. Theory of spatial networks. Japan.
Watanabe, T. 1983. "Theory of spatial networks." Japan.
@misc{etde_6189937,
title = {Theory of spatial networks}
author = {Watanabe, T}
abstractNote = {A new framework of synchronous parallel processing systems called spatial networks is examined, in which the family of all cellular automata is included perfectly. This framework is free from the two restrictions of cellular automata of which one is the finiteness of the set of states of a cell and the other is the countability of an array space. Throughout this article, the relationships between function and structure of spatial networks are considered. First, the necessary and sufficient condition for spatial networks to be uniformly interconnected is given. That for spatial networks to be finitely interconnected is also given with a topological approach. The characterization theorem of cellular automata comes from these results. Second, it is shown that finitely and uniformly interconnected linear spatial networks can be characterized by the convolution form. Last, the conditions for their global mappings to be injective or surjective are discussed. 10 references.}
journal = {Technol. Rep. Iwate Univ.; (Japan)}
volume = {17}
journal type = {AC}
place = {Japan}
year = {1983}
month = {Jan}
}