This paper explores the suitability of dense circulant graphs of degree four for the design of on-chip interconnection networks. Networks based on these graphs reduce the Torus diameter in a factor \(\sqrt{2}\), which translates into significant performance gains for unicast traffic. In addition, they are clearly superior to Tori when managing collective communications. This paper introduces a new two-dimensional node’s labeling of the networks explored which simplifies their analysis and exploitation. In particular, it provides simple and optimal solutions to two important architectural issues: routing and broadcasting. Other implementation issues such as network folding and scalability by using hierarchical networks are also explored in this work.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
L. A. Barroso et al., Piranha: A Scalable Architecture Based on Single-Chip Multiprocessing, in 27th Annual International Symposium on Computer Architecture, pp. 282–293 (2000).
Tendler et al. J.M. (2002). Power4 System Microarchitecture. IBM J Res Devel 46(1): 5–25
R. Mullins, A. West, and S. Moore, Low-Latency Virtual-Channel Routers for On-Chip Networks, in 31th International Sysmposium on Computer Architecture, pp. 188–197 (2004).
Boesch F.T., Wang J. (1985). Reliable Circulant Networks with Minimum Transmission Delay. IEEE Trans Circ. Syste. 32: 1286–1291
C. Martínez, R. Beivide, J. Gutierrez, and E. Gabidulin, On the Perfect t-Dominating Set Problem in Circulant Graphs and Codes over Gaussian Integers, in Proceedings of the 2005 IEEE International Symposium on Information Theory (ISIT’05), Adelaide, Australia, (2005).
Z. Cvetanovic, Performance Analysis of the Alpha 21364-based HP GS1280 Multiprocessor, in 30th Annual International Symposium on Computer Architecture, pp. 218–228 (2003).
V. Puente, C. Izu, J. A. Gregorio, R. Beivide, J. M. Prellezo, and F. Vallejo, Improving Parallel System Performance by Changing the Arrangement of the Networks Links, Conference Proceedings of the 2000 International Conference on Supercomputing. Santa Fe, New Mexico. pp. 44–53 (2000).
Yang Y., Funashi A., Jouraku A., Nishi H., Amano H., Sueyoshi T. (2001). Recursive Diagonal Torus: An Interconnection Network for Massively Parallel Computers. IEEE Trans. Parallel Distrib. Syst. 12(7): 701–715
V. Puente, J. A. Gregorio, F. Vallejo, and R. Beivide, Immunet: a Cheap and Robust Fault-Tolerant Packet Routing Mechanism, in 31th Annual International Symposium on Computer Architecture, pp. 198–209 (2004).
M. Blumrich et al., Design and Analysis of the BlueGene/L Torus Interconnection Network, IBM Research Report, RC23025 (W0312-022), December 3, Computer Science, (2003).
M. M. K. Martin, M. D. Hill, and D. A. Wood, Token Coherence: Decoupling Performance and Correctness, in 30th Annual International Symposium on Computer Architecture, pp. 182–193 (2003).
M. R. Mullins, J. D. Bingham, M. D. Hill, A. J. Hu, M. M. Martin and D. A. Wood, Improving Multiple-CMP Systems Using Token Coherence, in 11th International Sysmposium on High Performance Computer Architecture, pp. 328–339 (2005).
Y. Yang and J. Wang, Efficient All-to-All Broadcast in All-Port Mesh and Torus Networks, in 5th International Symposium on High Performance Computer Architecture, Florida (1999).
M. A. Fiol, J. L. Yebra, I. Alegre, and M. Valero, A Discrete Optimization Problem in Local Networks and Data Alignment, IEEE Trans Comput, 36(6):702–713 (1987).
Wong C.K., Coppersmith D. (1974). A Combinatorial Problem Related to Multimodule Memory Organizations. J. ACM 21(3): 392–402
R. Beivide, E. Herrada, J. L. Balcázar, and J. Labarta, Optimized Mesh-Connected Networks for SIMD and MIMD Architectures, in 14th Annual International Symposium on Computer Architecture, pp. 163–169 (1987).
J.-C. Bermond, G. Illiades, and C. Peyrat, An Optimization Problem in Distributed Loop Computer Networks, in 3rd Interantional Conference on Combinatorials Mathematics, New York Academy of Sciences, pp. 1–13 (1985).
Beivide R., Herrada E., Balcázar J.L., Arruabarrena A. (1991). Optimal Distance Networks of Low Degree for Parallel Computers. IEEE Trans. Comput. C-40(10): 1109–1124
C. Martínez, E. Vallejo, M. Moretó, R. Beivide and M. Valero, Hierarchical Topologies for Large-scale Two-level Networks, in XVI Jornadas de Paralelismo. Granada, Spain (2005).
Mellor-Crummey J., Scott M. (1991). Algorithms for Scalable Synchronization on Shared- Memory Multiprocessors. ACM Trans. Comput. Syst. 9(1):2165
E. Vallejo, R. Beivide, and C. Martínez, Practicable Layouts for Optimal Circulant Graphs, in Euromicro Conference on Parallel, Distributed and Network-based Processing, Switzerland, (2005).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Martínez, C., Vallejo, E., Beivide, R. et al. Dense Gaussian Networks: Suitable Topologies for On-Chip Multiprocessors. Int J Parallel Prog 34, 193–211 (2006). https://doi.org/10.1007/s10766-006-0014-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10766-006-0014-1