Embedded connectivity of some BC networks
Abstract Many interconnection networks in large-scale parallel computing have hierarchical and recursive structures. The presence of vertex failures may disconnect the entire network, but every fault-free processor still lies in an undamaged sub-network, which is a smaller network with the same topo...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Zhao, Ying-Ze [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2022 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022 |
|---|
| Übergeordnetes Werk: |
Enthalten in: The journal of supercomputing - Springer US, 1987, 78(2022), 14 vom: 09. Mai, Seite 16605-16618 |
|---|---|
| Übergeordnetes Werk: |
volume:78 ; year:2022 ; number:14 ; day:09 ; month:05 ; pages:16605-16618 |
| Links: |
|---|
| DOI / URN: |
10.1007/s11227-022-04522-3 |
|---|
| Katalog-ID: |
OLC2079484338 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2079484338 | ||
| 003 | DE-627 | ||
| 005 | 20230506062948.0 | ||
| 007 | tu | ||
| 008 | 221220s2022 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s11227-022-04522-3 |2 doi | |
| 035 | |a (DE-627)OLC2079484338 | ||
| 035 | |a (DE-He213)s11227-022-04522-3-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |a 620 |q VZ |
| 100 | 1 | |a Zhao, Ying-Ze |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Embedded connectivity of some BC networks |
| 264 | 1 | |c 2022 | |
| 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 © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022 | ||
| 520 | |a Abstract Many interconnection networks in large-scale parallel computing have hierarchical and recursive structures. The presence of vertex failures may disconnect the entire network, but every fault-free processor still lies in an undamaged sub-network, which is a smaller network with the same topological properties as the original one. For an n-dimensional recursive network $$G_{n}$$, the h-embedded connectivity $$\zeta _{h}$$ of $$G_{n}$$ is the minimum number of vertices whose removal disconnects $$G_n$$ and each vertex in the resulting network is contained in an h-dimensional undamaged sub-network. The bijective connection networks (BC networks for short) are a class of cube-based networks. They have recursive structures and contain many known networks, such as the hypercube, the Crossed cube, and the Möbius cube. This paper focuses on the structures of the Crossed cube and the Möbius cube. We prove that these two networks are generalized product graphs, using these results to determine the $$\zeta _{h}$$ of them for $$h\le n-2$$. | ||
| 650 | 4 | |a Embedded connectivity | |
| 650 | 4 | |a Fault-tolerance | |
| 650 | 4 | |a BC network | |
| 650 | 4 | |a Crossed cube | |
| 650 | 4 | |a Möbius cube | |
| 650 | 4 | |a Generalized product | |
| 700 | 1 | |a Li, Xiang-Jun |0 (orcid)0000-0003-1194-1124 |4 aut | |
| 700 | 1 | |a Ma, Meijie |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t The journal of supercomputing |d Springer US, 1987 |g 78(2022), 14 vom: 09. Mai, Seite 16605-16618 |w (DE-627)13046466X |w (DE-600)740510-8 |w (DE-576)018667775 |x 0920-8542 |7 nnns |
| 773 | 1 | 8 | |g volume:78 |g year:2022 |g number:14 |g day:09 |g month:05 |g pages:16605-16618 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s11227-022-04522-3 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-TEC | ||
| 912 | |a SSG-OLC-MAT | ||
| 951 | |a AR | ||
| 952 | |d 78 |j 2022 |e 14 |b 09 |c 05 |h 16605-16618 | ||
| author_variant |
y z z yzz x j l xjl m m mm |
|---|---|
| matchkey_str |
article:09208542:2022----::meddonciiyfoe |
| hierarchy_sort_str |
2022 |
| publishDate |
2022 |
| allfields |
10.1007/s11227-022-04522-3 doi (DE-627)OLC2079484338 (DE-He213)s11227-022-04522-3-p DE-627 ger DE-627 rakwb eng 004 620 VZ Zhao, Ying-Ze verfasserin aut Embedded connectivity of some BC networks 2022 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022 Abstract Many interconnection networks in large-scale parallel computing have hierarchical and recursive structures. The presence of vertex failures may disconnect the entire network, but every fault-free processor still lies in an undamaged sub-network, which is a smaller network with the same topological properties as the original one. For an n-dimensional recursive network $$G_{n}$$, the h-embedded connectivity $$\zeta _{h}$$ of $$G_{n}$$ is the minimum number of vertices whose removal disconnects $$G_n$$ and each vertex in the resulting network is contained in an h-dimensional undamaged sub-network. The bijective connection networks (BC networks for short) are a class of cube-based networks. They have recursive structures and contain many known networks, such as the hypercube, the Crossed cube, and the Möbius cube. This paper focuses on the structures of the Crossed cube and the Möbius cube. We prove that these two networks are generalized product graphs, using these results to determine the $$\zeta _{h}$$ of them for $$h\le n-2$$. Embedded connectivity Fault-tolerance BC network Crossed cube Möbius cube Generalized product Li, Xiang-Jun (orcid)0000-0003-1194-1124 aut Ma, Meijie aut Enthalten in The journal of supercomputing Springer US, 1987 78(2022), 14 vom: 09. Mai, Seite 16605-16618 (DE-627)13046466X (DE-600)740510-8 (DE-576)018667775 0920-8542 nnns volume:78 year:2022 number:14 day:09 month:05 pages:16605-16618 https://doi.org/10.1007/s11227-022-04522-3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT AR 78 2022 14 09 05 16605-16618 |
| spelling |
10.1007/s11227-022-04522-3 doi (DE-627)OLC2079484338 (DE-He213)s11227-022-04522-3-p DE-627 ger DE-627 rakwb eng 004 620 VZ Zhao, Ying-Ze verfasserin aut Embedded connectivity of some BC networks 2022 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022 Abstract Many interconnection networks in large-scale parallel computing have hierarchical and recursive structures. The presence of vertex failures may disconnect the entire network, but every fault-free processor still lies in an undamaged sub-network, which is a smaller network with the same topological properties as the original one. For an n-dimensional recursive network $$G_{n}$$, the h-embedded connectivity $$\zeta _{h}$$ of $$G_{n}$$ is the minimum number of vertices whose removal disconnects $$G_n$$ and each vertex in the resulting network is contained in an h-dimensional undamaged sub-network. The bijective connection networks (BC networks for short) are a class of cube-based networks. They have recursive structures and contain many known networks, such as the hypercube, the Crossed cube, and the Möbius cube. This paper focuses on the structures of the Crossed cube and the Möbius cube. We prove that these two networks are generalized product graphs, using these results to determine the $$\zeta _{h}$$ of them for $$h\le n-2$$. Embedded connectivity Fault-tolerance BC network Crossed cube Möbius cube Generalized product Li, Xiang-Jun (orcid)0000-0003-1194-1124 aut Ma, Meijie aut Enthalten in The journal of supercomputing Springer US, 1987 78(2022), 14 vom: 09. Mai, Seite 16605-16618 (DE-627)13046466X (DE-600)740510-8 (DE-576)018667775 0920-8542 nnns volume:78 year:2022 number:14 day:09 month:05 pages:16605-16618 https://doi.org/10.1007/s11227-022-04522-3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT AR 78 2022 14 09 05 16605-16618 |
| allfields_unstemmed |
10.1007/s11227-022-04522-3 doi (DE-627)OLC2079484338 (DE-He213)s11227-022-04522-3-p DE-627 ger DE-627 rakwb eng 004 620 VZ Zhao, Ying-Ze verfasserin aut Embedded connectivity of some BC networks 2022 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022 Abstract Many interconnection networks in large-scale parallel computing have hierarchical and recursive structures. The presence of vertex failures may disconnect the entire network, but every fault-free processor still lies in an undamaged sub-network, which is a smaller network with the same topological properties as the original one. For an n-dimensional recursive network $$G_{n}$$, the h-embedded connectivity $$\zeta _{h}$$ of $$G_{n}$$ is the minimum number of vertices whose removal disconnects $$G_n$$ and each vertex in the resulting network is contained in an h-dimensional undamaged sub-network. The bijective connection networks (BC networks for short) are a class of cube-based networks. They have recursive structures and contain many known networks, such as the hypercube, the Crossed cube, and the Möbius cube. This paper focuses on the structures of the Crossed cube and the Möbius cube. We prove that these two networks are generalized product graphs, using these results to determine the $$\zeta _{h}$$ of them for $$h\le n-2$$. Embedded connectivity Fault-tolerance BC network Crossed cube Möbius cube Generalized product Li, Xiang-Jun (orcid)0000-0003-1194-1124 aut Ma, Meijie aut Enthalten in The journal of supercomputing Springer US, 1987 78(2022), 14 vom: 09. Mai, Seite 16605-16618 (DE-627)13046466X (DE-600)740510-8 (DE-576)018667775 0920-8542 nnns volume:78 year:2022 number:14 day:09 month:05 pages:16605-16618 https://doi.org/10.1007/s11227-022-04522-3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT AR 78 2022 14 09 05 16605-16618 |
| allfieldsGer |
10.1007/s11227-022-04522-3 doi (DE-627)OLC2079484338 (DE-He213)s11227-022-04522-3-p DE-627 ger DE-627 rakwb eng 004 620 VZ Zhao, Ying-Ze verfasserin aut Embedded connectivity of some BC networks 2022 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022 Abstract Many interconnection networks in large-scale parallel computing have hierarchical and recursive structures. The presence of vertex failures may disconnect the entire network, but every fault-free processor still lies in an undamaged sub-network, which is a smaller network with the same topological properties as the original one. For an n-dimensional recursive network $$G_{n}$$, the h-embedded connectivity $$\zeta _{h}$$ of $$G_{n}$$ is the minimum number of vertices whose removal disconnects $$G_n$$ and each vertex in the resulting network is contained in an h-dimensional undamaged sub-network. The bijective connection networks (BC networks for short) are a class of cube-based networks. They have recursive structures and contain many known networks, such as the hypercube, the Crossed cube, and the Möbius cube. This paper focuses on the structures of the Crossed cube and the Möbius cube. We prove that these two networks are generalized product graphs, using these results to determine the $$\zeta _{h}$$ of them for $$h\le n-2$$. Embedded connectivity Fault-tolerance BC network Crossed cube Möbius cube Generalized product Li, Xiang-Jun (orcid)0000-0003-1194-1124 aut Ma, Meijie aut Enthalten in The journal of supercomputing Springer US, 1987 78(2022), 14 vom: 09. Mai, Seite 16605-16618 (DE-627)13046466X (DE-600)740510-8 (DE-576)018667775 0920-8542 nnns volume:78 year:2022 number:14 day:09 month:05 pages:16605-16618 https://doi.org/10.1007/s11227-022-04522-3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT AR 78 2022 14 09 05 16605-16618 |
| allfieldsSound |
10.1007/s11227-022-04522-3 doi (DE-627)OLC2079484338 (DE-He213)s11227-022-04522-3-p DE-627 ger DE-627 rakwb eng 004 620 VZ Zhao, Ying-Ze verfasserin aut Embedded connectivity of some BC networks 2022 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022 Abstract Many interconnection networks in large-scale parallel computing have hierarchical and recursive structures. The presence of vertex failures may disconnect the entire network, but every fault-free processor still lies in an undamaged sub-network, which is a smaller network with the same topological properties as the original one. For an n-dimensional recursive network $$G_{n}$$, the h-embedded connectivity $$\zeta _{h}$$ of $$G_{n}$$ is the minimum number of vertices whose removal disconnects $$G_n$$ and each vertex in the resulting network is contained in an h-dimensional undamaged sub-network. The bijective connection networks (BC networks for short) are a class of cube-based networks. They have recursive structures and contain many known networks, such as the hypercube, the Crossed cube, and the Möbius cube. This paper focuses on the structures of the Crossed cube and the Möbius cube. We prove that these two networks are generalized product graphs, using these results to determine the $$\zeta _{h}$$ of them for $$h\le n-2$$. Embedded connectivity Fault-tolerance BC network Crossed cube Möbius cube Generalized product Li, Xiang-Jun (orcid)0000-0003-1194-1124 aut Ma, Meijie aut Enthalten in The journal of supercomputing Springer US, 1987 78(2022), 14 vom: 09. Mai, Seite 16605-16618 (DE-627)13046466X (DE-600)740510-8 (DE-576)018667775 0920-8542 nnns volume:78 year:2022 number:14 day:09 month:05 pages:16605-16618 https://doi.org/10.1007/s11227-022-04522-3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT AR 78 2022 14 09 05 16605-16618 |
| language |
English |
| source |
Enthalten in The journal of supercomputing 78(2022), 14 vom: 09. Mai, Seite 16605-16618 volume:78 year:2022 number:14 day:09 month:05 pages:16605-16618 |
| sourceStr |
Enthalten in The journal of supercomputing 78(2022), 14 vom: 09. Mai, Seite 16605-16618 volume:78 year:2022 number:14 day:09 month:05 pages:16605-16618 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Embedded connectivity Fault-tolerance BC network Crossed cube Möbius cube Generalized product |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
The journal of supercomputing |
| authorswithroles_txt_mv |
Zhao, Ying-Ze @@aut@@ Li, Xiang-Jun @@aut@@ Ma, Meijie @@aut@@ |
| publishDateDaySort_date |
2022-05-09T00:00:00Z |
| hierarchy_top_id |
13046466X |
| dewey-sort |
14 |
| id |
OLC2079484338 |
| 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">OLC2079484338</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230506062948.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">221220s2022 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11227-022-04522-3</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2079484338</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11227-022-04522-3-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">004</subfield><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Zhao, Ying-Ze</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Embedded connectivity of some BC networks</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2022</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">© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Many interconnection networks in large-scale parallel computing have hierarchical and recursive structures. The presence of vertex failures may disconnect the entire network, but every fault-free processor still lies in an undamaged sub-network, which is a smaller network with the same topological properties as the original one. For an n-dimensional recursive network $$G_{n}$$, the h-embedded connectivity $$\zeta _{h}$$ of $$G_{n}$$ is the minimum number of vertices whose removal disconnects $$G_n$$ and each vertex in the resulting network is contained in an h-dimensional undamaged sub-network. The bijective connection networks (BC networks for short) are a class of cube-based networks. They have recursive structures and contain many known networks, such as the hypercube, the Crossed cube, and the Möbius cube. This paper focuses on the structures of the Crossed cube and the Möbius cube. We prove that these two networks are generalized product graphs, using these results to determine the $$\zeta _{h}$$ of them for $$h\le n-2$$.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Embedded connectivity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fault-tolerance</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">BC network</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Crossed cube</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Möbius cube</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Generalized product</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Li, Xiang-Jun</subfield><subfield code="0">(orcid)0000-0003-1194-1124</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ma, Meijie</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">The journal of supercomputing</subfield><subfield code="d">Springer US, 1987</subfield><subfield code="g">78(2022), 14 vom: 09. Mai, Seite 16605-16618</subfield><subfield code="w">(DE-627)13046466X</subfield><subfield code="w">(DE-600)740510-8</subfield><subfield code="w">(DE-576)018667775</subfield><subfield code="x">0920-8542</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:78</subfield><subfield code="g">year:2022</subfield><subfield code="g">number:14</subfield><subfield code="g">day:09</subfield><subfield code="g">month:05</subfield><subfield code="g">pages:16605-16618</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11227-022-04522-3</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-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">78</subfield><subfield code="j">2022</subfield><subfield code="e">14</subfield><subfield code="b">09</subfield><subfield code="c">05</subfield><subfield code="h">16605-16618</subfield></datafield></record></collection>
|
| author |
Zhao, Ying-Ze |
| spellingShingle |
Zhao, Ying-Ze ddc 004 misc Embedded connectivity misc Fault-tolerance misc BC network misc Crossed cube misc Möbius cube misc Generalized product Embedded connectivity of some BC networks |
| authorStr |
Zhao, Ying-Ze |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)13046466X |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science 620 - Engineering & allied operations |
| delete_txt_mv |
keep |
| author_role |
aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0920-8542 |
| topic_title |
004 620 VZ Embedded connectivity of some BC networks Embedded connectivity Fault-tolerance BC network Crossed cube Möbius cube Generalized product |
| topic |
ddc 004 misc Embedded connectivity misc Fault-tolerance misc BC network misc Crossed cube misc Möbius cube misc Generalized product |
| topic_unstemmed |
ddc 004 misc Embedded connectivity misc Fault-tolerance misc BC network misc Crossed cube misc Möbius cube misc Generalized product |
| topic_browse |
ddc 004 misc Embedded connectivity misc Fault-tolerance misc BC network misc Crossed cube misc Möbius cube misc Generalized product |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
The journal of supercomputing |
| hierarchy_parent_id |
13046466X |
| dewey-tens |
000 - Computer science, knowledge & systems 620 - Engineering |
| hierarchy_top_title |
The journal of supercomputing |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)13046466X (DE-600)740510-8 (DE-576)018667775 |
| title |
Embedded connectivity of some BC networks |
| ctrlnum |
(DE-627)OLC2079484338 (DE-He213)s11227-022-04522-3-p |
| title_full |
Embedded connectivity of some BC networks |
| author_sort |
Zhao, Ying-Ze |
| journal |
The journal of supercomputing |
| journalStr |
The journal of supercomputing |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works 600 - Technology |
| recordtype |
marc |
| publishDateSort |
2022 |
| contenttype_str_mv |
txt |
| container_start_page |
16605 |
| author_browse |
Zhao, Ying-Ze Li, Xiang-Jun Ma, Meijie |
| container_volume |
78 |
| class |
004 620 VZ |
| format_se |
Aufsätze |
| author-letter |
Zhao, Ying-Ze |
| doi_str_mv |
10.1007/s11227-022-04522-3 |
| normlink |
(ORCID)0000-0003-1194-1124 |
| normlink_prefix_str_mv |
(orcid)0000-0003-1194-1124 |
| dewey-full |
004 620 |
| title_sort |
embedded connectivity of some bc networks |
| title_auth |
Embedded connectivity of some BC networks |
| abstract |
Abstract Many interconnection networks in large-scale parallel computing have hierarchical and recursive structures. The presence of vertex failures may disconnect the entire network, but every fault-free processor still lies in an undamaged sub-network, which is a smaller network with the same topological properties as the original one. For an n-dimensional recursive network $$G_{n}$$, the h-embedded connectivity $$\zeta _{h}$$ of $$G_{n}$$ is the minimum number of vertices whose removal disconnects $$G_n$$ and each vertex in the resulting network is contained in an h-dimensional undamaged sub-network. The bijective connection networks (BC networks for short) are a class of cube-based networks. They have recursive structures and contain many known networks, such as the hypercube, the Crossed cube, and the Möbius cube. This paper focuses on the structures of the Crossed cube and the Möbius cube. We prove that these two networks are generalized product graphs, using these results to determine the $$\zeta _{h}$$ of them for $$h\le n-2$$. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022 |
| abstractGer |
Abstract Many interconnection networks in large-scale parallel computing have hierarchical and recursive structures. The presence of vertex failures may disconnect the entire network, but every fault-free processor still lies in an undamaged sub-network, which is a smaller network with the same topological properties as the original one. For an n-dimensional recursive network $$G_{n}$$, the h-embedded connectivity $$\zeta _{h}$$ of $$G_{n}$$ is the minimum number of vertices whose removal disconnects $$G_n$$ and each vertex in the resulting network is contained in an h-dimensional undamaged sub-network. The bijective connection networks (BC networks for short) are a class of cube-based networks. They have recursive structures and contain many known networks, such as the hypercube, the Crossed cube, and the Möbius cube. This paper focuses on the structures of the Crossed cube and the Möbius cube. We prove that these two networks are generalized product graphs, using these results to determine the $$\zeta _{h}$$ of them for $$h\le n-2$$. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022 |
| abstract_unstemmed |
Abstract Many interconnection networks in large-scale parallel computing have hierarchical and recursive structures. The presence of vertex failures may disconnect the entire network, but every fault-free processor still lies in an undamaged sub-network, which is a smaller network with the same topological properties as the original one. For an n-dimensional recursive network $$G_{n}$$, the h-embedded connectivity $$\zeta _{h}$$ of $$G_{n}$$ is the minimum number of vertices whose removal disconnects $$G_n$$ and each vertex in the resulting network is contained in an h-dimensional undamaged sub-network. The bijective connection networks (BC networks for short) are a class of cube-based networks. They have recursive structures and contain many known networks, such as the hypercube, the Crossed cube, and the Möbius cube. This paper focuses on the structures of the Crossed cube and the Möbius cube. We prove that these two networks are generalized product graphs, using these results to determine the $$\zeta _{h}$$ of them for $$h\le n-2$$. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT |
| container_issue |
14 |
| title_short |
Embedded connectivity of some BC networks |
| url |
https://doi.org/10.1007/s11227-022-04522-3 |
| remote_bool |
false |
| author2 |
Li, Xiang-Jun Ma, Meijie |
| author2Str |
Li, Xiang-Jun Ma, Meijie |
| ppnlink |
13046466X |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s11227-022-04522-3 |
| up_date |
2024-07-04T01:05:53.415Z |
| _version_ |
1803608552549384192 |
| 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">OLC2079484338</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230506062948.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">221220s2022 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11227-022-04522-3</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2079484338</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11227-022-04522-3-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">004</subfield><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Zhao, Ying-Ze</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Embedded connectivity of some BC networks</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2022</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">© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Many interconnection networks in large-scale parallel computing have hierarchical and recursive structures. The presence of vertex failures may disconnect the entire network, but every fault-free processor still lies in an undamaged sub-network, which is a smaller network with the same topological properties as the original one. For an n-dimensional recursive network $$G_{n}$$, the h-embedded connectivity $$\zeta _{h}$$ of $$G_{n}$$ is the minimum number of vertices whose removal disconnects $$G_n$$ and each vertex in the resulting network is contained in an h-dimensional undamaged sub-network. The bijective connection networks (BC networks for short) are a class of cube-based networks. They have recursive structures and contain many known networks, such as the hypercube, the Crossed cube, and the Möbius cube. This paper focuses on the structures of the Crossed cube and the Möbius cube. We prove that these two networks are generalized product graphs, using these results to determine the $$\zeta _{h}$$ of them for $$h\le n-2$$.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Embedded connectivity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fault-tolerance</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">BC network</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Crossed cube</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Möbius cube</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Generalized product</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Li, Xiang-Jun</subfield><subfield code="0">(orcid)0000-0003-1194-1124</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ma, Meijie</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">The journal of supercomputing</subfield><subfield code="d">Springer US, 1987</subfield><subfield code="g">78(2022), 14 vom: 09. Mai, Seite 16605-16618</subfield><subfield code="w">(DE-627)13046466X</subfield><subfield code="w">(DE-600)740510-8</subfield><subfield code="w">(DE-576)018667775</subfield><subfield code="x">0920-8542</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:78</subfield><subfield code="g">year:2022</subfield><subfield code="g">number:14</subfield><subfield code="g">day:09</subfield><subfield code="g">month:05</subfield><subfield code="g">pages:16605-16618</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11227-022-04522-3</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-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">78</subfield><subfield code="j">2022</subfield><subfield code="e">14</subfield><subfield code="b">09</subfield><subfield code="c">05</subfield><subfield code="h">16605-16618</subfield></datafield></record></collection>
|
| score |
7.3984118 |