Skip to main content
Log in

A High-Performance and Cost-Efficient Interconnection Network for High-Density Servers

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

The high-density server is featured as low power, low volume, and high computational density. With the rising use of high-density servers in data-intensive and large-scale web applications, it requires a high-performance and cost-efficient intra-server interconnection network. Most of state-of-the-art high-density servers adopt the fully-connected intra-server network to attain high network performance. Unfortunately, this solution costs too much due to the high degree of nodes. In this paper, we exploit the theoretically optimized Moore graph to interconnect the chips within a server. Accounting for the suitable size of applications, a 50-size Moore graph, called Hoffman-Singleton graph, is adopted. In practice, multiple chips should be integrated onto one processor board, which means that the original graph should be partitioned into homogeneous connected subgraphs. However, the existing partition scheme does not consider above problem and thus generates heterogeneous subgraphs. To address this problem, we propose two equivalent-partition schemes for the Hoffman-Singleton graph. In addition, a logic-based and minimal routing mechanism, which is both time and area efficient, is proposed. Finally, we compare the proposed network architecture with its counterparts, namely the fully-connected, Kautz and Torus networks. The results show that our proposed network can achieve competitive performance as fully-connected network and cost close to Torus.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Montero R S, Huedo E, Llorente I M. Benchmarking of high throughput computing applications on grids. Parallel Computing, 2006, 32(4): 267-279.

    Article  Google Scholar 

  2. Faanes G, Bataineh A, Roweth D, Court T, Froese E, Alverson B, Johnson T, Kopnick J, Higgins M, Reinhard J. Cray cascade: A scalable HPC system based on a Dragonfly network. In Proc. the International Conference for High Performance Computing, Networking, Storage and Analysis (SC2012), November 2012, Article No.103.

  3. Rao A. SeaMicro technology overview. Technical Report, AMD, January 2012. http://www.seamicro.com/sites/default/files/SM_TO01_64_v2.5.pdf, December 2013.

  4. Rajamony R, Stephenson M C, Speight W E. The power 775 architecture at scale. In Proc. the 27th International ACM Conference on International Conference on Supercomputing (ICS2013), June 2013, pp.183-192.

  5. Rao A. SeaMicro SM10000 system overview. Technical Report, AMD, June 2010. http://www.tiger-optics.ru/download/seamicro/SM_TO02_v1.4.pdf, December 2013.

  6. Hoffman A J, Singleton R R. On Moore graphs with diameters 2 and 3. IBM J. Research and Development, 1960, 4(5): 497-504.

    Article  MATH  MathSciNet  Google Scholar 

  7. Mattson T G, Van der Wijngaart R, Frumkin M. Programming the Intel 80-core network-on-a-chip terascale processor. In Proc. the International Conference for High Performance Computing, Networking, Storage and Analysis (SC2008), Nov. 2008, Article No.38.

  8. Bell S, Edwards B, Amann J et al. TILE64-processor: A 64-core SoC with mesh interconnect. In Proc. International Solid-State Circuits Conference (ISSCC2008), February 2008, pp.88-89.

  9. Seo J, Lee H, Jang M. Optimal routing and Hamiltonian cycle in Petersen-Torus networks. In Proc. the 3rd International Conference on Convergence and Hybrid Information Technology (ICCIT2008), November 2008, pp.303-308.

  10. Barroso L A, Dean J, Hölzle U. Web search for a planet: The Google cluster architecture. IEEE Micro, 2003, 23(2): 22-28.

    Article  Google Scholar 

  11. O’Malley O. TeraByte sort on Apache Hadoop. Technical Report, Yahoo!, May 2008. http://sortbenchmark.org/YahooHadoop.pdf, December 2013.

  12. Esteves R M, Pais R, Rong C. K-Means clustering in the cloud - A Mahout test. In Proc. the 2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications (WAINA2011), March 2011, pp.514-519.

  13. Thusoo A, Sarma J, Jain N et al. Hive: A warehousing solution over a map-reduce framework. In Proc. the 35th International Conference on Very Large Data Bases (VLDB2009), August 2009, pp.1626-1629.

  14. Adiga N R, Blumrich M A, Chen D et al. Blue Gene/L torus interconnection network. IBM Journal of Research and Development, 2005, 49(2): 265-276.

    Article  Google Scholar 

  15. Nan J, Becker D U, Michelogiannakis G et al. A detailed and flexible cycle-accurate Network-on-Chip simulator. In Proc. IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS2013), April 2013, pp.86-96.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wen-Tao Bao.

Additional information

This work was supported by the Strategic Priority Research Program of the Chinese Academy of Sciences under Grant No. XDA06010401, the National Natural Science Foundation of China under Grant Nos. 61202056, 61331008, 61221062, and the Huawei Research Program of China under Grant No. YBCB2011030.

A preliminary version of the paper was published in the Proceedings of HPCC 2013.

Electronic supplementary material

Below is the link to the electronic supplementary material.

ESM 1

(DOC 28 kb)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bao, WT., Fu, BZ., Chen, MY. et al. A High-Performance and Cost-Efficient Interconnection Network for High-Density Servers. J. Comput. Sci. Technol. 29, 281–292 (2014). https://doi.org/10.1007/s11390-014-1430-0

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-014-1430-0

Keywords

Navigation