Permutation routing in 2-stage recirculating delta networks

Permutation routing in 2-stage recirculating delta networks

The authors discuss a N input/output recirculating network that can take advantage of compile-time knowledge of algorithm-dependent communications, but still performs efficiently on data-dependent permutations. A deterministic routing algorithm and a randomized routing algorithm are given. Mapping t...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Alleyne, B.D., Scherson, I.D.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Intelligent networks
Labeling
Routing
Runtime
Switches
Wires
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 503
container_issue
container_start_page 502
container_title
container_volume
creator Alleyne, B.D.
Scherson, I.D.
description The authors discuss a N input/output recirculating network that can take advantage of compile-time knowledge of algorithm-dependent communications, but still performs efficiently on data-dependent permutations. A deterministic routing algorithm and a randomized routing algorithm are given. Mapping to Clos networks is considered.< >
doi_str_mv 10.1109/FMPC.1992.234872
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_234872</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>234872</ieee_id><sourcerecordid>234872</sourcerecordid><originalsourceid>FETCH-LOGICAL-i104t-b39a93c4a8737d729f0099f80fb10dcad6118765e568fdaecca5281b93964f013</originalsourceid><addsrcrecordid>eNotj01LxDAURQMiqOPsxVX-QGte0uYDV1IcRxhxFroeXtOXIdppJU0R_72D413cs7hw4DJ2A6IEEO5u9bJtSnBOllJV1sgzdiUsWC2NkeaCLafpQxxT1XCsS3a_pXSYM-Y4DjyNc47DnseBy2LKuCeeyMfk5x7_ho76jHyg_D2mz-manQfsJ1r-c8HeV49vzbrYvD49Nw-bIoKoctEqh075Cq1RpjPSBSGcC1aEFkTnsdMA1uiaam1Dh-Q91tJC65TTVRCgFuz25I1EtPtK8YDpZ3e6p34B_A1Flw</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Permutation routing in 2-stage recirculating delta networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Alleyne, B.D. ; Scherson, I.D.</creator><creatorcontrib>Alleyne, B.D. ; Scherson, I.D.</creatorcontrib><description>The authors discuss a N input/output recirculating network that can take advantage of compile-time knowledge of algorithm-dependent communications, but still performs efficiently on data-dependent permutations. A deterministic routing algorithm and a randomized routing algorithm are given. Mapping to Clos networks is considered.&lt; &gt;</description><identifier>ISBN: 0818627727</identifier><identifier>ISBN: 9780818627729</identifier><identifier>DOI: 10.1109/FMPC.1992.234872</identifier><language>eng</language><publisher>IEEE Comput. Soc. Press</publisher><subject>Intelligent networks ; Labeling ; Routing ; Runtime ; Switches ; Wires</subject><ispartof>[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation, 1992, p.502-503</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/234872$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,4050,4051,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/234872$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Alleyne, B.D.</creatorcontrib><creatorcontrib>Scherson, I.D.</creatorcontrib><title>Permutation routing in 2-stage recirculating delta networks</title><title>[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation</title><addtitle>FMPC</addtitle><description>The authors discuss a N input/output recirculating network that can take advantage of compile-time knowledge of algorithm-dependent communications, but still performs efficiently on data-dependent permutations. A deterministic routing algorithm and a randomized routing algorithm are given. Mapping to Clos networks is considered.&lt; &gt;</description><subject>Intelligent networks</subject><subject>Labeling</subject><subject>Routing</subject><subject>Runtime</subject><subject>Switches</subject><subject>Wires</subject><isbn>0818627727</isbn><isbn>9780818627729</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1992</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj01LxDAURQMiqOPsxVX-QGte0uYDV1IcRxhxFroeXtOXIdppJU0R_72D413cs7hw4DJ2A6IEEO5u9bJtSnBOllJV1sgzdiUsWC2NkeaCLafpQxxT1XCsS3a_pXSYM-Y4DjyNc47DnseBy2LKuCeeyMfk5x7_ho76jHyg_D2mz-manQfsJ1r-c8HeV49vzbrYvD49Nw-bIoKoctEqh075Cq1RpjPSBSGcC1aEFkTnsdMA1uiaam1Dh-Q91tJC65TTVRCgFuz25I1EtPtK8YDpZ3e6p34B_A1Flw</recordid><startdate>1992</startdate><enddate>1992</enddate><creator>Alleyne, B.D.</creator><creator>Scherson, I.D.</creator><general>IEEE Comput. Soc. Press</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>1992</creationdate><title>Permutation routing in 2-stage recirculating delta networks</title><author>Alleyne, B.D. ; Scherson, I.D.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i104t-b39a93c4a8737d729f0099f80fb10dcad6118765e568fdaecca5281b93964f013</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1992</creationdate><topic>Intelligent networks</topic><topic>Labeling</topic><topic>Routing</topic><topic>Runtime</topic><topic>Switches</topic><topic>Wires</topic><toplevel>online_resources</toplevel><creatorcontrib>Alleyne, B.D.</creatorcontrib><creatorcontrib>Scherson, I.D.</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>Alleyne, B.D.</au><au>Scherson, I.D.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Permutation routing in 2-stage recirculating delta networks</atitle><btitle>[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation</btitle><stitle>FMPC</stitle><date>1992</date><risdate>1992</risdate><spage>502</spage><epage>503</epage><pages>502-503</pages><isbn>0818627727</isbn><isbn>9780818627729</isbn><abstract>The authors discuss a N input/output recirculating network that can take advantage of compile-time knowledge of algorithm-dependent communications, but still performs efficiently on data-dependent permutations. A deterministic routing algorithm and a randomized routing algorithm are given. Mapping to Clos networks is considered.&lt; &gt;</abstract><pub>IEEE Comput. Soc. Press</pub><doi>10.1109/FMPC.1992.234872</doi><tpages>2</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 0818627727
ispartof [Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation, 1992, p.502-503
issn
language eng
recordid cdi_ieee_primary_234872
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Intelligent networks
Labeling
Routing
Runtime
Switches
Wires
title Permutation routing in 2-stage recirculating delta 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-02T04%3A05%3A05IST&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=Permutation%20routing%20in%202-stage%20recirculating%20delta%20networks&rft.btitle=%5BProceedings%201992%5D%20The%20Fourth%20Symposium%20on%20the%20Frontiers%20of%20Massively%20Parallel%20Computation&rft.au=Alleyne,%20B.D.&rft.date=1992&rft.spage=502&rft.epage=503&rft.pages=502-503&rft.isbn=0818627727&rft.isbn_list=9780818627729&rft_id=info:doi/10.1109/FMPC.1992.234872&rft_dat=%3Cieee_6IE%3E234872%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=234872&rfr_iscdi=true