Optimum broadcasting and personalized communication in hypercubes
Four different communication problems are addressed in Boolean n-cube configured multiprocessors: (1) one-to-all broadcasting: distribution of common data from a single source to all other nodes; (2) one-to-all personalized communication: a single node sending unique data to all other nodes; (3) all...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on computers 1989-09, Vol.38 (9), p.1249-1268 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1268 |
|---|---|
| container_issue | 9 |
| container_start_page | 1249 |
| container_title | IEEE transactions on computers |
| container_volume | 38 |
| creator | Johnsson, S.L. Ho, C.-T. |
| description | Four different communication problems are addressed in Boolean n-cube configured multiprocessors: (1) one-to-all broadcasting: distribution of common data from a single source to all other nodes; (2) one-to-all personalized communication: a single node sending unique data to all other nodes; (3) all-to-all broadcasting: distribution of common data from each node to all other nodes; and (4) all-to-all personalized communication: each node sending a unique piece of information to every other node. Three communication graphs (spanning trees) for the Boolean n-cube are proposed for the routing, and scheduling disciplines provably optimum within a small constant factor are proposed. With appropriate scheduling and concurrent communication on all ports of every processor, routings based on these two communication graphs offer a speedup of up to n/2, and O( square root n) over the routings based on the spanning binomial tree for cases (2)-(4) respectively. All three spanning trees offer optimal communication times for cases (2)-(4) and concurrent communication on all ports of every processor. Timing models and complexity analysis are verified by experiments on a Boolean-cube-configured multiprocessor.< > |
| doi_str_mv | 10.1109/12.29465 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_pascalfrancis_primary_7348032</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>29465</ieee_id><sourcerecordid>28526870</sourcerecordid><originalsourceid>FETCH-LOGICAL-c369t-b167fe19bea3b7fe5e02bfb08885e96602a8293aa89cf9d8da5bee87b86f196b3</originalsourceid><addsrcrecordid>eNo90L1PwzAQBXALgUQpSKxsGRBiSbGd2LHHquJLqtQF5ujsXMAocYKdDOWvJ5Cq0530fnrDI-Sa0RVjVD8wvuI6l-KELJgQRaq1kKdkQSlTqc5yek4uYvyilEpO9YKsd_3g2rFNTOigshAH5z8S8FXSY4idh8b9YJXYrm1H7ywMrvOJ88nnfsrtaDBekrMamohXh7sk70-Pb5uXdLt7ft2st6nNpB5Sw2RRI9MGITPTJ5ByUxuqlBKopaQcFNcZgNK21pWqQBhEVRgla6alyZbkbu7tQ_c9YhzK1kWLTQMeuzGWXAkuVUEneD9DG7oYA9ZlH1wLYV8yWv5tVDJe_m800dtDJ0QLTR3AWxePvshyRTM-sZuZOUQ8pnPFL9J2bv8</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>28526870</pqid></control><display><type>article</type><title>Optimum broadcasting and personalized communication in hypercubes</title><source>IEEE Electronic Library (IEL)</source><creator>Johnsson, S.L. ; Ho, C.-T.</creator><creatorcontrib>Johnsson, S.L. ; Ho, C.-T.</creatorcontrib><description>Four different communication problems are addressed in Boolean n-cube configured multiprocessors: (1) one-to-all broadcasting: distribution of common data from a single source to all other nodes; (2) one-to-all personalized communication: a single node sending unique data to all other nodes; (3) all-to-all broadcasting: distribution of common data from each node to all other nodes; and (4) all-to-all personalized communication: each node sending a unique piece of information to every other node. Three communication graphs (spanning trees) for the Boolean n-cube are proposed for the routing, and scheduling disciplines provably optimum within a small constant factor are proposed. With appropriate scheduling and concurrent communication on all ports of every processor, routings based on these two communication graphs offer a speedup of up to n/2, and O( square root n) over the routings based on the spanning binomial tree for cases (2)-(4) respectively. All three spanning trees offer optimal communication times for cases (2)-(4) and concurrent communication on all ports of every processor. Timing models and complexity analysis are verified by experiments on a Boolean-cube-configured multiprocessor.< ></description><identifier>ISSN: 0018-9340</identifier><identifier>EISSN: 1557-9956</identifier><identifier>DOI: 10.1109/12.29465</identifier><identifier>CODEN: ITCOB4</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Applied sciences ; Bandwidth ; Broadcasting ; Computer science ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Degradation ; Exact sciences and technology ; Hypercubes ; Linear algebra ; Processor scheduling ; Routing ; Software ; Timing ; Tree graphs</subject><ispartof>IEEE transactions on computers, 1989-09, Vol.38 (9), p.1249-1268</ispartof><rights>1989 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c369t-b167fe19bea3b7fe5e02bfb08885e96602a8293aa89cf9d8da5bee87b86f196b3</citedby><cites>FETCH-LOGICAL-c369t-b167fe19bea3b7fe5e02bfb08885e96602a8293aa89cf9d8da5bee87b86f196b3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/29465$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/29465$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=7348032$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Johnsson, S.L.</creatorcontrib><creatorcontrib>Ho, C.-T.</creatorcontrib><title>Optimum broadcasting and personalized communication in hypercubes</title><title>IEEE transactions on computers</title><addtitle>TC</addtitle><description>Four different communication problems are addressed in Boolean n-cube configured multiprocessors: (1) one-to-all broadcasting: distribution of common data from a single source to all other nodes; (2) one-to-all personalized communication: a single node sending unique data to all other nodes; (3) all-to-all broadcasting: distribution of common data from each node to all other nodes; and (4) all-to-all personalized communication: each node sending a unique piece of information to every other node. Three communication graphs (spanning trees) for the Boolean n-cube are proposed for the routing, and scheduling disciplines provably optimum within a small constant factor are proposed. With appropriate scheduling and concurrent communication on all ports of every processor, routings based on these two communication graphs offer a speedup of up to n/2, and O( square root n) over the routings based on the spanning binomial tree for cases (2)-(4) respectively. All three spanning trees offer optimal communication times for cases (2)-(4) and concurrent communication on all ports of every processor. Timing models and complexity analysis are verified by experiments on a Boolean-cube-configured multiprocessor.< ></description><subject>Applied sciences</subject><subject>Bandwidth</subject><subject>Broadcasting</subject><subject>Computer science</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Degradation</subject><subject>Exact sciences and technology</subject><subject>Hypercubes</subject><subject>Linear algebra</subject><subject>Processor scheduling</subject><subject>Routing</subject><subject>Software</subject><subject>Timing</subject><subject>Tree graphs</subject><issn>0018-9340</issn><issn>1557-9956</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1989</creationdate><recordtype>article</recordtype><recordid>eNo90L1PwzAQBXALgUQpSKxsGRBiSbGd2LHHquJLqtQF5ujsXMAocYKdDOWvJ5Cq0530fnrDI-Sa0RVjVD8wvuI6l-KELJgQRaq1kKdkQSlTqc5yek4uYvyilEpO9YKsd_3g2rFNTOigshAH5z8S8FXSY4idh8b9YJXYrm1H7ywMrvOJ88nnfsrtaDBekrMamohXh7sk70-Pb5uXdLt7ft2st6nNpB5Sw2RRI9MGITPTJ5ByUxuqlBKopaQcFNcZgNK21pWqQBhEVRgla6alyZbkbu7tQ_c9YhzK1kWLTQMeuzGWXAkuVUEneD9DG7oYA9ZlH1wLYV8yWv5tVDJe_m800dtDJ0QLTR3AWxePvshyRTM-sZuZOUQ8pnPFL9J2bv8</recordid><startdate>19890901</startdate><enddate>19890901</enddate><creator>Johnsson, S.L.</creator><creator>Ho, C.-T.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19890901</creationdate><title>Optimum broadcasting and personalized communication in hypercubes</title><author>Johnsson, S.L. ; Ho, C.-T.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c369t-b167fe19bea3b7fe5e02bfb08885e96602a8293aa89cf9d8da5bee87b86f196b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1989</creationdate><topic>Applied sciences</topic><topic>Bandwidth</topic><topic>Broadcasting</topic><topic>Computer science</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Degradation</topic><topic>Exact sciences and technology</topic><topic>Hypercubes</topic><topic>Linear algebra</topic><topic>Processor scheduling</topic><topic>Routing</topic><topic>Software</topic><topic>Timing</topic><topic>Tree graphs</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Johnsson, S.L.</creatorcontrib><creatorcontrib>Ho, C.-T.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on computers</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Johnsson, S.L.</au><au>Ho, C.-T.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Optimum broadcasting and personalized communication in hypercubes</atitle><jtitle>IEEE transactions on computers</jtitle><stitle>TC</stitle><date>1989-09-01</date><risdate>1989</risdate><volume>38</volume><issue>9</issue><spage>1249</spage><epage>1268</epage><pages>1249-1268</pages><issn>0018-9340</issn><eissn>1557-9956</eissn><coden>ITCOB4</coden><abstract>Four different communication problems are addressed in Boolean n-cube configured multiprocessors: (1) one-to-all broadcasting: distribution of common data from a single source to all other nodes; (2) one-to-all personalized communication: a single node sending unique data to all other nodes; (3) all-to-all broadcasting: distribution of common data from each node to all other nodes; and (4) all-to-all personalized communication: each node sending a unique piece of information to every other node. Three communication graphs (spanning trees) for the Boolean n-cube are proposed for the routing, and scheduling disciplines provably optimum within a small constant factor are proposed. With appropriate scheduling and concurrent communication on all ports of every processor, routings based on these two communication graphs offer a speedup of up to n/2, and O( square root n) over the routings based on the spanning binomial tree for cases (2)-(4) respectively. All three spanning trees offer optimal communication times for cases (2)-(4) and concurrent communication on all ports of every processor. Timing models and complexity analysis are verified by experiments on a Boolean-cube-configured multiprocessor.< ></abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/12.29465</doi><tpages>20</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0018-9340 |
| ispartof | IEEE transactions on computers, 1989-09, Vol.38 (9), p.1249-1268 |
| issn | 0018-9340 1557-9956 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_7348032 |
| source | IEEE Electronic Library (IEL) |
| subjects | Applied sciences Bandwidth Broadcasting Computer science Computer science control theory systems Computer systems and distributed systems. User interface Degradation Exact sciences and technology Hypercubes Linear algebra Processor scheduling Routing Software Timing Tree graphs |
| title | Optimum broadcasting and personalized communication in hypercubes |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-01T21%3A00%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Optimum%20broadcasting%20and%20personalized%20communication%20in%20hypercubes&rft.jtitle=IEEE%20transactions%20on%20computers&rft.au=Johnsson,%20S.L.&rft.date=1989-09-01&rft.volume=38&rft.issue=9&rft.spage=1249&rft.epage=1268&rft.pages=1249-1268&rft.issn=0018-9340&rft.eissn=1557-9956&rft.coden=ITCOB4&rft_id=info:doi/10.1109/12.29465&rft_dat=%3Cproquest_RIE%3E28526870%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=28526870&rft_id=info:pmid/&rft_ieee_id=29465&rfr_iscdi=true |