This Article 
 Bibliographic References 
 Add to: 
Optimal Realization of Sets of Interconnection Functions on Synchronous Multiple Bus Systems
August 1996 (vol. 45 no. 8)
pp. 964-969

Abstract—We develop a formal and systematic methodology for designing an optimal multiple bus system (MBS) realizing a set of interconnection functions whose graphical representation (denoted as IFG) is symmetric. The problem of constructing an optimal MBS for a given IFG is NP-Hard. In this paper, we show that polynomial time solutions exist when the IFG is vertex symmetric. This is the case of interest for the vast majority of important interconnection function sets.

We present a particular partition (which can be found in polynomial time) on the edge set of a vertex symmetric IFG, that produces a symmetric MBS with minimum number of buses as well as minimum number of interfaces. We demonstrate several advantages of such an MBS over a direct-link architecture realizing the same IFG, in terms of the number of ports per processor, number of neighbors per processors, and the diameter.

[1] 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.
[2] C.M. Fiduccia,“Bused hypercubes and other pin-optimal networks,” IEEE Trans. Parallel and Distributed Systems, vol. 3, pp. 14-24, 1992.
[3] J. Killian,S. Kipnis,, and C.E. Leiserson,“The organization of permutation architectures with bused interconnections,” IEEE Trans. Computers, vol. 39, no. 11, pp. 1,346-1,357, Nov. 1990.
[4] P. Kulasinghe and A. El-Amawy, "Optimally Realizing Interconnection Functions on Multiple Bus Systems," Technical Report no. EEC-017-PK-AE, Dept. of Electrical and Computer Eng, Louisiana State Univ., Baton Rouge, 1993.
[5] P. Kulasinghe and A. El-Amawy, "On the Complexity of Optimal Bused Interconnections," IEEE Trans. Computers, vol. 44, no. 10, pp. 1,248-1,251, Oct. 1995.
[6] A. Mathialagan and N.N. Biswas, "Optimal Interconnections in the Design of Microprocessors and Digital Systems," IEEE Trans. Computers, vol. 29, no. 2, pp. 145-148, Feb. 1980.
[7] 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.
[8] H.J. Siegel, Interconnection Networks for Large-Scale Parallel Processing, Second Ed., McGraw-Hill, New York, 1990.
[9] H.C. Torng and N.C. Wilhelm, "The Optimal Interconnection of Circuit Modules in Microprocessor and Digital System Design," IEEE Trans. Computers, vol. 26, no. 5, pp. 450-457, May 1977.
[10] R. Vaidyananthan, "Design of Multiple Bus Interconnection Networks for Fan-In Computations," Proc. 29th Ann. Allerton Conf. Comm. Control&Comp., pp. 1,093-1,102, 1991.
[11] A.T. White, Graphs, Groups and Surfaces. North-HollandMathematics Studies, 1984.

Index Terms:
Bus minimization, Cayley color graph, interconnection function, interconnection network, interface minimization, multiple bus system, optimal design, SIMD operation.
Priyalal Kulasinghe, Ahmed El-Amawy, "Optimal Realization of Sets of Interconnection Functions on Synchronous Multiple Bus Systems," IEEE Transactions on Computers, vol. 45, no. 8, pp. 964-969, Aug. 1996, doi:10.1109/12.536238
Usage of this product signifies your acceptance of the Terms of Use.