Filters








3,928 Hits in 3.9 sec

Broadcasting in butterfly and deBruijn networks

Ralf Klasing, Burkhard Monien, Regine Peine, Elena A Stöhr
<span title="">1994</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/lx7dev2le5anbg6oarljwh7lie" style="color: black;">Discrete Applied Mathematics</a> </i> &nbsp;
Broadcasting is the process of message dissemination in a communication network in which a message originated by one processor is transmitted to all processors of the network.  ...  In this paper, we present a new lower bound of 1.7417m for broadcasting in the butterfly network of dimension m. This improves the best known lower bound of 1.5621m.  ...  broadcasting in the butterfly network BF(m) in time 2m -1.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0166-218x(94)90184-8">doi:10.1016/0166-218x(94)90184-8</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/g65jnm6sbbbhbibtgo5a5qqncy">fatcat:g65jnm6sbbbhbibtgo5a5qqncy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171003222746/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/d3e/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS8wMTY2MjE4eDk0OTAxODQ4.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/0a/da/0ada9c0bc0ffae110db52e107b9f1c20c72c21c7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0166-218x(94)90184-8"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

An Efficient Task-based All-Reduce for Machine Learning Applications

Zhenyu Li, James Davis, Stephen Jarvis
<span title="">2017</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/zigbcra6rjdivda6lkzknwuo5q" style="color: black;">Proceedings of the Machine Learning on HPC Environments - MLHPC&#39;17</a> </i> &nbsp;
ACKNOWLEDGMENT This research is supported by Atos IT Services UK Ltd and by the EPSRC Centre for Doctoral Training in Urban Science and Progress (grant no. EP/L016400/1).  ...  The overheads are split into 5 metrics: By comparing the breakdown components of serial-butterfly and reduce-broadcast, the network block time in serial-butterfly is reduced by 84%, whilst the cost  ...  The new butterfly all-reduce algorithm is also tested with respect to the naive reduce-broadcast method on model-updates of neural network applications.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3146347.3146350">doi:10.1145/3146347.3146350</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/sc/LiDJ17.html">dblp:conf/sc/LiDJ17</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jpkx7xqlbffg7llcngt3odvfoy">fatcat:jpkx7xqlbffg7llcngt3odvfoy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180719052237/http://wrap.warwick.ac.uk/95878/1/WRAP-efficient-task-based-all-reduce-machine-learning-applications-Li-2017.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/fb/c2/fbc24c9f0dccb5a39ec6276ba11fa6ba39db2247.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3146347.3146350"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Page 2039 of Mathematical Reviews Vol. , Issue 99c [page]

<span title="">1991</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
butterfly networks with random faults.  ...  Summary: “In this paper, we propose a distributed broadcasting algorithm with optimal time complexity and without message re- dundancy for one-to-all broadcasting in the one-port communica- tion model  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1991-03_99c/page/2039" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1991-03_99c/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Efficient broadcasting with linearly bounded faults

Krzysztof Ciebiera, Adam Malinowski
<span title="">1998</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/lx7dev2le5anbg6oarljwh7lie" style="color: black;">Discrete Applied Mathematics</a> </i> &nbsp;
In a unit of time every node can communicate with at most one neighbor.  ...  We consider the problem of broadcasting in the presence of linearly bounded number of transient faults.  ...  First, we consider the multidimensional tori, then the wrap-around butterfly -the network of constant degree and logarithmic broadcast time.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0166-218x(98)00118-8">doi:10.1016/s0166-218x(98)00118-8</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3exrzopirbavpjrykwlpp2p4ge">fatcat:3exrzopirbavpjrykwlpp2p4ge</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170929234631/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/839/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDE2NjIxOHg5ODAwMTE4OA%3D%3D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f5/f5/f5f538e57ff5c7d24d1a74b57c6f95222782c09a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0166-218x(98)00118-8"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Some mathematical properties of cayley digraphs with applications to interconnection network design

Wenjun Xiao, Behrooz Parhami
<span title="">2005</span> <i title="Informa UK Limited"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/y4k3i2fvabgarkvywismzvy23a" style="color: black;">International Journal of Computer Mathematics</a> </i> &nbsp;
We discuss the applications of these results to well-known interconnection networks such as the butterfly network, the de Bruijn network, the cube-connected cycles network and the shuffle-exchange network  ...  We consider the relationships between Cayley digraphs and their coset graphs with respect to subgroups and obtain some general results on homomorphism and broadcasting between them.  ...  Acknowledgements Wenjun Xiao's research was supported by the Natural Science Foundation of China and Fujian Province.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1080/00207160512331331101">doi:10.1080/00207160512331331101</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vf3druz67zehdf3dw2wmjrceaa">fatcat:vf3druz67zehdf3dw2wmjrceaa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809211648/http://www.ece.ucsb.edu/~parhami/pubs_folder/parh05-ijcm-math-prop-cayley-appl.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/42/8e/428eaa8062370ec4167b7214d42fcee3f78916df.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1080/00207160512331331101"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> tandfonline.com </button> </a>

Page 4929 of Mathematical Reviews Vol. , Issue 99g [page]

<span title="">1999</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
Perennes proves an upper bound on the broadcast time of a compound digraph G[H] which has the lo- cal matching property, as a function of the diameter of G and the broadcast time of H.  ...  This allows him to derive an upper bound on the broadcast time of the symmetric digraph obtained from the de Bruijn digraph, and thus of the undirected de Bruijn graph, which is asymptotically optimal.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1999-07_99g/page/4929" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1999-07_99g/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

A Comparison of Aggregation/Broadcast Methods and Multicomputer Architectures, and an Examination of the Communication Overhead on the IBM pSeries 655

Linda Markowsky
<span title="">2005</span> <i title="IEEE"> 2005 IEEE Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications </i> &nbsp;
First, using a simulator, a detailed comparison of the butterfly and direct aggregation/broadcast methods on both hypercube and fully connected multicomputers, both with and without simulation of congestion  ...  Second, the communication overhead an IBM pSeries 655 is examined.  ...  SIMULATION: COMPARISON OF THE DIRECT AND BUTTERFLY AGGREGATION/BROADCAST METHODS ON 2, 3, 4, AND 5-DIMENSIONAL HYPERCUBES As in Lester [1] , the direct and butterfly aggregation/broadcast methods (with  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/idaacs.2005.282979">doi:10.1109/idaacs.2005.282979</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/iartslb2jfbyzckuieweqs3wla">fatcat:iartslb2jfbyzckuieweqs3wla</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200321020525/http://computingonline.net/computing/article/download/370/340" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c5/2c/c52ccabdf35f7e39015cbf011a66c3a53b8a0850.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/idaacs.2005.282979"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Timestamp snooping

Milo M. K. Martin, David A. Wood, Daniel J. Sorin, Anatassia Ailamaki, Alaa R. Alameldeen, Ross M. Dickson, Carl J. Mauer, Kevin E. Moore, Manoj Plakal, Mark D. Hill
<span title="2000-12-01">2000</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/i24hgue5erh4haqtfyyjvfijdu" style="color: black;">ACM SIGOPS Operating Systems Review</a> </i> &nbsp;
For OLTP, DSS, web serving, web searching, and one scientific application, timestamp snooping with the butterfly network runs 6-28% faster than directories, at a cost of 13-43% more link traffic.  ...  Logical time is maintained by adding a few bits per address transaction and having network switches perform a handshake to ensure on-time delivery.  ...  , and Bernard Beaton for their support of IBM DB2; Paul Barford for the SURGE client; and Ernest Artiaga for the PARMACS macros.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/384264.378998">doi:10.1145/384264.378998</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nzuouyvxubcxnfddwwpk54lxgu">fatcat:nzuouyvxubcxnfddwwpk54lxgu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170813023251/http://www.cs.cmu.edu/~natassa/aapubs/conference/time%20stamp%20snooping.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/cc/82/cc82832df5ac8746621fa200307256853a32ee26.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/384264.378998"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Timestamp snooping

Milo M. K. Martin, David A. Wood, Daniel J. Sorin, Anatassia Ailamaki, Alaa R. Alameldeen, Ross M. Dickson, Carl J. Mauer, Kevin E. Moore, Manoj Plakal, Mark D. Hill
<span title="">2000</span> <i title="ACM Press"> Proceedings of the ninth international conference on Architectural support for programming languages and operating systems - ASPLOS-IX </i> &nbsp;
For OLTP, DSS, web serving, web searching, and one scientific application, timestamp snooping with the butterfly network runs 6-28% faster than directories, at a cost of 13-43% more link traffic.  ...  Logical time is maintained by adding a few bits per address transaction and having network switches perform a handshake to ensure on-time delivery.  ...  , and Bernard Beaton for their support of IBM DB2; Paul Barford for the SURGE client; and Ernest Artiaga for the PARMACS macros.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/378993.378998">doi:10.1145/378993.378998</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/n4vqo545enggji5bce7qvjk54y">fatcat:n4vqo545enggji5bce7qvjk54y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170813023251/http://www.cs.cmu.edu/~natassa/aapubs/conference/time%20stamp%20snooping.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/cc/82/cc82832df5ac8746621fa200307256853a32ee26.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/378993.378998"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Timestamp snooping

Milo M. K. Martin, David A. Wood, Daniel J. Sorin, Anatassia Ailamaki, Alaa R. Alameldeen, Ross M. Dickson, Carl J. Mauer, Kevin E. Moore, Manoj Plakal, Mark D. Hill
<span title="2000-12-01">2000</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/35q3ync5nbhnjfpylznlz57lyi" style="color: black;">SIGARCH Computer Architecture News</a> </i> &nbsp;
For OLTP, DSS, web serving, web searching, and one scientific application, timestamp snooping with the butterfly network runs 6-28% faster than directories, at a cost of 13-43% more link traffic.  ...  Logical time is maintained by adding a few bits per address transaction and having network switches perform a handshake to ensure on-time delivery.  ...  , and Bernard Beaton for their support of IBM DB2; Paul Barford for the SURGE client; and Ernest Artiaga for the PARMACS macros.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/378995.378998">doi:10.1145/378995.378998</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/56rdl6n7zrd5da7hxqvpowq4zi">fatcat:56rdl6n7zrd5da7hxqvpowq4zi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170813023251/http://www.cs.cmu.edu/~natassa/aapubs/conference/time%20stamp%20snooping.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/cc/82/cc82832df5ac8746621fa200307256853a32ee26.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/378995.378998"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Timestamp snooping

Milo M. K. Martin, David H. Wood, Daniel J. Sorin, Anastassia Ailamaki, Alaa R. Alameldeen, Ross M. Dickson, Carl J. Mauer, Kevin E. Moore, Manoj Plakal, Mark D. Hill
<span title="2000-11-01">2000</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xu5bk2lj5rbdxlx6222nw7tsxi" style="color: black;">SIGPLAN notices</a> </i> &nbsp;
For OLTP, DSS, web serving, web searching, and one scientific application, timestamp snooping with the butterfly network runs 6-28% faster than directories, at a cost of 13-43% more link traffic.  ...  Logical time is maintained by adding a few bits per address transaction and having network switches perform a handshake to ensure on-time delivery.  ...  , and Bernard Beaton for their support of IBM DB2; Paul Barford for the SURGE client; and Ernest Artiaga for the PARMACS macros.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/356989.356992">doi:10.1145/356989.356992</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5eqevkd2nnegloacnbyg342vvy">fatcat:5eqevkd2nnegloacnbyg342vvy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170813023251/http://www.cs.cmu.edu/~natassa/aapubs/conference/time%20stamp%20snooping.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/cc/82/cc82832df5ac8746621fa200307256853a32ee26.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/356989.356992"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Some Conclusions on Cayley Digraphs and Their Applications to Interconnection Networks [chapter]

Wenjun Xiao, Behrooz Parhami
<span title="">2004</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We also obtain a factorization of Cayley digraphs on subgraphs. We discuss the applications of these results to well-known interconnection networks.  ...  In this short communication, we survey the relationships between Cayley digraphs and their subgraphs and coset graphs with respect to subgroups and obtain some general results on homomorphism and broadcasting  ...  The broadcast time of G under M , b M (G), is defined as the maximum broadcast time of any vertex u in G; i.e., b M is easily derived.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-24680-0_67">doi:10.1007/978-3-540-24680-0_67</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/t566hbpdh5hqzpdfryfgxpdvjq">fatcat:t566hbpdh5hqzpdfryfgxpdvjq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20040529083955/http://www.ece.ucsb.edu:80/Faculty/Parhami/pubs_folder/parh03-gcc-concl-cayley.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/da/18/da18b1a28bcd5ffedd0a24d72f02a708b156743f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-24680-0_67"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Towards scalable, energy-efficient, bus-based on-chip networks

Aniruddha N. Udipi, Naveen Muralimanohar, Rajeev Balasubramonian
<span title="">2010</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/n7ljjecrpje5pj66pk4pvx65qu" style="color: black;">HPCA - 16 2010 The Sixteenth International Symposium on High-Performance Computer Architecture</a> </i> &nbsp;
We show energy reductions of up to 31X on average compared to many state-of-the-art packet switched networks.  ...  Thus, with the combination of all the above innovations, we extend the scalability of buses and believe that buses can be a viable and attractive option for future on-chip networks.  ...  Note that this is only the network latency and does not include the actual L2 cache lookup time. In the flattened butterfly network, there are on average 1.5 hops/message.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/hpca.2010.5416639">doi:10.1109/hpca.2010.5416639</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/hpca/UdipiMB10.html">dblp:conf/hpca/UdipiMB10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/a6x4ppxwbvcdthupelph4mhu64">fatcat:a6x4ppxwbvcdthupelph4mhu64</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809092400/http://www.cs.utah.edu/~naveen/papers/hpca10.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/bb/08/bb081ee69966569bb5b6e5ec0185c0e581a64763.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/hpca.2010.5416639"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

A rule-based inter-session network coding scheme over IEEE 802.16(d) mesh CDS-mode networks

Shie-Yuan Wang, Chih-Che Lin, Yu-Chi Chang
<span title="">2012</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/blfmvfslmbggxhopuigjdb3jma" style="color: black;">Computer Networks</a> </i> &nbsp;
However, such a requirement increases the implementation complexity of a network coding scheme.  ...  To alleviate this problem, based on RNC we propose a smart handshake procedure (called RNC-SHP) over the IEEE 802.16(d) mesh coordinated distributed scheduling (CDS) mode to reduce the number of hidden  ...  On the other hand, the flows (G, C) and (I, A) are also transmitting their data using the second butterfly structure at the same time.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.comnet.2011.10.013">doi:10.1016/j.comnet.2011.10.013</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/aimljo3ajrddlkzywb54mmqb74">fatcat:aimljo3ajrddlkzywb54mmqb74</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170813041034/https://ir.nctu.edu.tw/bitstream/11536/15640/1/000300535900012.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e7/ef/e7ef1c030b1db1c91005bb33644025fab96246e4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.comnet.2011.10.013"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Faster gossiping on butterfly networks

Jop F. Sibeyn
<span title="">2005</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
We show that gossiping on a class of "columnbased" networks, which also contains the cube-connected cycles, can be reduced to the simpler problem of "row-gossiping".  ...  Out of the produced solutions a pattern is distilled, which can be used to perform gossiping on butterflies and simple butterflies of order k in 2 1 4 k + o(k) and 2 1 2 k + o(k) rounds, respectively,  ...  Acknowledgements Michal Šoch has been reading and commenting parts of this paper. The comments of several ICALP and TCS referees were also helpful.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.tcs.2004.09.032">doi:10.1016/j.tcs.2004.09.032</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cmmwm6yffredpjecrlc5h6f6ee">fatcat:cmmwm6yffredpjecrlc5h6f6ee</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170928182616/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/6b1/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDMwNDM5NzUwNDAwNjY4MQ%3D%3D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/70/01/7001ac8dfe1f29c2c2b10b4b00d79abcbc2f3155.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.tcs.2004.09.032"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 3,928 results