Issue No. 06 - June (1991 vol. 40)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.90248
<p>A tree-based interconnection architecture (called KYKLOS) for multicomputer systems is proposed. While the general form of the topology consists of multiple m-ary trees sharing a common set of leaf nodes, the focus is on the dual-tree case. One version of the dual-tree KYKLOS involves a bottom tree where the ordering of descendants of nodes at every level is an m-way shuffle. This architecture provides fault tolerance and vastly improved properties over the simple double tree while retaining the simplicity and low fan-out of the m-ary tree. Different routing strategies are presented and network properties as a function of routing strategy are investigated. The O(N/sup 2/) congestion at the root of the m-ary tree is reduced to O(N/sup 1.5/) while average normalized communication latencies are decreased. Applications of this architecture to facilitate parallel input/output (I/O) access and parallel processing of database operations such as the relational join are studied.</p>
KYKLOS multicomputer network; interconnection strategies; properties; tree-based interconnection architecture; multiple m-ary trees; fault tolerance; routing; communication latencies; database operations; relational join; multiprocessor interconnection networks; performance evaluation.
R. Jenevein and B. Menezes, "The KYKLOS Multicomputer Network: Interconnection Strategies, Properties, and Applications," in IEEE Transactions on Computers, vol. 40, no. , pp. 693-705, 1991.