Shortest-Path routing in spined cubes

The spined cube is a variant of the hypercube and it provides a promising topology of interconnection networks for massively parallel systems. The diameter of the n-spined cube is almost equal to (n + 3)/3, which is smallest among the variants of the hypercube. In this paper, we propose a shortest-p...

Full description

Saved in:
Bibliographic Details
Published in2017 6th ICT International Student Project Conference (ICT-ISPC) pp. 1 - 4
Main Authors Satoh, Kaito, Kaneko, Keiichi, Hong Hanh, Phan Thi, Thanh Binh, Huynh Thi
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.05.2017
Subjects
Online AccessGet full text

Cover

Loading…
Abstract The spined cube is a variant of the hypercube and it provides a promising topology of interconnection networks for massively parallel systems. The diameter of the n-spined cube is almost equal to (n + 3)/3, which is smallest among the variants of the hypercube. In this paper, we propose a shortest-path routing algorithm in spined cubes.
AbstractList The spined cube is a variant of the hypercube and it provides a promising topology of interconnection networks for massively parallel systems. The diameter of the n-spined cube is almost equal to (n + 3)/3, which is smallest among the variants of the hypercube. In this paper, we propose a shortest-path routing algorithm in spined cubes.
Author Satoh, Kaito
Hong Hanh, Phan Thi
Kaneko, Keiichi
Thanh Binh, Huynh Thi
Author_xml – sequence: 1
  givenname: Kaito
  surname: Satoh
  fullname: Satoh, Kaito
  email: k1kaneko@cc.tuat.ac.jp
  organization: Graduate School of Engineering, Tokyo University of Agriculture and Technology, Tokyo, Japan
– sequence: 2
  givenname: Keiichi
  surname: Kaneko
  fullname: Kaneko, Keiichi
  organization: Graduate School of Engineering, Tokyo University of Agriculture and Technology, Tokyo, Japan
– sequence: 3
  givenname: Phan Thi
  surname: Hong Hanh
  fullname: Hong Hanh, Phan Thi
  organization: School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam
– sequence: 4
  givenname: Huynh Thi
  surname: Thanh Binh
  fullname: Thanh Binh, Huynh Thi
  organization: School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam
BookMark eNotjkFLwzAYQCPowU1_gQi9eEz3fUmaJkcp6gqDDdb7aJovLrClo80O_nsFd3rwDo-3YPdpTMTYK0KJCHbVNh1v97umFIB1aaCupLJ3bIGVNFpYq80je9sfxynTnPmuz8diGq85pu8ipmK-xES-GK6O5if2EPrTTM83Lln3-dE1a77ZfrXN-4ZHC5kPQDV5VSF47ZUAF7Q1Al0gT0Y4hbICbckpDcqAHwa0xhgVQIQ_b4Ncspf_bCSiw2WK5376OdzG5S_BtjyB
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ICT-ISPC.2017.8075349
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE/IET Electronic Library
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE/IET Electronic Library
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 1538629968
9781538629963
EndPage 4
ExternalDocumentID 8075349
Genre orig-research
GroupedDBID 6IE
6IL
CBEJK
RIE
RIL
ID FETCH-LOGICAL-i90t-c0e7ed4510d6d420bf69821bfede82b4135069eb460480dcc198884f02f0699f3
IEDL.DBID RIE
IngestDate Thu Jun 29 18:38:49 EDT 2023
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i90t-c0e7ed4510d6d420bf69821bfede82b4135069eb460480dcc198884f02f0699f3
PageCount 4
ParticipantIDs ieee_primary_8075349
PublicationCentury 2000
PublicationDate 2017-May
PublicationDateYYYYMMDD 2017-05-01
PublicationDate_xml – month: 05
  year: 2017
  text: 2017-May
PublicationDecade 2010
PublicationTitle 2017 6th ICT International Student Project Conference (ICT-ISPC)
PublicationTitleAbbrev ICT-ISPC
PublicationYear 2017
Publisher IEEE
Publisher_xml – name: IEEE
Score 1.6791378
Snippet The spined cube is a variant of the hypercube and it provides a promising topology of interconnection networks for massively parallel systems. The diameter of...
SourceID ieee
SourceType Publisher
StartPage 1
SubjectTerms diameter
hypercube
Hypercubes
interconnection network
Network topology
Parallel processing
Program processors
Routing
Topology
Title Shortest-Path routing in spined cubes
URI https://ieeexplore.ieee.org/document/8075349
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3Pa8MgGP1oe9ppG-3Yb3LYbjM1xvzwHFbaQUehHfRWon6yMkhLm1z610-TrGNjh91EBP0UeX763hPgIRI8MFxpkmulCM9ZQCTVqU1VQmZSnka6ZhNOX-PxG39ZRssOPB21MIhYk8_Qd8X6LV9vVOWuyobOODfkogvdRIhGq9WKcgIqhpNsQSbzWeb4Wonftv3xaUqNGaNTmH711lBFPvyqlL46_DJi_O9wzmDwrc7zZkfcOYcOFn14nL872uy-JDN7pvN2m8rxmb114e239iCpPVVJ3A9gMXpeZGPSfoFA1oKWRFFMUHO7b3SsOaPSxCJlgTSoMWXSAlBEY4GSx04abmc7EDaj5YYyY-uFCS-gV2wKvAQvURbs0bCc5c7jL5exQedco3geRilGV9B3Ea62jcnFqg3u-u_qGzhxs9ww_26hV-4qvLPoXMr7elk-AeQVkBw
link.rule.ids 310,311,783,787,792,793,799,27937,55086
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3PT8IwGP2CeNCTGjCKv3bQmx1b1431TCSgQEiYCTeytl8jMRkEtot_ve02MRoP3povTforzfvavvcKcB9y5msmFUmVlISl1CfCU7E5qgRUxywOVckmnEyj4St7XoSLBjzutTCIWJLP0LXF8i1frWVhr8q61jg3YPwADk1eHUeVWquW5fge7476CRnNZ33L2Oq5de0f36aUqDE4gclXexVZ5N0tcuHKj19WjP_t0Cm0v_V5zmyPPGfQwKwFD_M3S5zd5WRmsjpnuy4so9lZZc5uY1JJ5chC4K4NyeAp6Q9J_QkCWXEvJ9LDHipmdo6KFKOe0BGPqS80KoypMBAUehFHwSIrDjfz7XNzpmXao9rEuQ7OoZmtM7wApycN3KOmKU2ty18qIo3Wu0ayNAhjDC-hZUe43FQ2F8t6cJ2_w3dwNEwm4-V4NH25gmM74xUP8Bqa-bbAG4PVubgtl-gToWuTZw
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2017+6th+ICT+International+Student+Project+Conference+%28ICT-ISPC%29&rft.atitle=Shortest-Path+routing+in+spined+cubes&rft.au=Satoh%2C+Kaito&rft.au=Kaneko%2C+Keiichi&rft.au=Hong+Hanh%2C+Phan+Thi&rft.au=Thanh+Binh%2C+Huynh+Thi&rft.date=2017-05-01&rft.pub=IEEE&rft.spage=1&rft.epage=4&rft_id=info:doi/10.1109%2FICT-ISPC.2017.8075349&rft.externalDocID=8075349