Asymptotically optimal communication algorithms on faulty folded Petersen networks
Efficient data communication through an interconnection network in the presence of faulty nodes and links is an important issue in multiprocessor systems. The newly proposed folded Petersen networks, constructed by iteratively applying the cartesian product operation on the well-known Petersen graph...
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 | 84 |
|---|---|
| container_issue | |
| container_start_page | 77 |
| container_title | |
| container_volume | |
| creator | Ohring, S.R. Das, S.K. Hohndel, D.H. |
| description | Efficient data communication through an interconnection network in the presence of faulty nodes and links is an important issue in multiprocessor systems. The newly proposed folded Petersen networks, constructed by iteratively applying the cartesian product operation on the well-known Petersen graph, provide a very efficient topology for multiprocessor architectures. In this paper, we construct multiple arc-disjoint spanning trees on the folded Petersen networks and utilize them for deriving fault-tolerant algorithms for several communication primitives. These primitives include single node broadcasting, gossiping, scattering, and total exchange. |
| doi_str_mv | 10.1109/FTPDS.1994.494477 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_494477</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>494477</ieee_id><sourcerecordid>494477</sourcerecordid><originalsourceid>FETCH-LOGICAL-i89t-a13c75635b7282f92de1e1c31e851fcfa7e493510a2e0ffb232ba63e01f8091a3</originalsourceid><addsrcrecordid>eNotj8FKxDAYhAMiKGsfQE95ga75m6ZJjsvqqrDgor0vaftHo2lTmizSt7ewO5dhvsMwQ8g9sDUA04-7-vD0uQaty3Wpy1LKK5JpqZgCVVWKyfKGZDH-sEVCKA7ylnxs4tyPKSTXGu9nGsbkeuNpG_r-NCwwuTBQ47_C5NJ3H-mSrDn5NFMbfIcdPWDCKeJAB0x_YfqNd-TaGh8xu_iK1Lvnevua799f3rabfe6UTrkB3kpRcdHIQhVWFx0CQssBlQDbWiOx1FwAMwUya5uCF42pODKwimkwfEUezrUOEY_jtMye5uP5N_8Hg59QRA</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Asymptotically optimal communication algorithms on faulty folded Petersen networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Ohring, S.R. ; Das, S.K. ; Hohndel, D.H.</creator><creatorcontrib>Ohring, S.R. ; Das, S.K. ; Hohndel, D.H.</creatorcontrib><description>Efficient data communication through an interconnection network in the presence of faulty nodes and links is an important issue in multiprocessor systems. The newly proposed folded Petersen networks, constructed by iteratively applying the cartesian product operation on the well-known Petersen graph, provide a very efficient topology for multiprocessor architectures. In this paper, we construct multiple arc-disjoint spanning trees on the folded Petersen networks and utilize them for deriving fault-tolerant algorithms for several communication primitives. These primitives include single node broadcasting, gossiping, scattering, and total exchange.</description><identifier>ISBN: 9780818668074</identifier><identifier>ISBN: 0818668075</identifier><identifier>DOI: 10.1109/FTPDS.1994.494477</identifier><language>eng</language><publisher>IEEE Comput. Soc</publisher><subject>Algorithm design and analysis ; Broadcasting ; Computer science ; Fault tolerance ; Hypercubes ; Multiprocessing systems ; Multiprocessor interconnection networks ; Network topology ; Scattering ; Tree graphs</subject><ispartof>Proceedings of IEEE Workshop on Fault-Tolerant Parallel and Distributed Systems, 1994, p.77-84</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/494477$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,4036,4037,27904,54898</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/494477$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Ohring, S.R.</creatorcontrib><creatorcontrib>Das, S.K.</creatorcontrib><creatorcontrib>Hohndel, D.H.</creatorcontrib><title>Asymptotically optimal communication algorithms on faulty folded Petersen networks</title><title>Proceedings of IEEE Workshop on Fault-Tolerant Parallel and Distributed Systems</title><addtitle>FTPDS</addtitle><description>Efficient data communication through an interconnection network in the presence of faulty nodes and links is an important issue in multiprocessor systems. The newly proposed folded Petersen networks, constructed by iteratively applying the cartesian product operation on the well-known Petersen graph, provide a very efficient topology for multiprocessor architectures. In this paper, we construct multiple arc-disjoint spanning trees on the folded Petersen networks and utilize them for deriving fault-tolerant algorithms for several communication primitives. These primitives include single node broadcasting, gossiping, scattering, and total exchange.</description><subject>Algorithm design and analysis</subject><subject>Broadcasting</subject><subject>Computer science</subject><subject>Fault tolerance</subject><subject>Hypercubes</subject><subject>Multiprocessing systems</subject><subject>Multiprocessor interconnection networks</subject><subject>Network topology</subject><subject>Scattering</subject><subject>Tree graphs</subject><isbn>9780818668074</isbn><isbn>0818668075</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1994</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj8FKxDAYhAMiKGsfQE95ga75m6ZJjsvqqrDgor0vaftHo2lTmizSt7ewO5dhvsMwQ8g9sDUA04-7-vD0uQaty3Wpy1LKK5JpqZgCVVWKyfKGZDH-sEVCKA7ylnxs4tyPKSTXGu9nGsbkeuNpG_r-NCwwuTBQ47_C5NJ3H-mSrDn5NFMbfIcdPWDCKeJAB0x_YfqNd-TaGh8xu_iK1Lvnevua799f3rabfe6UTrkB3kpRcdHIQhVWFx0CQssBlQDbWiOx1FwAMwUya5uCF42pODKwimkwfEUezrUOEY_jtMye5uP5N_8Hg59QRA</recordid><startdate>1994</startdate><enddate>1994</enddate><creator>Ohring, S.R.</creator><creator>Das, S.K.</creator><creator>Hohndel, D.H.</creator><general>IEEE Comput. Soc</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>1994</creationdate><title>Asymptotically optimal communication algorithms on faulty folded Petersen networks</title><author>Ohring, S.R. ; Das, S.K. ; Hohndel, D.H.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i89t-a13c75635b7282f92de1e1c31e851fcfa7e493510a2e0ffb232ba63e01f8091a3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1994</creationdate><topic>Algorithm design and analysis</topic><topic>Broadcasting</topic><topic>Computer science</topic><topic>Fault tolerance</topic><topic>Hypercubes</topic><topic>Multiprocessing systems</topic><topic>Multiprocessor interconnection networks</topic><topic>Network topology</topic><topic>Scattering</topic><topic>Tree graphs</topic><toplevel>online_resources</toplevel><creatorcontrib>Ohring, S.R.</creatorcontrib><creatorcontrib>Das, S.K.</creatorcontrib><creatorcontrib>Hohndel, D.H.</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 Electronic Library (IEL)</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>Ohring, S.R.</au><au>Das, S.K.</au><au>Hohndel, D.H.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Asymptotically optimal communication algorithms on faulty folded Petersen networks</atitle><btitle>Proceedings of IEEE Workshop on Fault-Tolerant Parallel and Distributed Systems</btitle><stitle>FTPDS</stitle><date>1994</date><risdate>1994</risdate><spage>77</spage><epage>84</epage><pages>77-84</pages><isbn>9780818668074</isbn><isbn>0818668075</isbn><abstract>Efficient data communication through an interconnection network in the presence of faulty nodes and links is an important issue in multiprocessor systems. The newly proposed folded Petersen networks, constructed by iteratively applying the cartesian product operation on the well-known Petersen graph, provide a very efficient topology for multiprocessor architectures. In this paper, we construct multiple arc-disjoint spanning trees on the folded Petersen networks and utilize them for deriving fault-tolerant algorithms for several communication primitives. These primitives include single node broadcasting, gossiping, scattering, and total exchange.</abstract><pub>IEEE Comput. Soc</pub><doi>10.1109/FTPDS.1994.494477</doi><tpages>8</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 9780818668074 |
| ispartof | Proceedings of IEEE Workshop on Fault-Tolerant Parallel and Distributed Systems, 1994, p.77-84 |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_494477 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Algorithm design and analysis Broadcasting Computer science Fault tolerance Hypercubes Multiprocessing systems Multiprocessor interconnection networks Network topology Scattering Tree graphs |
| title | Asymptotically optimal communication algorithms on faulty folded Petersen networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T16%3A59%3A32IST&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=Asymptotically%20optimal%20communication%20algorithms%20on%20faulty%20folded%20Petersen%20networks&rft.btitle=Proceedings%20of%20IEEE%20Workshop%20on%20Fault-Tolerant%20Parallel%20and%20Distributed%20Systems&rft.au=Ohring,%20S.R.&rft.date=1994&rft.spage=77&rft.epage=84&rft.pages=77-84&rft.isbn=9780818668074&rft.isbn_list=0818668075&rft_id=info:doi/10.1109/FTPDS.1994.494477&rft_dat=%3Cieee_6IE%3E494477%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=494477&rfr_iscdi=true |