Filters








1,859 Hits in 8.6 sec

Fault-tolerant cycle embedding in dual-cube with node faults

Yamin Li, Shietung Peng, Wanming Chu
<span title="">2005</span> <i title="Inderscience Publishers"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/djvx6nkrcfegtozlge2bc5a3dy" style="color: black;">International Journal of High Performance Computing and Networking</a> </i> &nbsp;
A dual-cube DC(m) has m + 1 links per node, where m is the degree of a cluster (m-cube) and one more link is used for connecting to a node in another cluster.  ...  There are 2 m+1 clusters and hence the total number of nodes in a DC(m) is 2 2m + 1 .  ...  Some variations focus on the reduction of diameter of the hypercube, such as folded hypercube (Amawy and Latifi, 1991) and crossed cube (Efe, 1992) ; some focus on the reduction of the number of links  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1504/ijhpcn.2005.007866">doi:10.1504/ijhpcn.2005.007866</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/27z5boxyljbdde5bsl56i576re">fatcat:27z5boxyljbdde5bsl56i576re</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810184527/http://cis.k.hosei.ac.jp/~yamin/papers/IJHPCN.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/ae/3f/ae3f0fa80858133d3be0415706ced76a995d4cdd.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1504/ijhpcn.2005.007866"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Hamiltonian Related Properties With And Without Faults Of The Dual-Cube Interconnection Network And Their Variations

Shih-Yan Chen, Shin-Shin Kao
<span title="2016-03-05">2016</span> <i title="Zenodo"> Zenodo </i> &nbsp;
In this paper, a thorough review about dual-cubes, DCn, the related studies and their variations are given.  ...  In fact, it is so constructed that the number of vertices of DCn is equal to the number of vertices of Q2n +1.  ...  These hypercubes are called clusters of DCL(n), and the edges between them are called cross edges. • Every vertex of DCL(n) is incident to exactly one cross edge, so the cross edges form a perfect matching  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5281/zenodo.1124205">doi:10.5281/zenodo.1124205</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tszoj6pu2fcolis23zlsls766u">fatcat:tszoj6pu2fcolis23zlsls766u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200222183751/https://zenodo.org/record/1124205/files/10004380.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/a9/03/a9033df44693e3dcc03718acebbd37a917e94b72.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5281/zenodo.1124205"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> zenodo.org </button> </a>

A family of Hamiltonian and Hamiltonian connected graphs with fault tolerance

Y-Chuang Chen, Yong-Zen Huang, Lih-Hsing Hsu, Jimmy J. M. Tan
<span title="2009-07-10">2009</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/qhbautqnvzgwvm3vvdvieylhwq" style="color: black;">Journal of Supercomputing</a> </i> &nbsp;
Therefore, some of the generalized hypercubes, twistedcubes, crossed-cubes, and Möbius cubes are optimal fault-tolerant Hamiltonian and optimal fault-tolerant Hamiltonian connected.  ...  A k-regular Hamiltonian and Hamiltonian connected graph G is optimal fault-tolerant Hamiltonian and Hamiltonian connected if G remains Hamiltonian after removing at most k − 2 vertices and/or edges and  ...  of the paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s11227-009-0316-3">doi:10.1007/s11227-009-0316-3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/v7gblgakcnc6xlu4gt4rgwglvq">fatcat:v7gblgakcnc6xlu4gt4rgwglvq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170814014356/https://ir.nctu.edu.tw/bitstream/11536/31997/1/000282225700005.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/28/0d/280dd5a78d11f153cced5793136870c1a05d058d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s11227-009-0316-3"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A New Cost Effective and Reliable Interconnection Topology for Parallel Computing Systems

<span title="2019-08-30">2019</span> <i title="Blue Eyes Intelligence Engineering and Sciences Engineering and Sciences Publication - BEIESP"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/h673cvfolnhl3mnbjxkhtxdtg4" style="color: black;">International Journal of Engineering and Advanced Technology</a> </i> &nbsp;
In this paper, we propose a new hybrid interconnection network topology called TOR-CUBE (TC) which is a product of two classical popular interconnection topologies namely hypercube and torus.  ...  Topology of the of interconnection network is one of the most important considerations in the design of parallel systems as it is the backbone network over which the different components of the computer  ...  The variant includes cube connected cycles [23] , twisted hypercube [3] , folded hypercube [5] , crossed cube [6, 8] , exchanged hypercube [4, 41] , incomplete crossed cube [5] , banyan hypercube  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.35940/ijeat.f8363.088619">doi:10.35940/ijeat.f8363.088619</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jbf7a4fp4zha3akd6r7rhw7ja4">fatcat:jbf7a4fp4zha3akd6r7rhw7ja4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200207191648/https://www.ijeat.org/wp-content/uploads/papers/v8i6/F8363088619.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/a2/fe/a2fedb3b3cc3de716e4b9d391a554ae00b86f232.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.35940/ijeat.f8363.088619"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks

Ruo-Wei Hung
<span title="">2015</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;
By using the similar approach, we present linear time algorithms to construct two edge-disjoint Hamiltonian cycles on two variants of hypercubes, including twisted cubes and crossed cubes. and its benefits  ...  Then, we use the same approach to construct two edgedisjoint Hamiltonian cycles in twisted cubes and crossed cubes which are two variants of hypercubes.  ...  Acknowledgments This work is partly supported by the National Science Council of Taiwan under grant no. NSC 102-2221-E-324-007.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.dam.2014.09.006">doi:10.1016/j.dam.2014.09.006</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fz2efvsmqjfgpjhrwukkpqt6sa">fatcat:fz2efvsmqjfgpjhrwukkpqt6sa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200319194805/http://ir.lib.cyut.edu.tw:8080/bitstream/310901800/22940/2/1-2-DAM181%282015%29109-122.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/8f/3e/8f3e76818ce55b3ad793c26eb1a52214a2b9edcf.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.dam.2014.09.006"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Edge-pancyclicity of Möbius cubes

Min Xu, Jun-Ming Xu
<span title="">2005</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/5xfy4fcdxvcvdiybp6iqbffqc4" style="color: black;">Information Processing Letters</a> </i> &nbsp;
The Möbius cube M n is a variant of the hypercube Q n and has better properties than Q n with the same number of links and processors. It has been shown by Fan [J.  ...  Fan, Hamilton-connectivity and cycle-embedding of Möbius cubes, Inform. Process. independently, that M n contains a cycle of every length from 4 to 2 n .  ...  Recently, it has been shown by several authors that every edge of n-dimensional crossed cube, another variants of the hypercube, lies on a cycle of every length from 4 to 2 n inclusive for n 2 (see [6  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ipl.2005.07.003">doi:10.1016/j.ipl.2005.07.003</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4k3tcj5qbzdgdbzmlcrkvjxjae">fatcat:4k3tcj5qbzdgdbzmlcrkvjxjae</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810145445/http://staff.ustc.edu.cn/xujm/200510.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/c9/49/c9497bcab1bb2fd155321fa9f3d79b4b1322b326.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ipl.2005.07.003"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

An Algorithm for Constructing Hamiltonian Cycle in Metacube Networks

Yamin Li, Shietung Peng, Wanming Chu
<span title="">2007</span> <i title="IEEE"> Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2007) </i> &nbsp;
An MC(k, m) network can connect 2 m2 k +k nodes with m+k links per node, where k is the dimension of the high-level cubes (classes) and m is the dimension of the low-level cubes (clusters).  ...  Metacube (MC) is an attractive IN that can connect extremely large number of nodes with small number of links, meanwhile it holds a short diameter and keeps the simplicity of routing algorithm.  ...  Among these variations, only the CCC (cube-connected cycles) can keep the number of links per node within a small constant.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/pdcat.2007.4420182">doi:10.1109/pdcat.2007.4420182</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nmcq7npbwnavjjeu6dzjp4jznu">fatcat:nmcq7npbwnavjjeu6dzjp4jznu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809101307/http://cis.k.hosei.ac.jp/~yamin/papers/PDCAT07-MC.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/9e/e7/9ee7a3835196e2815c0e8e6675bcfdfeec059ac7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/pdcat.2007.4420182"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

An Algorithm for Constructing Hamiltonian Cycle in Metacube Networks

Yamin Li, Shietung Peng, Wanming Chu
<span title="">2007</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/6rmfmj3lu5bnba77hqv4pszbgi" style="color: black;">Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2007)</a> </i> &nbsp;
An MC(k, m) network can connect 2 m2 k +k nodes with m+k links per node, where k is the dimension of the high-level cubes (classes) and m is the dimension of the low-level cubes (clusters).  ...  Metacube (MC) is an attractive IN that can connect extremely large number of nodes with small number of links, meanwhile it holds a short diameter and keeps the simplicity of routing algorithm.  ...  Among these variations, only the CCC (cube-connected cycles) can keep the number of links per node within a small constant.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/pdcat.2007.9">doi:10.1109/pdcat.2007.9</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/pdcat/LiPC07.html">dblp:conf/pdcat/LiPC07</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/65x6nxo5gzfmpibj7ppu2bruyy">fatcat:65x6nxo5gzfmpibj7ppu2bruyy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809101307/http://cis.k.hosei.ac.jp/~yamin/papers/PDCAT07-MC.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/9e/e7/9ee7a3835196e2815c0e8e6675bcfdfeec059ac7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/pdcat.2007.9"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.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;
The authors show how large cube-connected cycles and butterflies can be simulated very efficiently on smaller ones by optimizing the dilation and the load of the embedding.  ...  Summary: “The twisted cube TQ, is derived by changing some connections of the hypercube Q,, according to specific rules.  ... 
<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>

Efficient VLSI layouts of hypercubic networks

Chi-Hsiang Yeh, E.A. Varvarigos, B. Parhami
<span title="">1999</span> <i title="IEEE"> Proceedings. Frontiers &#39;99. Seventh Symposium on the Frontiers of Massively Parallel Computation </i> &nbsp;
We show that an N-node hypercube and an N-node cube-connected cycles (CCC) graph can be laid out in 4N 2 =9 + oN 2 and 4N 2 =9 log 2 2 N + oN 2 = log 2 N areas, respectively, both of which are optimal  ...  We introduce the multilayer grid model, and present efficient layouts of hypercubes that use more than 2 layers of wires.  ...  Efficient layouts for CCC and reduced hypercubes An n-dimensional cube-connected cycles (CCC) graph is obtained by replacing each node in an n-cube with an n-node cycle [16] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/fmpc.1999.750589">doi:10.1109/fmpc.1999.750589</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/j5bnhjac7jer7lfb2ub7bkbcba">fatcat:j5bnhjac7jer7lfb2ub7bkbcba</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20081008185144/http://ce.et.tudelft.nl/publicationfiles/347_18_00750589.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/ce/a3/cea3f29ab13dbe4f26e5abd98ab609adf9806b8c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/fmpc.1999.750589"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Page 5632 of Mathematical Reviews Vol. , Issue 2004g [page]

<span title="">2004</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;
Letting f, and f,, be the numbers of faulty edges and vertices in CQ, we show that a cycle of length /, for any 4</<|V(CQ,)| — f,, can be embedded into a wounded crossed cube as long as the total number  ...  Summary: “The crossed cube CQ, introduced by Efe has many properties similar to those of the popular hypercube. However, the diameter of CQ,, is about one half of that of the hypercube.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_2004-07_2004g/page/5632" 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_2004-07_2004g/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Prefix Computation and Sorting in Dual-Cube

Yamin Li, Shietung Peng, Wanming Chu
<span title="">2008</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/3qrmigawsbhbljazwy2rerl5ni" style="color: black;">2008 37th International Conference on Parallel Processing</a> </i> &nbsp;
The first uses cluster structure of dual-cube, and the second uses recursive structure of the dual-cube.  ...  We propose efficient algorithms for parallel prefix computation and sorting in dual-cube based on the two techniques, respectively.  ...  However, one drawback to the hypercube is that the number of connections to each processor grows logarithmically with the size of the network, This will be a problem for very large parallel computers that  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icpp.2008.18">doi:10.1109/icpp.2008.18</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icpp/LiPC08.html">dblp:conf/icpp/LiPC08</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rq6iyi4jgfhevj4zfcdcc4n73u">fatcat:rq6iyi4jgfhevj4zfcdcc4n73u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170706015514/http://cis.k.hosei.ac.jp/~yamin/papers/ICPP2008.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/dc/0f/dc0fdf0d1a76f33c53dc1107746815c9ab3f3c0e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icpp.2008.18"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Performance analysis of the hypercube line switch

K. Bratbergsengen
<span title="">1988</span> <i title="ACM Press"> Proceedings of the third conference on Hypercube concurrent computers and applications Architecture, software, computer systems, and general issues - </i> &nbsp;
Each node acts as one blt of a shift reglater, end the word Is delayed one clock cycle. Data through the cube la delayed between 2 and D +l clock cycles, the average delay la D/2 + 1 clock cycles.  ...  The curves show prob. ablllty of failure (no connection establlshed) as a function of path length S In number of legs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/62297.62375">doi:10.1145/62297.62375</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/s7jr6uwa6nfcxby34xfmkuuhtu">fatcat:s7jr6uwa6nfcxby34xfmkuuhtu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809075604/http://www.idi.ntnu.no/grupper/dif/research/conference_paper/1988/134_HCCA88.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/77/ee/77eeb48b96e8e6cf4826bee3e947a9b130a5a1e4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/62297.62375"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Topological properties of hypercubes

Y. Saad, M.H. Schultz
<span title="">1988</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/5jlmyrayyrdazh5awdlsoec77q" style="color: black;">IEEE transactions on computers</a> </i> &nbsp;
Lee, Ghani, and Heron [4] have proposed a recovery cache for the PDP-11, for use in recovery block schemes [  ...  The authors would like to thank Dr. L. T. Wang and Z. Li for their encouragement and helpful suggestions. Alternatively, a special hardware unit can be used for state saving [3] , [4] .  ...  Proposition 2.5: The n-cube is a connected graph of diameter n. its ith position. Proof: Consider a cycle A I , A2, length of the cycle is necessarily even.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/12.2234">doi:10.1109/12.2234</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yn3e3qk6gzbvhpapeob5eyy2f4">fatcat:yn3e3qk6gzbvhpapeob5eyy2f4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170811054145/http://blough.ece.gatech.edu/6102/hypercube_paper.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/86/fa/86fa00b52ec60c115da99c234d7983030878e24e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/12.2234"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Iso-surface extraction in 4D with applications related to scale space [chapter]

Márta Fidrich
<span title="">1996</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;
Our work is a signi cant extension of the 3D Marching Lines algorithm with new orientation and implementation considerations.  ...  We present a method for extracting iso-surfaces and their intersections in 4D.  ...  We thank Bruce Latimer, Director at the Cleveland Museum of Natural History, Court Cutting, David Dean and Andr Gu ziec for the CT-scan data of the skull.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-62005-2_22">doi:10.1007/3-540-62005-2_22</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7ywluuo7oncxpnkevx3yvbu6sq">fatcat:7ywluuo7oncxpnkevx3yvbu6sq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190224124857/http://pdfs.semanticscholar.org/624f/070551baa99135c1960f36e09045ff10c6c7.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/62/4f/624f070551baa99135c1960f36e09045ff10c6c7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-62005-2_22"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 1,859 results