Dense Gaussian Networks: Suitable Topologies for On-Chip Multiprocessors
This paper explores the suitability of dense circulant graphs of degree four for the design of on-chip interconnection networks. Networks based on these graphs reduce the Torus diameter in a factor $$\sqrt{2}$$, which translates into significant performance gains for unicast traffic. In addition, th...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Martínez, Carmen [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2006 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer Science+Business Media, Inc. 2006 |
|---|
| Übergeordnetes Werk: |
Enthalten in: International journal of parallel programming - Springer US, 1986, 34(2006), 3 vom: Juni, Seite 193-211 |
|---|---|
| Übergeordnetes Werk: |
volume:34 ; year:2006 ; number:3 ; month:06 ; pages:193-211 |
| Links: |
|---|
| DOI / URN: |
10.1007/s10766-006-0014-1 |
|---|
| Katalog-ID: |
OLC204460261X |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC204460261X | ||
| 003 | DE-627 | ||
| 005 | 20230503080837.0 | ||
| 007 | tu | ||
| 008 | 200820s2006 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s10766-006-0014-1 |2 doi | |
| 035 | |a (DE-627)OLC204460261X | ||
| 035 | |a (DE-He213)s10766-006-0014-1-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 070 |a 004 |q VZ |
| 100 | 1 | |a Martínez, Carmen |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Dense Gaussian Networks: Suitable Topologies for On-Chip Multiprocessors |
| 264 | 1 | |c 2006 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer Science+Business Media, Inc. 2006 | ||
| 520 | |a This paper explores the suitability of dense circulant graphs of degree four for the design of on-chip interconnection networks. Networks based on these graphs reduce the Torus diameter in a factor $$\sqrt{2}$$, which translates into significant performance gains for unicast traffic. In addition, they are clearly superior to Tori when managing collective communications. This paper introduces a new two-dimensional node’s labeling of the networks explored which simplifies their analysis and exploitation. In particular, it provides simple and optimal solutions to two important architectural issues: routing and broadcasting. Other implementation issues such as network folding and scalability by using hierarchical networks are also explored in this work. | ||
| 650 | 4 | |a On-chip networks | |
| 650 | 4 | |a topology | |
| 650 | 4 | |a lay-out | |
| 650 | 4 | |a routing | |
| 650 | 4 | |a broadcasting | |
| 650 | 4 | |a circulant graphs | |
| 700 | 1 | |a Vallejo, Enrique |4 aut | |
| 700 | 1 | |a Beivide, Ramón |4 aut | |
| 700 | 1 | |a Izu, Cruz |4 aut | |
| 700 | 1 | |a Moretó, Miquel |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t International journal of parallel programming |d Springer US, 1986 |g 34(2006), 3 vom: Juni, Seite 193-211 |w (DE-627)129622028 |w (DE-600)246656-9 |w (DE-576)015131793 |x 0885-7458 |7 nnns |
| 773 | 1 | 8 | |g volume:34 |g year:2006 |g number:3 |g month:06 |g pages:193-211 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s10766-006-0014-1 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a SSG-OPC-BBI | ||
| 912 | |a GBV_ILN_22 | ||
| 912 | |a GBV_ILN_31 | ||
| 912 | |a GBV_ILN_40 | ||
| 912 | |a GBV_ILN_62 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_2005 | ||
| 912 | |a GBV_ILN_2021 | ||
| 912 | |a GBV_ILN_4317 | ||
| 912 | |a GBV_ILN_4318 | ||
| 912 | |a GBV_ILN_4323 | ||
| 912 | |a GBV_ILN_4324 | ||
| 912 | |a GBV_ILN_4700 | ||
| 951 | |a AR | ||
| 952 | |d 34 |j 2006 |e 3 |c 06 |h 193-211 | ||
| author_variant |
c m cm e v ev r b rb c i ci m m mm |
|---|---|
| matchkey_str |
article:08857458:2006----::esgusantoksialtplgefrn |
| hierarchy_sort_str |
2006 |
| publishDate |
2006 |
| allfields |
10.1007/s10766-006-0014-1 doi (DE-627)OLC204460261X (DE-He213)s10766-006-0014-1-p DE-627 ger DE-627 rakwb eng 070 004 VZ Martínez, Carmen verfasserin aut Dense Gaussian Networks: Suitable Topologies for On-Chip Multiprocessors 2006 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, Inc. 2006 This paper explores the suitability of dense circulant graphs of degree four for the design of on-chip interconnection networks. Networks based on these graphs reduce the Torus diameter in a factor $$\sqrt{2}$$, which translates into significant performance gains for unicast traffic. In addition, they are clearly superior to Tori when managing collective communications. This paper introduces a new two-dimensional node’s labeling of the networks explored which simplifies their analysis and exploitation. In particular, it provides simple and optimal solutions to two important architectural issues: routing and broadcasting. Other implementation issues such as network folding and scalability by using hierarchical networks are also explored in this work. On-chip networks topology lay-out routing broadcasting circulant graphs Vallejo, Enrique aut Beivide, Ramón aut Izu, Cruz aut Moretó, Miquel aut Enthalten in International journal of parallel programming Springer US, 1986 34(2006), 3 vom: Juni, Seite 193-211 (DE-627)129622028 (DE-600)246656-9 (DE-576)015131793 0885-7458 nnns volume:34 year:2006 number:3 month:06 pages:193-211 https://doi.org/10.1007/s10766-006-0014-1 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-BBI GBV_ILN_22 GBV_ILN_31 GBV_ILN_40 GBV_ILN_62 GBV_ILN_70 GBV_ILN_2005 GBV_ILN_2021 GBV_ILN_4317 GBV_ILN_4318 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4700 AR 34 2006 3 06 193-211 |
| spelling |
10.1007/s10766-006-0014-1 doi (DE-627)OLC204460261X (DE-He213)s10766-006-0014-1-p DE-627 ger DE-627 rakwb eng 070 004 VZ Martínez, Carmen verfasserin aut Dense Gaussian Networks: Suitable Topologies for On-Chip Multiprocessors 2006 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, Inc. 2006 This paper explores the suitability of dense circulant graphs of degree four for the design of on-chip interconnection networks. Networks based on these graphs reduce the Torus diameter in a factor $$\sqrt{2}$$, which translates into significant performance gains for unicast traffic. In addition, they are clearly superior to Tori when managing collective communications. This paper introduces a new two-dimensional node’s labeling of the networks explored which simplifies their analysis and exploitation. In particular, it provides simple and optimal solutions to two important architectural issues: routing and broadcasting. Other implementation issues such as network folding and scalability by using hierarchical networks are also explored in this work. On-chip networks topology lay-out routing broadcasting circulant graphs Vallejo, Enrique aut Beivide, Ramón aut Izu, Cruz aut Moretó, Miquel aut Enthalten in International journal of parallel programming Springer US, 1986 34(2006), 3 vom: Juni, Seite 193-211 (DE-627)129622028 (DE-600)246656-9 (DE-576)015131793 0885-7458 nnns volume:34 year:2006 number:3 month:06 pages:193-211 https://doi.org/10.1007/s10766-006-0014-1 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-BBI GBV_ILN_22 GBV_ILN_31 GBV_ILN_40 GBV_ILN_62 GBV_ILN_70 GBV_ILN_2005 GBV_ILN_2021 GBV_ILN_4317 GBV_ILN_4318 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4700 AR 34 2006 3 06 193-211 |
| allfields_unstemmed |
10.1007/s10766-006-0014-1 doi (DE-627)OLC204460261X (DE-He213)s10766-006-0014-1-p DE-627 ger DE-627 rakwb eng 070 004 VZ Martínez, Carmen verfasserin aut Dense Gaussian Networks: Suitable Topologies for On-Chip Multiprocessors 2006 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, Inc. 2006 This paper explores the suitability of dense circulant graphs of degree four for the design of on-chip interconnection networks. Networks based on these graphs reduce the Torus diameter in a factor $$\sqrt{2}$$, which translates into significant performance gains for unicast traffic. In addition, they are clearly superior to Tori when managing collective communications. This paper introduces a new two-dimensional node’s labeling of the networks explored which simplifies their analysis and exploitation. In particular, it provides simple and optimal solutions to two important architectural issues: routing and broadcasting. Other implementation issues such as network folding and scalability by using hierarchical networks are also explored in this work. On-chip networks topology lay-out routing broadcasting circulant graphs Vallejo, Enrique aut Beivide, Ramón aut Izu, Cruz aut Moretó, Miquel aut Enthalten in International journal of parallel programming Springer US, 1986 34(2006), 3 vom: Juni, Seite 193-211 (DE-627)129622028 (DE-600)246656-9 (DE-576)015131793 0885-7458 nnns volume:34 year:2006 number:3 month:06 pages:193-211 https://doi.org/10.1007/s10766-006-0014-1 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-BBI GBV_ILN_22 GBV_ILN_31 GBV_ILN_40 GBV_ILN_62 GBV_ILN_70 GBV_ILN_2005 GBV_ILN_2021 GBV_ILN_4317 GBV_ILN_4318 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4700 AR 34 2006 3 06 193-211 |
| allfieldsGer |
10.1007/s10766-006-0014-1 doi (DE-627)OLC204460261X (DE-He213)s10766-006-0014-1-p DE-627 ger DE-627 rakwb eng 070 004 VZ Martínez, Carmen verfasserin aut Dense Gaussian Networks: Suitable Topologies for On-Chip Multiprocessors 2006 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, Inc. 2006 This paper explores the suitability of dense circulant graphs of degree four for the design of on-chip interconnection networks. Networks based on these graphs reduce the Torus diameter in a factor $$\sqrt{2}$$, which translates into significant performance gains for unicast traffic. In addition, they are clearly superior to Tori when managing collective communications. This paper introduces a new two-dimensional node’s labeling of the networks explored which simplifies their analysis and exploitation. In particular, it provides simple and optimal solutions to two important architectural issues: routing and broadcasting. Other implementation issues such as network folding and scalability by using hierarchical networks are also explored in this work. On-chip networks topology lay-out routing broadcasting circulant graphs Vallejo, Enrique aut Beivide, Ramón aut Izu, Cruz aut Moretó, Miquel aut Enthalten in International journal of parallel programming Springer US, 1986 34(2006), 3 vom: Juni, Seite 193-211 (DE-627)129622028 (DE-600)246656-9 (DE-576)015131793 0885-7458 nnns volume:34 year:2006 number:3 month:06 pages:193-211 https://doi.org/10.1007/s10766-006-0014-1 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-BBI GBV_ILN_22 GBV_ILN_31 GBV_ILN_40 GBV_ILN_62 GBV_ILN_70 GBV_ILN_2005 GBV_ILN_2021 GBV_ILN_4317 GBV_ILN_4318 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4700 AR 34 2006 3 06 193-211 |
| allfieldsSound |
10.1007/s10766-006-0014-1 doi (DE-627)OLC204460261X (DE-He213)s10766-006-0014-1-p DE-627 ger DE-627 rakwb eng 070 004 VZ Martínez, Carmen verfasserin aut Dense Gaussian Networks: Suitable Topologies for On-Chip Multiprocessors 2006 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, Inc. 2006 This paper explores the suitability of dense circulant graphs of degree four for the design of on-chip interconnection networks. Networks based on these graphs reduce the Torus diameter in a factor $$\sqrt{2}$$, which translates into significant performance gains for unicast traffic. In addition, they are clearly superior to Tori when managing collective communications. This paper introduces a new two-dimensional node’s labeling of the networks explored which simplifies their analysis and exploitation. In particular, it provides simple and optimal solutions to two important architectural issues: routing and broadcasting. Other implementation issues such as network folding and scalability by using hierarchical networks are also explored in this work. On-chip networks topology lay-out routing broadcasting circulant graphs Vallejo, Enrique aut Beivide, Ramón aut Izu, Cruz aut Moretó, Miquel aut Enthalten in International journal of parallel programming Springer US, 1986 34(2006), 3 vom: Juni, Seite 193-211 (DE-627)129622028 (DE-600)246656-9 (DE-576)015131793 0885-7458 nnns volume:34 year:2006 number:3 month:06 pages:193-211 https://doi.org/10.1007/s10766-006-0014-1 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-BBI GBV_ILN_22 GBV_ILN_31 GBV_ILN_40 GBV_ILN_62 GBV_ILN_70 GBV_ILN_2005 GBV_ILN_2021 GBV_ILN_4317 GBV_ILN_4318 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4700 AR 34 2006 3 06 193-211 |
| language |
English |
| source |
Enthalten in International journal of parallel programming 34(2006), 3 vom: Juni, Seite 193-211 volume:34 year:2006 number:3 month:06 pages:193-211 |
| sourceStr |
Enthalten in International journal of parallel programming 34(2006), 3 vom: Juni, Seite 193-211 volume:34 year:2006 number:3 month:06 pages:193-211 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
On-chip networks topology lay-out routing broadcasting circulant graphs |
| dewey-raw |
070 |
| isfreeaccess_bool |
false |
| container_title |
International journal of parallel programming |
| authorswithroles_txt_mv |
Martínez, Carmen @@aut@@ Vallejo, Enrique @@aut@@ Beivide, Ramón @@aut@@ Izu, Cruz @@aut@@ Moretó, Miquel @@aut@@ |
| publishDateDaySort_date |
2006-06-01T00:00:00Z |
| hierarchy_top_id |
129622028 |
| dewey-sort |
270 |
| id |
OLC204460261X |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC204460261X</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503080837.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2006 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10766-006-0014-1</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC204460261X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10766-006-0014-1-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">070</subfield><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Martínez, Carmen</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Dense Gaussian Networks: Suitable Topologies for On-Chip Multiprocessors</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2006</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media, Inc. 2006</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This paper explores the suitability of dense circulant graphs of degree four for the design of on-chip interconnection networks. Networks based on these graphs reduce the Torus diameter in a factor $$\sqrt{2}$$, which translates into significant performance gains for unicast traffic. In addition, they are clearly superior to Tori when managing collective communications. This paper introduces a new two-dimensional node’s labeling of the networks explored which simplifies their analysis and exploitation. In particular, it provides simple and optimal solutions to two important architectural issues: routing and broadcasting. Other implementation issues such as network folding and scalability by using hierarchical networks are also explored in this work.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">On-chip networks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">topology</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">lay-out</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">routing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">broadcasting</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">circulant graphs</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Vallejo, Enrique</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Beivide, Ramón</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Izu, Cruz</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Moretó, Miquel</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">International journal of parallel programming</subfield><subfield code="d">Springer US, 1986</subfield><subfield code="g">34(2006), 3 vom: Juni, Seite 193-211</subfield><subfield code="w">(DE-627)129622028</subfield><subfield code="w">(DE-600)246656-9</subfield><subfield code="w">(DE-576)015131793</subfield><subfield code="x">0885-7458</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:34</subfield><subfield code="g">year:2006</subfield><subfield code="g">number:3</subfield><subfield code="g">month:06</subfield><subfield code="g">pages:193-211</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10766-006-0014-1</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-BBI</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4317</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">34</subfield><subfield code="j">2006</subfield><subfield code="e">3</subfield><subfield code="c">06</subfield><subfield code="h">193-211</subfield></datafield></record></collection>
|
| author |
Martínez, Carmen |
| spellingShingle |
Martínez, Carmen ddc 070 misc On-chip networks misc topology misc lay-out misc routing misc broadcasting misc circulant graphs Dense Gaussian Networks: Suitable Topologies for On-Chip Multiprocessors |
| authorStr |
Martínez, Carmen |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)129622028 |
| format |
Article |
| dewey-ones |
070 - News media, journalism & publishing 004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut aut aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0885-7458 |
| topic_title |
070 004 VZ Dense Gaussian Networks: Suitable Topologies for On-Chip Multiprocessors On-chip networks topology lay-out routing broadcasting circulant graphs |
| topic |
ddc 070 misc On-chip networks misc topology misc lay-out misc routing misc broadcasting misc circulant graphs |
| topic_unstemmed |
ddc 070 misc On-chip networks misc topology misc lay-out misc routing misc broadcasting misc circulant graphs |
| topic_browse |
ddc 070 misc On-chip networks misc topology misc lay-out misc routing misc broadcasting misc circulant graphs |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
International journal of parallel programming |
| hierarchy_parent_id |
129622028 |
| dewey-tens |
070 - News media, journalism & publishing 000 - Computer science, knowledge & systems |
| hierarchy_top_title |
International journal of parallel programming |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)129622028 (DE-600)246656-9 (DE-576)015131793 |
| title |
Dense Gaussian Networks: Suitable Topologies for On-Chip Multiprocessors |
| ctrlnum |
(DE-627)OLC204460261X (DE-He213)s10766-006-0014-1-p |
| title_full |
Dense Gaussian Networks: Suitable Topologies for On-Chip Multiprocessors |
| author_sort |
Martínez, Carmen |
| journal |
International journal of parallel programming |
| journalStr |
International journal of parallel programming |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2006 |
| contenttype_str_mv |
txt |
| container_start_page |
193 |
| author_browse |
Martínez, Carmen Vallejo, Enrique Beivide, Ramón Izu, Cruz Moretó, Miquel |
| container_volume |
34 |
| class |
070 004 VZ |
| format_se |
Aufsätze |
| author-letter |
Martínez, Carmen |
| doi_str_mv |
10.1007/s10766-006-0014-1 |
| dewey-full |
070 004 |
| title_sort |
dense gaussian networks: suitable topologies for on-chip multiprocessors |
| title_auth |
Dense Gaussian Networks: Suitable Topologies for On-Chip Multiprocessors |
| abstract |
This paper explores the suitability of dense circulant graphs of degree four for the design of on-chip interconnection networks. Networks based on these graphs reduce the Torus diameter in a factor $$\sqrt{2}$$, which translates into significant performance gains for unicast traffic. In addition, they are clearly superior to Tori when managing collective communications. This paper introduces a new two-dimensional node’s labeling of the networks explored which simplifies their analysis and exploitation. In particular, it provides simple and optimal solutions to two important architectural issues: routing and broadcasting. Other implementation issues such as network folding and scalability by using hierarchical networks are also explored in this work. © Springer Science+Business Media, Inc. 2006 |
| abstractGer |
This paper explores the suitability of dense circulant graphs of degree four for the design of on-chip interconnection networks. Networks based on these graphs reduce the Torus diameter in a factor $$\sqrt{2}$$, which translates into significant performance gains for unicast traffic. In addition, they are clearly superior to Tori when managing collective communications. This paper introduces a new two-dimensional node’s labeling of the networks explored which simplifies their analysis and exploitation. In particular, it provides simple and optimal solutions to two important architectural issues: routing and broadcasting. Other implementation issues such as network folding and scalability by using hierarchical networks are also explored in this work. © Springer Science+Business Media, Inc. 2006 |
| abstract_unstemmed |
This paper explores the suitability of dense circulant graphs of degree four for the design of on-chip interconnection networks. Networks based on these graphs reduce the Torus diameter in a factor $$\sqrt{2}$$, which translates into significant performance gains for unicast traffic. In addition, they are clearly superior to Tori when managing collective communications. This paper introduces a new two-dimensional node’s labeling of the networks explored which simplifies their analysis and exploitation. In particular, it provides simple and optimal solutions to two important architectural issues: routing and broadcasting. Other implementation issues such as network folding and scalability by using hierarchical networks are also explored in this work. © Springer Science+Business Media, Inc. 2006 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-BBI GBV_ILN_22 GBV_ILN_31 GBV_ILN_40 GBV_ILN_62 GBV_ILN_70 GBV_ILN_2005 GBV_ILN_2021 GBV_ILN_4317 GBV_ILN_4318 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4700 |
| container_issue |
3 |
| title_short |
Dense Gaussian Networks: Suitable Topologies for On-Chip Multiprocessors |
| url |
https://doi.org/10.1007/s10766-006-0014-1 |
| remote_bool |
false |
| author2 |
Vallejo, Enrique Beivide, Ramón Izu, Cruz Moretó, Miquel |
| author2Str |
Vallejo, Enrique Beivide, Ramón Izu, Cruz Moretó, Miquel |
| ppnlink |
129622028 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s10766-006-0014-1 |
| up_date |
2024-07-04T00:07:23.984Z |
| _version_ |
1803604872646361088 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC204460261X</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503080837.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2006 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10766-006-0014-1</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC204460261X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10766-006-0014-1-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">070</subfield><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Martínez, Carmen</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Dense Gaussian Networks: Suitable Topologies for On-Chip Multiprocessors</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2006</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media, Inc. 2006</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This paper explores the suitability of dense circulant graphs of degree four for the design of on-chip interconnection networks. Networks based on these graphs reduce the Torus diameter in a factor $$\sqrt{2}$$, which translates into significant performance gains for unicast traffic. In addition, they are clearly superior to Tori when managing collective communications. This paper introduces a new two-dimensional node’s labeling of the networks explored which simplifies their analysis and exploitation. In particular, it provides simple and optimal solutions to two important architectural issues: routing and broadcasting. Other implementation issues such as network folding and scalability by using hierarchical networks are also explored in this work.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">On-chip networks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">topology</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">lay-out</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">routing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">broadcasting</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">circulant graphs</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Vallejo, Enrique</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Beivide, Ramón</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Izu, Cruz</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Moretó, Miquel</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">International journal of parallel programming</subfield><subfield code="d">Springer US, 1986</subfield><subfield code="g">34(2006), 3 vom: Juni, Seite 193-211</subfield><subfield code="w">(DE-627)129622028</subfield><subfield code="w">(DE-600)246656-9</subfield><subfield code="w">(DE-576)015131793</subfield><subfield code="x">0885-7458</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:34</subfield><subfield code="g">year:2006</subfield><subfield code="g">number:3</subfield><subfield code="g">month:06</subfield><subfield code="g">pages:193-211</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10766-006-0014-1</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-BBI</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4317</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">34</subfield><subfield code="j">2006</subfield><subfield code="e">3</subfield><subfield code="c">06</subfield><subfield code="h">193-211</subfield></datafield></record></collection>
|
| score |
7.3995953 |