A 2n matrix hypercube graph: A graph with edges of hypercube improved by a half
This study proposes a new interconnection network that has the same number of nodes in a hypercube graph broadly known as phase of a multicomputer but has edges reduced by a half. As a way of reducing the degree of nodes, node address can be assigned in a form of matrix and edges can be defined by m...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 882 |
|---|---|
| container_issue | |
| container_start_page | 877 |
| container_title | |
| container_volume | 1 |
| creator | Hyun Sim Hyeong-Ok Lee Jae-Cheol Oh |
| description | This study proposes a new interconnection network that has the same number of nodes in a hypercube graph broadly known as phase of a multicomputer but has edges reduced by a half. As a way of reducing the degree of nodes, node address can be assigned in a form of matrix and edges can be defined by means of matrix operations. Degree reduces H/W costs and diameter reduces S/W efficiency. Since an actual effect of S/W cost reduction is insufficient, a H/W cost reduction effect can be maximized by reducing edges by a half. |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4810087</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4810087</ieee_id><sourcerecordid>4810087</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-d0bcd90221a40b26587800db236e2d312dac71b5249eb1dbdeef3d7adbc171c53</originalsourceid><addsrcrecordid>eNpNjMtqwzAQRVXaQtM0X9DN_IBhRrIsqTsT-oJANtkHyRrHKnFjZPfhv-8ihXZ1z4HDvRC31mlNjpSjyz-x6kosyChbuLLUN2I1jm-ISK4yZNxCbGuQ79D7Kadv6OaBc_MRGA7ZD90D1GeArzR1wPHAI5zaf1nqh3z65AhhBg-dP7Z34rr1x5FXv7sUu6fH3fql2GyfX9f1pkgOpyJiaKJDKcmXGGSlrbGIMUhVsYyKZPSNoaBl6ThQDJG5VdH4GBoy1Gi1FPfn28TM-yGn3ud5X1pCtEb9AI8GSu0</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A 2n matrix hypercube graph: A graph with edges of hypercube improved by a half</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Hyun Sim ; Hyeong-Ok Lee ; Jae-Cheol Oh</creator><creatorcontrib>Hyun Sim ; Hyeong-Ok Lee ; Jae-Cheol Oh</creatorcontrib><description>This study proposes a new interconnection network that has the same number of nodes in a hypercube graph broadly known as phase of a multicomputer but has edges reduced by a half. As a way of reducing the degree of nodes, node address can be assigned in a form of matrix and edges can be defined by means of matrix operations. Degree reduces H/W costs and diameter reduces S/W efficiency. Since an actual effect of S/W cost reduction is insufficient, a H/W cost reduction effect can be maximized by reducing edges by a half.</description><identifier>ISSN: 1738-9445</identifier><identifier>ISBN: 8955191383</identifier><identifier>ISBN: 9788955191387</identifier><identifier>EISBN: 8955191391</identifier><identifier>EISBN: 9788955191394</identifier><language>eng</language><publisher>GIRI</publisher><subject>2byN ; Algorithm design and analysis ; Computer networks ; Concurrent computing ; Costs ; edges ; Hypercube ; Hypercubes ; matrix ; Message passing ; Multiprocessor interconnection networks ; Parallel processing ; Predictive models ; Weather forecasting</subject><ispartof>2009 11th International Conference on Advanced Communication Technology, 2009, Vol.1, p.877-882</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4810087$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4810087$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Hyun Sim</creatorcontrib><creatorcontrib>Hyeong-Ok Lee</creatorcontrib><creatorcontrib>Jae-Cheol Oh</creatorcontrib><title>A 2n matrix hypercube graph: A graph with edges of hypercube improved by a half</title><title>2009 11th International Conference on Advanced Communication Technology</title><addtitle>ICACT</addtitle><description>This study proposes a new interconnection network that has the same number of nodes in a hypercube graph broadly known as phase of a multicomputer but has edges reduced by a half. As a way of reducing the degree of nodes, node address can be assigned in a form of matrix and edges can be defined by means of matrix operations. Degree reduces H/W costs and diameter reduces S/W efficiency. Since an actual effect of S/W cost reduction is insufficient, a H/W cost reduction effect can be maximized by reducing edges by a half.</description><subject>2byN</subject><subject>Algorithm design and analysis</subject><subject>Computer networks</subject><subject>Concurrent computing</subject><subject>Costs</subject><subject>edges</subject><subject>Hypercube</subject><subject>Hypercubes</subject><subject>matrix</subject><subject>Message passing</subject><subject>Multiprocessor interconnection networks</subject><subject>Parallel processing</subject><subject>Predictive models</subject><subject>Weather forecasting</subject><issn>1738-9445</issn><isbn>8955191383</isbn><isbn>9788955191387</isbn><isbn>8955191391</isbn><isbn>9788955191394</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2009</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpNjMtqwzAQRVXaQtM0X9DN_IBhRrIsqTsT-oJANtkHyRrHKnFjZPfhv-8ihXZ1z4HDvRC31mlNjpSjyz-x6kosyChbuLLUN2I1jm-ISK4yZNxCbGuQ79D7Kadv6OaBc_MRGA7ZD90D1GeArzR1wPHAI5zaf1nqh3z65AhhBg-dP7Z34rr1x5FXv7sUu6fH3fql2GyfX9f1pkgOpyJiaKJDKcmXGGSlrbGIMUhVsYyKZPSNoaBl6ThQDJG5VdH4GBoy1Gi1FPfn28TM-yGn3ud5X1pCtEb9AI8GSu0</recordid><startdate>200902</startdate><enddate>200902</enddate><creator>Hyun Sim</creator><creator>Hyeong-Ok Lee</creator><creator>Jae-Cheol Oh</creator><general>GIRI</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200902</creationdate><title>A 2n matrix hypercube graph: A graph with edges of hypercube improved by a half</title><author>Hyun Sim ; Hyeong-Ok Lee ; Jae-Cheol Oh</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-d0bcd90221a40b26587800db236e2d312dac71b5249eb1dbdeef3d7adbc171c53</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2009</creationdate><topic>2byN</topic><topic>Algorithm design and analysis</topic><topic>Computer networks</topic><topic>Concurrent computing</topic><topic>Costs</topic><topic>edges</topic><topic>Hypercube</topic><topic>Hypercubes</topic><topic>matrix</topic><topic>Message passing</topic><topic>Multiprocessor interconnection networks</topic><topic>Parallel processing</topic><topic>Predictive models</topic><topic>Weather forecasting</topic><toplevel>online_resources</toplevel><creatorcontrib>Hyun Sim</creatorcontrib><creatorcontrib>Hyeong-Ok Lee</creatorcontrib><creatorcontrib>Jae-Cheol Oh</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Xplore</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Hyun Sim</au><au>Hyeong-Ok Lee</au><au>Jae-Cheol Oh</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A 2n matrix hypercube graph: A graph with edges of hypercube improved by a half</atitle><btitle>2009 11th International Conference on Advanced Communication Technology</btitle><stitle>ICACT</stitle><date>2009-02</date><risdate>2009</risdate><volume>1</volume><spage>877</spage><epage>882</epage><pages>877-882</pages><issn>1738-9445</issn><isbn>8955191383</isbn><isbn>9788955191387</isbn><eisbn>8955191391</eisbn><eisbn>9788955191394</eisbn><abstract>This study proposes a new interconnection network that has the same number of nodes in a hypercube graph broadly known as phase of a multicomputer but has edges reduced by a half. As a way of reducing the degree of nodes, node address can be assigned in a form of matrix and edges can be defined by means of matrix operations. Degree reduces H/W costs and diameter reduces S/W efficiency. Since an actual effect of S/W cost reduction is insufficient, a H/W cost reduction effect can be maximized by reducing edges by a half.</abstract><pub>GIRI</pub><tpages>6</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1738-9445 |
| ispartof | 2009 11th International Conference on Advanced Communication Technology, 2009, Vol.1, p.877-882 |
| issn | 1738-9445 |
| language | eng |
| recordid | cdi_ieee_primary_4810087 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | 2byN Algorithm design and analysis Computer networks Concurrent computing Costs edges Hypercube Hypercubes matrix Message passing Multiprocessor interconnection networks Parallel processing Predictive models Weather forecasting |
| title | A 2n matrix hypercube graph: A graph with edges of hypercube improved by a half |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-04T17%3A16%3A00IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%202n%20matrix%20hypercube%20graph:%20A%20graph%20with%20edges%20of%20hypercube%20improved%20by%20a%20half&rft.btitle=2009%2011th%20International%20Conference%20on%20Advanced%20Communication%20Technology&rft.au=Hyun%20Sim&rft.date=2009-02&rft.volume=1&rft.spage=877&rft.epage=882&rft.pages=877-882&rft.issn=1738-9445&rft.isbn=8955191383&rft.isbn_list=9788955191387&rft_id=info:doi/&rft_dat=%3Cieee_6IE%3E4810087%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=8955191391&rft.eisbn_list=9788955191394&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4810087&rfr_iscdi=true |