nach oben

The Journal of Supercomputing

Erschienen in:

01.03.2015

The new Petersen-torus networks

Erschienen in: The Journal of Supercomputing | Ausgabe 3/2015

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

Routing and broadcasting are major parameters determining the performance of interconnection networks. In this paper, we propose a new Petersen-torus network \(\mathrm{NPT}(m, n)\) by modifying the external edge definitions of the Petersen-torus network to improve its diameter and broadcasting times. We also show one-to-all broadcasting algorithms in \(\mathrm{NPT}(m, n)\) using the single-link available and multiple-link available models.

Vorheriger Artikel A learning automata-based adaptive uniform fractional guard channel algorithm

Nächster Artikel Real-time indexing for large image databases: color and edge directivity descriptor on GPU

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Zhou W, Fan J, Jia X, Zhang S (2011) The spined cube: a new hypercube variant with smaller diameter. Inf Process Lett 111:561–567CrossRefMATHMathSciNet

Johnsson SL (1987) Communication efficient basic linear algebra computations on hypercube architectures. J Parallel Distrib Comput 16:133–172CrossRef

Mendia VE, Sarkar D (1992) Optimal broadcasting on the star graph. IEEE Trans Parallel Distrib Syst 3(4):389–396CrossRefMathSciNet

Albader B, Bose B, Flahive M (2012) Efficient communication algorithms in hexagonal mesh interconnection networks. IEEE Trans Parallel Distrib Syst 23(1):69–77CrossRef

Bai L, Maeda H, Ebara H, Nakano H (1998) A broadcasting algorithm with time and message optimum on arrangement graphs. J Graph Algorithms Appl 2(2):1–17CrossRefMathSciNet

Carle J, Myoupo J-F, Seme D (1999) All-to-all broadcasting algorithms on honeycomb networks and applications. Parallel Process Lett 9(4):539–550CrossRef

Deazevedo MM, Bagherzadeh N, Latifi S (1995) Broadcasting algorithms for the star-connected cycles interconnection network. J Parallel Distrib Comput 25:209–222

Farah RN, Othman M (2014) Broadcasting communication in high degree modified chordal rings networks. Appl Math Inf Sci 8(1):229–233CrossRef

Mkwawa IM, Kouvatsos DD (2003) An optimal neighborhood broadcasting scheme for star interconnection networks. J Interconnect Netw 4(1):103–112CrossRef

10.

Stewart IA (2014) Interconnection networks of degree three obtained by pruning two-dimensional tori. IEEE Trans Comput 63(10):2473–2486

11.

Thomson A, Zhou S (2014) Frobenius circulant graphs of valency six, Eisenstein–Jacobi networks, and hexagonal meshes. Eur J Comb 38:61–78CrossRefMATHMathSciNet

12.

Yang X, Wang L, Yang L (2012) Optimal broadcasting for locally twisted cubes. Inf Process Lett 112:129–134CrossRefMATH

13.

Seo JH, Lee HO (2009) One-to-all broadcasting in Petersen-torus networks for SLA and MLA model. ETRI J 31(3):327–329CrossRef

14.

Dally W, Seitz C (1986) The torus routing chip. Distrib Comput 1:187–196CrossRef

15.

Chen MS, Shin KG (1990) Addressing, routing, and broadcasting in hexagonal mesh multiprocessors. IEEE Trans Comput 39(1):10–18CrossRefMathSciNet

16.

Tang KW, Padubidri SA (1994) Diagonal and toroidal mesh networks. IEEE Trans Comput 43(7):815–826CrossRefMATH

17.

Stojmenovic I (1997) Honeycomb network: topological properties and communication algorithms. IEEE Trans Parallel Distrib Syst 8(10):1036–1042CrossRef

18.

Arabnia HR, Oliver MA (1989) A transputer network for fast operations on digitised images. Int J Eurograph Assoc (Computer Graphics Forum) 8(1):3–12CrossRef

19.

Arabnia HR (1990) A parallel algorithm for the arbitrary rotation of digitized tmages using process-and-data-decomposition approach. J Parallel Distrib Comput 10(2):188–193CrossRef

20.

Bhandarkar SM, Arabnia HR (1995) The REFINE multiprocessor: theoretical properties and algorithms. Parallel Comput 21(11):1783–1806CrossRef

21.

Arabnia HR, Smith JW (1993) A reconfigurable interconnection network for imaging operations and its implementation using a multi-stage switching box. In: Proceedings of the 7th annual international high performance computing conference. The 1993 high performance computing: new horizons supercomputing symposium, pp 349–357

22.

Seo JH, Lee HO, Jang M (2008) Petersen-torus networks for multicomputer systems. In: Proceedings of the international conference on networked computing and advanced information management, pp 567–571

23.

Seo JH, Sim H, Park DH, Park JW, Lee YS (2011) One-to-one embedding between honeycomb mesh and Petersen-torus networks. Sensors 11:1959–1971CrossRef

24.

Seo JH, Jang M, Kim E, Ban K, Ryu N, Lee HO (2009) One-to-one embedding between hyper Petersen and Petersen-torus networks. Commun Comput Inf Sci 63:133–139CrossRef

25.

Seo JH, Lee HO, Jang M, Kim E (2008) Node mapping algorithm between hypercube and Petersen-torus networks. In: Proceedings of the international conference on networked computing and advanced information management, pp 535–539

26.

Seo JH, Lee HO, Jang M, Han SH (2008) Node mapping algorithm between torus and Petersen-torus networks. In: Proceedings of the international conference on networked computing and advanced information management, pp 540–544

27.

Seo JH, Lee HO, Jang M (2008) Constructing complete binary trees on Petersen-torus networks. In: Proceedings of the international conference on computer sciences and convergence information technology, pp 252–255

28.

Seo JH, Lee HO, Jang M (2008) Optimal routing and hamiltonian cycle in Petersen-torus networks. In: Proceedings of the international conference on computer sciences and convergence information technology, pp 303–308

29.

Holton DA, Sheehan J (1993) The Petersen graph. Australian Mathematical Society lecture notes, vol 7. Cambridge University Press, London

Titel: The new Petersen-torus networks
Publikationsdatum: 01.03.2015
Erschienen in: The Journal of Supercomputing / Ausgabe 3/2015
Print ISSN: 0920-8542
Elektronische ISSN: 1573-0484
DOI: https://doi.org/10.1007/s11227-014-1342-3

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft"

Springer Professional "Technik"

Springer Professional "Wirtschaft+Technik"

Weitere Artikel der Ausgabe 3/2015

Automatic scoping of task clauses for the OpenMP tasking model

A fully parallelized scheme of constructing independent spanning trees on Möbius cubes

DASC-DIR: a low-overhead coherence directory for many-core processors

Erratum to: Supercomputing and grid computing on the verification of covering arrays

Real-time indexing for large image databases: color and edge directivity descriptor on GPU

A novel metaheuristic algorithm and utility function for QoS based scheduling in user-centric grid systems