Analysis and Synthesis of Dynamic Multicomputer Networks that Reconfigure into Rings, Trees, and Stars

Author

Kartashev, Svetlana P. ; Kartashev, Steven I.

Author_Institution

Dynamic Computer Architecture, Inc.

Issue

7

fYear

1987

fDate

7/1/1987 12:00:00 AM

Firstpage

823

Lastpage

844

Abstract

This paper presents analysis and synthesis techniques for multicomputer networks that perform fast reconfiguration into rings, stars, and trees. Each reconfiguration into a new network structure requires only two codes (reconfiguration code RC and bias B), and can be performed during one clock period. Because the reconfiguration methodology presented is based on some fine mathematical properties exhibited by special shift registers with variable bias (SRVB), they are also introduced in this paper.

Keywords

Binary tree—single and multirooted; composite ring structures; reconfiguration code; reconfiguration of dynamic multicomputer networks; ring period; set of rings; shift register with variable bias; shift- register theory; single ring structures; stars—single and multirooted; Catalogs; Clocks; Computer architecture; Computer networks; Multiprocessor interconnection networks; Network synthesis; Performance analysis; Shift registers; Sorting; Tree data structures; Binary tree—single and multirooted; composite ring structures; reconfiguration code; reconfiguration of dynamic multicomputer networks; ring period; set of rings; shift register with variable bias; shift- register theory; single ring structures; stars—single and multirooted;

fLanguage

English

Journal_Title

Computers, IEEE Transactions on

Publisher

ieee

ISSN

0018-9340

Type

jour

DOI

10.1109/TC.1987.1676979

Filename

1676979