Skip to main content
SpringerLink
Log in

Nonflat surface level pyramid: a high connectivity multidimensional interconnection network

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Parallel machines are extensively used to increase computational speed in solving different scientific problems. Various topologies with different properties have been proposed so far and each one is suitable for specific applications. Pyramid interconnection networks have potentially powerful architecture for many applications such as image processing, visualization, and data mining. The major advantage of pyramids which is important for image processing systems is hierarchical abstracting and transferring the data toward the apex node, just like the human being vision system, which reach to an object from an image. There are rapidly growing applications in which the multidimensional datasets should be processed simultaneously. For such a system, we need a symmetric and expandable interconnection network to process data from different directions and forward them toward the apex. In this paper, a new type of pyramid interconnection network called Non-Flat Surface Level (NFSL) pyramid is proposed. NFSL pyramid interconnection networks constructed by L-level A-lateral-base pyramids that are named basic-pyramids. So, the apex node is surrounded by the level-one surfaces of NFSL that are the first nearest level of nodes to apex in the basic pyramids. Two topologies which are called NFSL-T and NFSL-Q originated from Trilateral-base and Quadrilateral-base basic-pyramids are studied to exemplify the proposed structure. To evaluate the proposed architecture, the most important properties of the networks are determined and compared with those of the standard pyramid networks and its variants.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. Duato J, Yalamanchili S, Ni L (2003) Interconnection networks an engineering approach. Morgan Kaufmann, San Mateo

    Google Scholar 

  2. http://top500.org/list/2011/11/100. Visited on February 2012

  3. Baker M (2000) Cluster computing white paper. In: IEEE task force on cluster computing, computing research repository

    Google Scholar 

  4. Fu JS (2008) Fault-free Hamiltonian cycles in twisted cubes with conditional link faults. J Theor Comput Sci 407:318–329

    Article  MATH  Google Scholar 

  5. Fu JS, Hung HS, Chen GH (2009) Embedding fault-free cycles in crossed cubes with conditional link faults. J Supercomput 49:219–233

    Article  Google Scholar 

  6. Hsieh SY, Cian YR (2010) Conditional edge-fault Hamiltonicity of augmented cubes. J Inf Sci 180:2596–2617

    MATH  MathSciNet  Google Scholar 

  7. Hsieh SY, Lee CW (2010) Pancyclicity of restricted hypercube-like networks under the conditional fault model. J Discrete Math 23:2010–2019

    Google Scholar 

  8. Hsieh SY, Chang NW (2009) Extended fault-tolerant cycle embedding in faulty hypercubes. IEEE Trans Reliab 58:702–710

    Article  Google Scholar 

  9. Razavi S, Sarbazi-Azad H (2010) The triangular pyramid: routing and topological properties. J Inf Sci 180:2328–2339

    MATH  MathSciNet  Google Scholar 

  10. Fang JF (2008) The bipancycle-connectivity of the hypercube. J Inf Sci 178:4679–4687

    MATH  Google Scholar 

  11. Fu JS (2008) Hamiltonian connectivity of the WK-recursive network with faulty nodes. J Inf Sci 178:2573–2584

    MATH  Google Scholar 

  12. Farahabadi MH, Imani N, Sarbazi-Azad H (2008) Some topological and combinatorial properties of WK-recursive mesh and WK-pyramid interconnection networks. J Syst Archit 54:67–976

    Google Scholar 

  13. AI-Tawil KM, Abd-El-Barr M, Ashraf F (1997) A survey and comparison of wormhole routing techniques in a mesh networks. IEEE Netw 11):38–45

    Article  Google Scholar 

  14. Farahabady MH, Sarbazi-Azad H (2005) The RTCC-pyramid: a versatile pyramid network. In: Proceedings of the eighth international conference on high-performance computing in Asia-Pacific region (HPCASIA’05), pp 492–498

    Google Scholar 

  15. Farahabady MH, Sarbazi-Azad H (2005) The recursive transpose-connected cycles (RTCC) interconnection network for multiprocessors. In: ACM symposium on applied computing, pp 734–738

    Google Scholar 

  16. Chen YC, Duh DR, Hsieh HJ (2004) On the enhanced pyramid network. In: Proceedings of international conference on parallel and distributed processing techniques and applications, pp 1483–1489

    Google Scholar 

  17. Farahabady MH, Sarbazi-Azad H (2006) The grid-pyramid: a generalized pyramid network. J Supercomput 37:23–45

    Article  Google Scholar 

  18. Imani N, Sarbazi-Azad H (2010) Properties of a hierarchical network based on the star graph. J Inf Sci 180:2802–2813

    MATH  MathSciNet  Google Scholar 

  19. Cipher R, Sanz JLC (1989) SIMD architectures and algorithms for image processing and computer vision. IEEE Trans Acoust Speech Signal Process 37:2158–2174

    Article  Google Scholar 

  20. Jenq JF, Sahni S (1993) Image shrinking and expanding on a pyramid. IEEE Trans Parallel Distrib Syst 4:1291–1296

    Article  Google Scholar 

  21. Ahrens J, Brislawn K, Martin K, Geveci B, Law CC, Papka M (2001) Large-scale data visualization using parallel data streaming. IEEE Comput Graph Appl 21:34–41

    Article  Google Scholar 

  22. Goil S, Choudhary A (2001) An infrastructure for parallel multidimensional analysis and data mining. J Parallel Distrib Comput 61:285–321

    Article  MATH  Google Scholar 

  23. Wheeler MF, Lee W, Dawson CN, Arnold DC, Kurc T, Parashar M, Saltz J, Sussman A (2001) Parallel computing in environment and energy. Handbook of parallel computing. Morgan Kaufman, San Mateo

    Google Scholar 

  24. Chang C, Moon B, Acharya A, Shock C, Sussman A, Saltz J (1997) A high performance remotesensing database. In: Proceedings of the 1997 international conference on data engineering. IEEE Computer Society Press, Los Alamitos

    Google Scholar 

  25. Fehn C, Barre R, Pastoor S (2006) Interactive 3-DTV-concepts and key technologies. Proc IEEE 94:524–538

    Article  Google Scholar 

  26. Sarbazi-Azad H, Ould-Khaoua M, Mackenzie L (2001) Algorithmic construction of Hamiltonians in pyramid networks. J Inf Process Lett 80:75–79

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Electrical Engineering Department, Iran University of Science and Technology, Tehran, Iran

    Hadi Shahriar Shahhoseini, Ehsan Saleh Kandzi & Morteza Mollajafari

Authors
  1. Hadi Shahriar Shahhoseini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ehsan Saleh Kandzi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Morteza Mollajafari
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hadi Shahriar Shahhoseini.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shahhoseini, H.S., Saleh Kandzi, E. & Mollajafari, M. Nonflat surface level pyramid: a high connectivity multidimensional interconnection network. J Supercomput 67, 31–46 (2014). https://doi.org/10.1007/s11227-013-0983-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-013-0983-y

Keywords

Search

Navigation