This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The KYKLOS Multicomputer Network: Interconnection Strategies, Properties, and Applications
June 1991 (vol. 40 no. 6)
pp. 693-705

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.

[1] D. P. Agrawalet al., "Evaluating the performance of multicomputer configurations,"IEEE Comput. Mag., vol. 19, pp. 23-37, May 1986.
[2] B. W. Arden and H. Lee, "A multi-tree structured network," inProc. COMP CON 78, Sept. 1978, pp. 201-210.
[3] E. Babb, "Implementing a relational database by means of specialized hardware,"ACM TODS, vol. 4, no. 1, pp. 1-29, Mar. 79.
[4] S. Bhatt and F. Leighton, "A framework for solving VLSI layout problems,"J. Comput. Syst. Sci., vol. 28, pp. 300-343, 1984.
[5] S. H. Bokhari, "On the mapping problem,"IEEE Trans. Comput., vol. C- 30, pp. 207-214, Mar. 1981.
[6] J. C. Browne, A. G. Dale, C. Leung, and R. M. Jenevein, "A parallel multistage I/O architecture with a self-managing disk cache for database management applications," inProc. Fourth Int. Workshop Database Machines, Mar. 1985, pp. 330-345.
[7] S. A. Browning, "Computations on a tree of processors," inProc. VLSI Conf., California Instit. Technol., Pasadena, CA, Jan. 22-24, 1979.
[8] Z. Cvetanovic, "The effect of problem partitioning, allocation, and granularity on the performance of multiple-processor systems,"IEEE Trans. Comput., vol. C-36, Apr. 1987.
[9] A. M. Despain and D. A. Patterson, "X-tree: A tree structured multiprocessor computer architecture," inProc. Fifth Int. Symp. Comput. Architecture, Apr. 1978, pp. 144-151.Comput. Architecture, pp. 21-28, Dec. 1973.
[10] D. Z. Duet al., "Minimal distance routing in KYKLOS," inProc. 1987 Int. Conf. Parallel Processing, Aug. 1987, pp. 546-549.
[11] T. Feng, "A survey of interconnection networks,"IEEE Comput. Mag., vol. 14, pp. 12-27, Dec. 1981.
[12] H. Friedman, "A design for (d,k) graphs,"IEEE Trans. Electron. Comput., vol. EC-15, pp. 253-254, 1966.
[13] L. R. Goke and G. J. Lipovski, "Banyan networks for partitioning multiprocessor systems," inProc. 1st Annu. Symp. Comput. Architecture, Dec. 1973, pp. 21-28.
[14] J. R. Goodman and C. H. Sequin, "Hypertree: A multiprocessor interconnection topology,"IEEE Trans. Comput., C-30, pp. 923-933, Dec. 1981.
[15] J. P. Hayes, "A graph model for fault-tolerant computing systems,"IEEE Trans. Comput., vol. C-25, pp. 875-884, Sept. 1976.
[16] D. K. Hsiao, "The impact of the interconnecting network on parallel database computers," inDatabase Machines and Knowledge Base Machines, M. Kitsuregawa and H. Tanaka, Eds. New York: Kluwer, 1988, pp. 216-224.
[17] K. Hwang and J. Ghosh, "Hypernet: A communication-efficient architecture for constructing massively parallel computers,"IEEE Trans. Comput., vol. C-36, pp. 1450-1466, Dec. 1987.
[18] M. Imaiet al., "The architecture and efficiency of DON: A combinatorial problem oriented multicomputer system," inProc. 4th Int. Conf. Distributed Comput. Syst., May 1974, pp. 174-182.
[19] R. Jenevein and B. Menezes, "KYKLOS: Low tide high flow" inProc. Sixth Int. Conf. Distributed Comput., May 1986, pp. 8-15.
[20] P. Kogge and H. Stone, "A parallel algorithm for the efficient solution of a general class of recurrence equations,"IEEE Trans. Comput., vol. C- 22, no. 8, pp. 786-792, Aug. 1973.
[21] D. H. Lawrie, "Access and alignment of data in an array processor,"IEEE Trans. Comput., vol. C-24, pp. 1145-1155, Dec. 1975.
[22] G. J. Lipovski, A. Goyal, and M. Malek, "Lookahead networks," inProc. AFIPS, vol. 51, June 1982, pp. 153-166.
[23] B. L. Menezes and R. M. Jenevein, "KYKLOS: A linear growth fault-tolerant interconnection network," inProc. Int. Conf. Parallel Processing, Aug. 1985, pp. 498-502.
[24] B. L. Menezes, D. Brant, D. Loewi, A. Dale, and R. Jenevein, "An interconnection network supporting relational join operations," inProc. Seventh Int. Conf. Distributed Comput., Sept. 1987, pp. 128-135.
[25] B. L. Menezes, "The KYKLOS multicomputer network: Interconnection strategies, properties, and applications," Ph.D. dissertation, Univ. of Texas at Austin, Austin, TX, 1988.
[26] B. L. Menezes, "A class of interconnection networks with generalized Fibonacci distance distributions," in review.
[27] F. P. Preparata and J. Vuillemin, "The cube-connected cycle: A versatile network for parallel computation,"Commun. ACM, vol. 24, pp. 300-309, May 1981.
[28] H. J. Siegel and R. J. McMillen, "The multistage cube: A versatile interconnection network,"IEEE Comput. Mag., vol. 14, pp. 65-76, Dec. 1981.
[29] S. W. Song, "On a high-performance VLSI solution to database Problems," Ph.D. dissertation, Dep. Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, 1980.
[30] S. J. Stolfo and D. E. Shaw, "DADO: A tree-structured machine architecture for production systems," inProc. AAAI-82, Carnegie-Mellon Univ., Pittsburgh, PA, 1982.
[31] DBC/102 Database Computer Concepts and Facilities, Teradata Corp., Doc. C02-0001-00, 1983.
[32] C. Wu and T. Feng, "The reverse-exchange interconnection network,"IEEE Trans. Comput., vol. C-29, pp. 801-811, Sept. 1980.

Index Terms:
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.
Citation:
B.L. Menezes, R. Jenevein, "The KYKLOS Multicomputer Network: Interconnection Strategies, Properties, and Applications," IEEE Transactions on Computers, vol. 40, no. 6, pp. 693-705, June 1991, doi:10.1109/12.90248
Usage of this product signifies your acceptance of the Terms of Use.