PATH SEARCHING IN SWITCHING NETWORKS USING CELLULAR ALGORITHM.

L. Kóczy, Jozsef Langer, Tamas Legendi

Research output: Contribution to journalArticle

Abstract

After a survey of the important statements in the paper ″A mathematical model of path searching in general type switching networks″ which appeared in an earlier issue of the journal, this paper treats with possible implementation of the algorithm introduced there for cellular automata. The cellular field employed consists of 5 neighboring 8-state cells. A comparison of running times required by a traditional serial processor and by the cellular field is presented. It shows that by parallel processing this running time can be reduced to a fraction.

Original languageEnglish
Pages (from-to)89-101
Number of pages13
JournalPeriodica Polytechnica, Electrical Engineering
Volume25
Issue number2
Publication statusPublished - 1981

Fingerprint

Switching networks
Cellular automata
Mathematical models
Processing

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

PATH SEARCHING IN SWITCHING NETWORKS USING CELLULAR ALGORITHM. / Kóczy, L.; Langer, Jozsef; Legendi, Tamas.

In: Periodica Polytechnica, Electrical Engineering, Vol. 25, No. 2, 1981, p. 89-101.

Research output: Contribution to journalArticle

Kóczy, L. ; Langer, Jozsef ; Legendi, Tamas. / PATH SEARCHING IN SWITCHING NETWORKS USING CELLULAR ALGORITHM. In: Periodica Polytechnica, Electrical Engineering. 1981 ; Vol. 25, No. 2. pp. 89-101.
@article{2f555f426daf4963b976faf3175860b6,
title = "PATH SEARCHING IN SWITCHING NETWORKS USING CELLULAR ALGORITHM.",
abstract = "After a survey of the important statements in the paper ″A mathematical model of path searching in general type switching networks″ which appeared in an earlier issue of the journal, this paper treats with possible implementation of the algorithm introduced there for cellular automata. The cellular field employed consists of 5 neighboring 8-state cells. A comparison of running times required by a traditional serial processor and by the cellular field is presented. It shows that by parallel processing this running time can be reduced to a fraction.",
author = "L. K{\'o}czy and Jozsef Langer and Tamas Legendi",
year = "1981",
language = "English",
volume = "25",
pages = "89--101",
journal = "Periodica polytechnica Electrical engineering and computer science",
issn = "2064-5260",
publisher = "Budapest University of Technology and Economics",
number = "2",

}

TY - JOUR

T1 - PATH SEARCHING IN SWITCHING NETWORKS USING CELLULAR ALGORITHM.

AU - Kóczy, L.

AU - Langer, Jozsef

AU - Legendi, Tamas

PY - 1981

Y1 - 1981

N2 - After a survey of the important statements in the paper ″A mathematical model of path searching in general type switching networks″ which appeared in an earlier issue of the journal, this paper treats with possible implementation of the algorithm introduced there for cellular automata. The cellular field employed consists of 5 neighboring 8-state cells. A comparison of running times required by a traditional serial processor and by the cellular field is presented. It shows that by parallel processing this running time can be reduced to a fraction.

AB - After a survey of the important statements in the paper ″A mathematical model of path searching in general type switching networks″ which appeared in an earlier issue of the journal, this paper treats with possible implementation of the algorithm introduced there for cellular automata. The cellular field employed consists of 5 neighboring 8-state cells. A comparison of running times required by a traditional serial processor and by the cellular field is presented. It shows that by parallel processing this running time can be reduced to a fraction.

UR - http://www.scopus.com/inward/record.url?scp=0019686150&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0019686150&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0019686150

VL - 25

SP - 89

EP - 101

JO - Periodica polytechnica Electrical engineering and computer science

JF - Periodica polytechnica Electrical engineering and computer science

SN - 2064-5260

IS - 2

ER -