Data Concentration on Torus Embedded Hypercube Network

  • Uday Kumar Sinha
  • Sudhanshu Kumar Jha
  • Hrishikesh Mandal
Conference paper
Part of the Smart Innovation, Systems and Technologies book series (SIST, volume 28)

Abstract

Data concentration is an important tool for various scientific and engineering applications. Recently, torus embedded hypercube have attracted much attention among researchers due to its inherent architectural property of two different interconnection networks. In this paper we present an algorithm to perform data concentration on torus embedded hypercube network. Our proposed algorithm takes d(5.5n + 3 log n) time to perform data concentration of d (d < N) datum on torus embedded hypercube network having N (= n × n × n) processing elements. Our proposed algorithm can be compared with other data concentration algorithm designed for various other interconnection networks.

Keywords

Data concentration parallel prefix torus embedded hypercube interconnection network routing in interconnection network 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Jan, G., Lin, F.Y.S., Lin, M.B., Liang, D.: Concentrations, load balancing, multicasting and partial permutation routing on hypercube parallel computers. Journal of Information Science and Engineering 18, 693–712 (2012)Google Scholar
  2. 2.
    Horowitz, E., Sahni, S., Rajasekaran, S.: Fundamental of Computer Algorithms. Galgotia Publication (2008)Google Scholar
  3. 3.
    Lee, C.-Y., Oruc, A.Y.: Design of efficient and easily routable generalized connectors. IEEE Transactions on Communications 43(234), 646–650 (1995)Google Scholar
  4. 4.
    Horowitz, E., Sahni, S., Rajasekaran, S.: Computer Algorithms. Silicon Press (2008)Google Scholar
  5. 5.
    Ahmad, I., Ranka, S.: Handbook of Energy-Aware and Green Computing. Champman and HallComputer and Information Science Series, vol. 1. CRC Press, Taylor and Francis Group (2012)Google Scholar
  6. 6.
    Jha, S.K., Jana, P.K.: Fast Data Concentration on OTIS-Mesh of Trees. In: Frontiers in Electronics, Communications, Instrumentation and Information Technology, pp. 232–237 (2009)Google Scholar
  7. 7.
    Jha, S.K., Reddy, M.R.: Parallel Prefix on Hierarchical Ring with its Application to Data Concentration. In: Recent Advances in Information Technology, pp. 293–300 (2009)Google Scholar
  8. 8.
    Kini, N.G., Kumar, M.S., Mruthyunjaya, H.S.: A Torus Embedded Hypercube Scalable Interconnection Network for Parallel Architecture. In: IEEE International Advance Computing Conference, pp. 858–861 (2009)Google Scholar
  9. 9.
    Hwang, K.: Advanced Computer Architecture: Parallelism, Scalability, Programmability. McGraw-Hill (1993)Google Scholar
  10. 10.
    Jong-Seok, K., Hyeong-OK, L., Yeong-Nam, H.: Embedding among HCN(n, n), HFN(n, n) and hypercube. In: Eighth IEEE International Conference on Parallel and Distributed System, pp. 533–540 (2001)Google Scholar
  11. 11.
    Sinha, U.K., Jha, S.K., Mondal, H.: Parallel Prefix Computation on Torus Embedded Hypercube. In: International Conference on  Recent Trends in Engineering and Technology (2014)Google Scholar
  12. 12.
    Akl, S.G.: The Design and Analysis of Parallel Algorithms. Prentice - Hall (1989)Google Scholar
  13. 13.
    Jha, S.K., Jana, P.K.: Study and Design of Parallel Algorithms for Interconnection Networks. Lambert Academic Publishing (2011)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Uday Kumar Sinha
    • 1
  • Sudhanshu Kumar Jha
    • 2
  • Hrishikesh Mandal
    • 1
  1. 1.Department of Computer Science and EngineeringBengal College of Engineering and TechnologyDurgapurIndia
  2. 2.Department of Computer ApplicationsNational Institute of TechnologyJamshedpurIndia

Personalised recommendations