Analysis and Synthesis of Dynamic Multicomputer Networks that Reconfigure into Rings, Trees, and Stars
Issue No. 07 - July (1987 vol. 36)
S.P. Kartashev , Dynamic Computer Architecture, Inc.
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.
stars?single and multirooted, Binary tree?single and multirooted, composite ring structures, reconfiguration code, reconfiguration of dynamic multicomputer networks, ring period, set of rings, shift- register theory, shift register with variable bias, single ring structures
S. Kartashev and S. Kartashev, "Analysis and Synthesis of Dynamic Multicomputer Networks that Reconfigure into Rings, Trees, and Stars," in IEEE Transactions on Computers, vol. 36, no. , pp. 823-844, 1987.