This Article 
 Bibliographic References 
 Add to: 
Filtering Random Graphs to Synthesize Interconnection Networks with Multiple Objectives
November 2002 (vol. 13 no. 11)
pp. 1139-1149

Abstract—Synthesizing networks that satisfy multiple requirements, such as high reliability, low diameter, good embeddability, etc., is a difficult problem to which there has been no completely satisfactory solution. In this paper, we present a simple, yet very effective, approach to this problem. The crux of our approach is a filtration process that takes as input a large set of randomly generated graphs and filters out those that do not meet the specified requirements. Our experimental results show that this approach is both practical and powerful. The use of random regular networks as the raw material for the filtration process was motivated by their surprisingly good performance with regard to almost all properties that characterize a good interconnection network. This paper provides results related to the generation of networks that have low diameter, high fault tolerance, and good embeddability. Through this, we show that the generated networks are serious competitors to several traditional well-known networks. We also explore how random networks can be used in a packaging hierarchy and comment on the scope of application of these networks.

[1] T. Feng, Editorial Introduction, Tutorial Interconnection Networks for Parallel and Distributed Systems. IEEE Press, 1984.
[2] R.A. Finkel and M.H. Solomon, “Processor Interconnection Strategies,” IEEE Trans. Computers, vol. 29, no. 5, pp. 360-370, May 1980.
[3] N. Srinivasan, J. Opatrny, D. Sotteau, and K. Thulasiraman, “DCC Linear Congruential Graphs: A New Class of Interconnection Networks,” IEEE Trans. Computers, vol. 45, no. 2, pp. 156-164, Feb. 1996.
[4] S.B. Akers and B. Krishnamurthy, “A Group-Theoretic Model for Symmetric Interconnection Networks,” IEEE Trans. Computers, vol. 38, no. 4, pp. 555-566, Apr. 1989.
[5] P. Erdös and A. Rényi, “On the Evolution of Random Graphs,” Published at the Math. Inst. Hungarian Academy of Science, vol. 5, pp. 17-61, 1960.
[6] B. Bollobs, Random Graphs. Academic Press, 1985.
[7] S. Janson, T. Luczak, and A. Rucinski, Random Graphs. John Wiley&Sons, 2000.
[8] S.E. Fahlman, “The Hashnet Interconnection Scheme,” Technical Report CMU-CS-80-125, Dept. of Computer Science, Carnegie-Mellon Univ., 1980.
[9] B. Hayes, “Graph Theory in Practice: Part I and II,” Am. Scientist, vol. 88, nos. 1 and 2, pp. 9-13, 104-109, Jan. ,Apr. 2000.
[10] A.K.C. Wong and M.L. You, “Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 7, pp. 599-609, 1985.
[11] D. Stoyan and J. Ohser, “Correlations between Planar Random Structures with an Ecological Application,” Biometrical J., vol. 24, pp. 631-647, 1982.
[12] F.S. Annexstein, “Interconnection Networks: Regularity and Richness,” PhD thesis, Dept. of Computer and Information Science, Univ. of Massachusetts, 1991.
[13] J.A. Bondy and U.S.R. Murty, Graph Theory with Applications. New York: American Elsevier, 1976.
[14] S.H. Bokhari, “On the Mapping Problem,” IEEE Trans. Computers, vol. 30, no. 3, pp. 207-214, Mar. 1981.
[15] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[16] V. Lakamraju, Z. Koren, I. Koren, and C.M. Krishna, “Measuring the Vulnerability of Interconnection Networks in Embedded Systems,” Proc. First Merged Symp. IPPS/SPDP, EHPC Workshop, pp. 919-924, Apr. 1998.
[17] R.C. Read and R.J. Wilson, An Atlas of Graphs. Oxford, U.K.: Oxford Univ. Press, 1998.
[18] A. Steger and N.C. Wormald, “Generating Random Regular Graphs Quickly,” Combinatorics, Probability and Computing. vol. 8, pp. 377-396, 1999.
[19] B. Bollobas, “A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs,” European J. Combinatorics, vol. 1, no. 4, pp. 311-316, 1980.
[20] B.D. McKay and N.C. Wormald, “Uniform Generation of Random Regular Graphs of Moderate Degree,” J. Algorithms, vol. 11, no. 1, pp. 52-67, Mar. 1990.
[21] V. Lakamraju, I. Koren, and C.M. Krishna, “Synthesis of Interconnection Networks: A Novel Approach,” Proc. 20th Int'l Conf. Dependable Systems and Networks, pp. 56-64, June 2000.
[22] G. Tinhofer, “On the Generation of Random Graphs with Given Properties and Known Distribution,” Applied Computer Science. Berichte zur Praktischen Informatik. vol. 13, pp. 265-296, 1979.
[23] B.D. McKay, “Practical Graph Isomorphism,” Congressus Numerantium, vol. 30, pp. 45-87, Feb. 1981.
[24] B.D. McKay, “The Nauty Page,” 1990.
[25] H. Stone, “Parallel Processing with the Perfect Shuffle,” IEEE Trans. Computers, vol. 20, no. 2, pp. 153-161, Feb. 1971.
[26] F.P. Preparata and J. Vuillemin, “The Cube-Connected Cycles: A Versatile Network for Parallel Computation,” Comm ACM, vol. 24, no. 5, pp. 300-309, 1981.
[27] B. Arden and H. Lee, “Analysis of Chordal Ring Networks,” IEEE Trans. Computers, vol. 30, no. 4, pp. 291-295, Apr. 1981.
[28] W.E. Leland and M.H. Solomon, “Dense Trivalent Graphs for Processor Interconnection,” IEEE Trans. Computers, vol. 31, no. 3, pp. 219-222, Mar. 1982.
[29] B. Arden, H. Lee, “A Regular Network for Multicomputer Systems,” IEEE Trans. Computers, vol. 31, no. 1, pp. 60-69, Jan. 1982.
[30] K.W. Doty, “New Designs for Dense Processor Interconnection Networks,” IEEE Trans. Computers, vol. 33, no. 5, pp. 447-450, May 1984.
[31] J.C. Bermond and B. Bollobas, “The Diameter of Graphs-A Survey,” Congressus Numerantium, vol. 32, pp. 3-27, 1981.
[32] B. Bollobas and W.F. La Vega, “The Diameter of Random Regular Graphs,” Combinatorica, vol. 2, pp. 125-134, Feb. 1982.
[33] “The (d-k) Table,” A World Combinatorics Exchange Resource, taula_delta_d.html. 2001.
[34] V. Lakamraju, “Networking Issues in Distributed Real-Time Systems,” PhD Thesis, Dept. of Electrical and Computer Eng., Univ. of Massachusetts, 2002.
[35] R. Ferraro, “NASA Remote Exploration and Experimentation Project,” http:/ 2000.
[36] B. Hendrickson and R. Leland, “An Empirical Study of Static Load Balancing Algorithms,” Proc. Scalable High Performance Computer Conf., pp. 682-685, 1994.
[37] J.B. Saxe, “Embeddability of Graphs in K-Space Is Strongly NP-Hard,” Proc. 17th Allerton Conf. Comm., Control, and Computing, pp. 480-489, 1979.
[38] S.W. Hammond, “Mapping Unstructured Grid Computations to Massively Parallel Computers,” PhD thesis, Ransellear Polytechnique Institute, 1992.
[39] F. Pellegrini and J. Roman, “SCOTCH: A Software Package for Static Mapping by Dual Recursive Bipartitioning of Process and Architecture Graphs,” Lecture Notes in Computer Science, vol. 1067, pp. 493-499, 1996.
[40] B. Monien and H. Sudborough, “Embedding One Interconnection Network in Another,” Computational Graph Theory, Computing Supplementum, vol. 7, pp. 257-282, Springer, 1990.
[41] V. Lakamraju, I. Koren, and C.M. Krishna, “Embeddability in Random Regular Graphs,” Technical Report ECE-CSE-00-6, Dept. of Electrical and Computer Eng., Univ. of Massachusetts, 2000.
[42] T.E. Anderson, D.E. Culler, and D.A. Patterson, “A Case for NOW (Networks of Workstations),” IEEE Micro, vol. 15, no. 1, pp. 54–64, 1995.
[43] M. Baker, “Cluster Computing White Paper,” http:/ 2000.
[44] S. Casselman, “Virtual Computing and the Virtual Computer,” Proc. IEEE Workshop on FPGAs for Custom Computing Machines, D.A. Buell and K.L. Pocek, eds., pp. 43-48, Apr. 1993.
[45] J. Duato, S. Yalamanchili, and L.M. Ni, Interconnection Networks: An Engineering Approach. Los Alamitos, Calif.: IEEE CS Press, 1997.
[46] M.T. Raghunath, “Interconnection Network Design Based on Packaging Considerations,” PhD thesis, Computer Science Division, Univ. of California, Berkeley, 1993.
[47] K.B. Clark, “From the Sun to Pluto,” Proc. IEEE Digital Avionics System Conf., pp. 3-17, Nov. 1998.

Index Terms:
Interconnection networks, synthesis, random regular graphs, filters, diameter, fault tolerance, embedding, packaging.
Vijay Lakamraju, Israel Koren, C.M. Krishna, "Filtering Random Graphs to Synthesize Interconnection Networks with Multiple Objectives," IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 11, pp. 1139-1149, Nov. 2002, doi:10.1109/TPDS.2002.1058097
Usage of this product signifies your acceptance of the Terms of Use.