Recursive dual-net: A new versatile network for supercomputers of the next generation
In this paper, we propose a new versatile network, called a recursive dual-net (RDN), as a potential candidate for the interconnection network of supercomputers of the next generation. The RDN is based on recursive dual-construction of a base network. A k-level recursive dualconstruction for k >...
Uložené v:
| Vydané v: | Journal of the Chinese Institute of Engineers Ročník 32; číslo 7; s. 931 - 938 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Taylor & Francis Group
01.11.2009
|
| Predmet: | |
| ISSN: | 0253-3839, 2158-7299 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | In this paper, we propose a new versatile network, called a recursive dual-net (RDN), as a potential candidate for the interconnection network of supercomputers of the next generation. The RDN is based on recursive dual-construction of a base network. A k-level recursive dualconstruction for k > 0 creates a network containing (2m)
2k
/2 nodes with node-degree d + k, where m and d are the number of nodes and the node-degree of the base network, respectively. The RDN is node and edge symmetric if the base network is node and edge symmetric. The RDN can contain a huge number of nodes, each with small node-degree and short diameter. For example, we can construct a symmetric RDN connecting more than 3-million nodes with only 6 links per node and a diameter of 22. We investigate the topological properties of the RDN and compare them to those of other networks including 3D torus, WK-recursive network, hypercube, cube-connected-cycle, and dual-cube. We also establish the efficient routing and broadcasting algorithms for the RDN. |
|---|---|
| AbstractList | In this paper, we propose a new versatile network, called a recursive dual-net (RDN), as a potential candidate for the interconnection network of supercomputers of the next generation. The RDN is based on recursive dual-construction of a base network. A k-level recursive dualconstruction for k > 0 creates a network containing (2m)
2k
/2 nodes with node-degree d + k, where m and d are the number of nodes and the node-degree of the base network, respectively. The RDN is node and edge symmetric if the base network is node and edge symmetric. The RDN can contain a huge number of nodes, each with small node-degree and short diameter. For example, we can construct a symmetric RDN connecting more than 3-million nodes with only 6 links per node and a diameter of 22. We investigate the topological properties of the RDN and compare them to those of other networks including 3D torus, WK-recursive network, hypercube, cube-connected-cycle, and dual-cube. We also establish the efficient routing and broadcasting algorithms for the RDN. |
| Author | Chu, Wanming Li, Yamin Peng, Shietung |
| Author_xml | – sequence: 1 givenname: Yamin surname: Li fullname: Li, Yamin organization: Department of Computer Science , Hosei University – sequence: 2 givenname: Shietung surname: Peng fullname: Peng, Shietung organization: Department of Computer Science , Hosei University – sequence: 3 givenname: Wanming surname: Chu fullname: Chu, Wanming organization: Department of Computer Hardware , University of Aizu |
| BookMark | eNqFkM9KAzEQh4Mo2FYfQcgLbM0m3c1GL5biPygIYs8hTWZ1dZuUJNvatzdr68WDXmaY5PcNwzdEx9ZZQOgiJ-OcVOSS0IKxiokxJUSMRcnzoiJHaEBTzzgV4hgN-kzWh07RMIR3QmhZ0HyAFs-gOx-aDWDTqTazEK_wFFvY4g34oGLTQpri1vkPXDuPQ7cGr91q3cX0j12N41uf-Iz4FSz4RDh7hk5q1QY4P_QRWtzdvswesvnT_eNsOs8042XMtJoIVQkFhTG85kSUxiiijdCpGDbRS2omjBhe8KVIj6WBirOlJrwStADFRqjY79XeheChlmvfrJTfyZzI3o38cSN7N_LgJnHXvzjdxO_Lo1dN-y99s6cbm4ysVHLTGhnVrnW-9srqJkj294ovdRmBYw |
| CitedBy_id | crossref_primary_10_1016_j_tcs_2024_114562 crossref_primary_10_15803_ijnc_1_2_178 crossref_primary_10_1093_comjnl_bxw050 |
| Cites_doi | 10.1109/12.2234 10.1147/rd.492.0265 10.1023/B:SUPE.0000014803.83151.dc 10.1145/358645.358660 10.1016/0167-739X(88)90007-6 10.1109/71.372797 10.1002/net.3230240602 |
| ContentType | Journal Article |
| Copyright | Copyright Taylor & Francis Group, LLC 2009 |
| Copyright_xml | – notice: Copyright Taylor & Francis Group, LLC 2009 |
| DBID | AAYXX CITATION |
| DOI | 10.1080/02533839.2009.9671580 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 2158-7299 |
| EndPage | 938 |
| ExternalDocumentID | 10_1080_02533839_2009_9671580 9671580 |
| GroupedDBID | -~X .7F .QJ 0BK 0R~ 30N 4.4 5GY 8RM AAENE AAGDL AAHIA AAJMT AALDU AAMIU AAPUL AAQRR ABCCY ABFIM ABLIJ ABPAQ ABPEM ABTAI ABXUL ABXYU ACGFS ACTIO ADCVX ADGTB ADUMR AEISY AENEX AEOZL AFRVT AGBKS AGDLA AGMYJ AHDZW AIJEM AIYEW AKBVH AKOOK ALMA_UNASSIGNED_HOLDINGS ALQZU AQRUH AQTUD AVBZW BLEHA CCCUG DGEBU DKSSO EBS EJD E~A E~B FRP GTTXZ H13 HZ~ H~P J.P KYCEM M4Z NA5 NX~ O9- RNANH ROSJB RTWRZ S-T SNACF TASJS TBQAZ TDBHL TEN TFL TFT TFW TTHFI TUROJ UT5 UU3 ZGOLN ~S~ 07I AAYXX ACTTO ADMLS ADXEU AEHZU AEZBV AFBWG AFION AGVKY AGWUF AGYFW AKHJE AKMBP ALRRR ALXIB BGSSV BWMZZ C0- CITATION CYRSC DAOYK DEXXA FETWF HF~ IFELN LJTGL OPCYK RIG TAJZE UB6 |
| ID | FETCH-LOGICAL-c376t-ca49a89ae5dd7f7096dda0cd9c0cdd34cb2d430d757b99c06de873bc078925ea3 |
| IEDL.DBID | TFW |
| ISICitedReferencesCount | 5 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000272526500007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0253-3839 |
| IngestDate | Tue Nov 18 20:41:30 EST 2025 Sat Nov 29 05:10:20 EST 2025 Mon Oct 20 23:47:47 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 7 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c376t-ca49a89ae5dd7f7096dda0cd9c0cdd34cb2d430d757b99c06de873bc078925ea3 |
| PageCount | 8 |
| ParticipantIDs | crossref_primary_10_1080_02533839_2009_9671580 informaworld_taylorfrancis_310_1080_02533839_2009_9671580 crossref_citationtrail_10_1080_02533839_2009_9671580 |
| PublicationCentury | 2000 |
| PublicationDate | 2009-11-01 |
| PublicationDateYYYYMMDD | 2009-11-01 |
| PublicationDate_xml | – month: 11 year: 2009 text: 2009-11-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationTitle | Journal of the Chinese Institute of Engineers |
| PublicationYear | 2009 |
| Publisher | Taylor & Francis Group |
| Publisher_xml | – name: Taylor & Francis Group |
| References | Aki S. G. (CIT0002) 1997 CIT0010 Varma A. (CIT0012) 1994 CIT0001 CIT0003 CIT0013 CIT0005 CIT0004 CIT0007 Leighton F. T. (CIT0006) 1992 CIT0009 CIT0008 |
| References_xml | – ident: CIT0003 – ident: CIT0010 doi: 10.1109/12.2234 – ident: CIT0001 doi: 10.1147/rd.492.0265 – volume-title: Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes year: 1992 ident: CIT0006 – volume-title: Interconnection Networks for Multiprocessors and Multicomputers: Theory and Practice year: 1994 ident: CIT0012 – ident: CIT0008 doi: 10.1023/B:SUPE.0000014803.83151.dc – ident: CIT0007 – ident: CIT0009 doi: 10.1145/358645.358660 – volume-title: Parallel Computation: Models and Methods year: 1997 ident: CIT0002 – ident: CIT0013 doi: 10.1016/0167-739X(88)90007-6 – ident: CIT0005 doi: 10.1109/71.372797 – ident: CIT0004 doi: 10.1002/net.3230240602 |
| SSID | ssj0026521 ssj0001654702 |
| Score | 1.8130586 |
| Snippet | In this paper, we propose a new versatile network, called a recursive dual-net (RDN), as a potential candidate for the interconnection network of... |
| SourceID | crossref informaworld |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 931 |
| SubjectTerms | interconnection network parallel processing |
| Title | Recursive dual-net: A new versatile network for supercomputers of the next generation |
| URI | https://www.tandfonline.com/doi/abs/10.1080/02533839.2009.9671580 |
| Volume | 32 |
| WOSCitedRecordID | wos000272526500007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAWR databaseName: Taylor and Francis Online Journals customDbUrl: eissn: 2158-7299 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0026521 issn: 0253-3839 databaseCode: TFW dateStart: 19780101 isFulltext: true titleUrlDefault: https://www.tandfonline.com providerName: Taylor & Francis |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELZQxQADb0R5yQOrIYnzsNkqRMWAKoRa0S3yEyFVadWkiJ-Pz0lKOwADLJES5Szb5_junO--Q-gqlQFlUsXEmoSSOIosEU7thMo4ClMbc6E9z-xjNhiw8Zg_NWjCsoFVQgxta6IIv1fDxy1k2SLibpyZhsCK12yTPM3ChEHU7jx7APUN-y9fpyxQWzdYEkpFaeIzsaAFAk20OT3ftbpmrda4TFesUH_3H_q_h3YaFxT36jWzjzZMcYC2V4gJD9HoGY7hAdmOIVeLFKa6xT3sXHAMMA6nzYlxdx5Bjl1vcbmYmblqKkSUeGqxcyzdGx8VfvXE1qD_IzTq3w_vHkhTgIEot-9URAmnK8aFSbTObOaiHa1FoDRX7qJprGSkYxroLMkkdw9TbVhGpQIK-ygxgh6jTjEtzAnCkbSChm4DSQ2LbSqYZBKGn6VGMWenuyhuJzpXDTs5FMmY5GFLYtrMGhTO5Hkza110vRSb1fQcvwnwVS3mlT8XsXURk5z-KHv6B9kztOX_Q_ksxnPUqeYLc4E21Xv1Vs4v_aL9BGpq5pQ |
| linkProvider | Taylor & Francis |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELYQIAEDb0R5emA1pHEeNluFqIooHVArukXxCyFVadWmiJ-Pz0lKOgADLJES5azY5_h857vvQ-gqEh5lQgbE6JCSwPcNSa3aCRWB34xMwFPlcGa7ca_HhkNer4WBtErwoU0BFOHWavi5IRhdpcTdWDsNnhUv4CZ5FDdDZt32NWCnAwes3375irMAu663gJTyo9DVYkETBNqoqnq-a3bJXi2hmdbsUHvnP3qwi7bLXShuFdNmD63obB9t1bAJD9DgGSLxkNyOoVyLZDq_xS1sd-EYMjmsQkfa3rkkcmw_F8_mEz2VJUnEDI8NtntL-8ZHjl8dtjVMgUM0aN_37zqk5GAg0i49OZGpVRfjqQ6Vik1sHR6lUk8qLu1F0UAKXwXUU3EYC24fRkqzmAoJKPZ-qFN6hFazcaaPEfaFSWnTriGRZoGJUiaYgO7HkZbMmuoGCqqRTmQJUA48GaOkWeGYlqMG3Jk8KUetga4XYpMCoeM3AV5XY5K70IgpeEwS-qPsyR9kL9FGp__UTboPvcdTtOmOpVxR4xlazadzfY7W5Xv-NpteuBn8CQI56rc |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LS8NAEF6kiujBt1ife_C6mmbz2PVW1KBYSpEWewvZlwilLU0q_nxnN2ltD-pBL4GEzJLdmew8duYbhC4j4VEmZECMDikJfN-QDNhOqAj8RmQCnimHM9uK223W7_NOlU2YV2mV1oc2JVCE26vtzz1WZpYRdw1q2jpWvESb5FHcCBl47atgOodWsLvJy1eYxTbX9eaIUn4UulIsOwSxY8yKer4bdkldLYGZLqihZPsfJrCDtiobFDdLodlFK3q4hzYXkAn3Ue_ZxuFtaju2xVpkqIsb3MRgg2ObxwHsHGi4cynkGL4W59OxnsiqRUSORwaDZQlvfBT41SFbWwE4QL3kvnv7QKoODETCxlMQmQGzGM90qFRsYnB3lMo8qbiEi6KBFL4KqKfiMBYcHkZKs5gKaTHs_VBn9BDVhqOhPkLYFyajDdhBIs0CE2VMMGGnH0daMlDUdRTMFjqVFTy57ZIxSBszFNNq1WznTJ5Wq1ZHV3OycYnP8RsBX-RiWrjAiCm7mKT0R9rjP9BeoPXOXZK2HttPJ2jDnUm5isZTVCsmU32G1uR78ZZPzp38fgJIb-lp |
| 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%3Ajournal&rft.genre=article&rft.atitle=Recursive+dual%E2%80%90net%3A+A+new+versatile+network+for+supercomputers+of+the+next+generation&rft.jtitle=Journal+of+the+Chinese+Institute+of+Engineers&rft.au=Li%2C+Yamin&rft.au=Peng%2C+Shietung&rft.au=Chu%2C+Wanming&rft.date=2009-11-01&rft.issn=0253-3839&rft.eissn=2158-7299&rft.volume=32&rft.issue=7&rft.spage=931&rft.epage=938&rft_id=info:doi/10.1080%2F02533839.2009.9671580&rft.externalDBID=n%2Fa&rft.externalDocID=10_1080_02533839_2009_9671580 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0253-3839&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0253-3839&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0253-3839&client=summon |