A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Simulation of Meshes in a Faulty Supercube with Unbounded Expansion
2011
International Journal of Advancements in Computing Technology
Preserved Fulltext
The paper considers the problem of finding meshes and tori in a Faulty Incrementally Extensible Hypercube if any. ...
These simulation approach shows a mesh or torus can be embedded into a faulty IEH G n (N) with load 1, congestion 1 and dilation 3 such that O(n 2 -⎣log 2 m ⎦ 2 ) faults can be tolerated. ...
After a mesh is mapped in an IEH, we develop new algorithms to facilitate the embedding meshes and tori in a faulty IEH. Our results demonstrate that O(n 2 -⎣log 2 m ⎦ 2 ) faults can be tolerated. ...
doi:10.4156/ijact.vol3.issue8.33
fatcat:4whocads6zgyhmjutp3dyxi67u
A case for random shortcut topologies for HPC interconnects
2012
2012 39th Annual International Symposium on Computer Architecture (ISCA)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
tori. ...
Using flit-level discrete event simulation we find that random shortcut topologies achieve throughput comparable to and latency lower than that of existing non-random topologies such as hypercubes and ...
ACKNOWLEDGMENTS This work was partially supported by JST CREST and by NSF Award CNS-0855245. ...
doi:10.1109/isca.2012.6237016
dblp:conf/isca/KoibuchiMAHC12
fatcat:gn5k7edymbehde2abrlnwmxcqa
A case for random shortcut topologies for HPC interconnects
2012
SIGARCH Computer Architecture News
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
tori. ...
Using flit-level discrete event simulation we find that random shortcut topologies achieve throughput comparable to and latency lower than that of existing non-random topologies such as hypercubes and ...
ACKNOWLEDGMENTS This work was partially supported by JST CREST and by NSF Award CNS-0855245. ...
doi:10.1145/2366231.2337179
fatcat:rzl4nazetzad5hlpju7wbovyqm
On the Embedding of a Class of Regular Graphs in a Faulty Hypercube
1996
Journal of Parallel and Distributed Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
These include rings, linear paths, binomial trees, binary trees, meshes, tori, and many others. ...
In many cases, the degree of fault tolerance o ered by the algorithm is optimal or near-optimal. ...
Fault-tolerant embedding of meshes in injured hypercubes was studied in 22] . ...
doi:10.1006/jpdc.1996.0120
fatcat:fblfo7c3ufb6bnflephu273nra
Page 7270 of Mathematical Reviews Vol. , Issue 98K
[page]
1998
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
spanning trees, and (5) embedding of rings, tori, and hypercubes.”
68 COMPUTER SCIENCE
98k:68024 68MI10 68Q05 68Q25
Yamashita, M. | Yamashita, Masafumi]
(J-HROSE-EE; Higashi-Hiroshima) ;
Kameda, T. ...
A graph is called a k node fault-tolerant n xn mesh if failure of k nodes yields a graph which contains an n x n mesh as a subgraph. ...
Transposition networks as a class of fault-tolerant robust networks
1996
IEEE transactions on computers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In [BCH93], the authors have investigated the idea of adding wildcard dimensions to meshes and tori, and they have constructed dimensionally-augmented meshes and tori. ...
While the T n can efficiently embed star and bubble-sort graphs, it can also lend itself to an efficient embedding of meshes and hypercubes. ...
One of the reviewers brought to our attention the existence of the paper [HLD94] which discusses some aspects of fault tolerance of transposition networks. ...
doi:10.1109/12.485375
fatcat:zkqel7tbyrefhesm2ngx7cxtpa
A generalized fault-tolerant sorting algorithm on a product network
2005
Journal of systems architecture
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A product network defines a class of topologies that are very often used such as meshes, tori, and hypercubes, etc. ...
Our generalized sorting algorithm can be applied to any product network only if the factor graph of the product graph can be embedding in a ring. ...
Examples of product networks include hypercubes, grids, and tori. ...
doi:10.1016/j.sysarc.2004.11.005
fatcat:vy3q25ekbnggnga7lkwtt67ese
Topological exploration for the efficient design of three-dimensional Network on Chip architectures
2020
2020 Third International Conference on Advances in Electronics, Computers and Communications (ICAECC)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
in 3D NoC's. ...
The 3D IC's enable the optical devices, analog circuitry and digital circuitry in three different layers which is a unique feature to develop highly heterogeneous and multifunctional systems. ...
Hypercube topology has large bandwidth with maximum fault tolerance .It is a recursive structure and has maximum fault tolerance. ...
doi:10.1109/icaecc50550.2020.9339506
fatcat:nv6b5k2c6jfyhdhia3xw6qkl3e
Combinatorial Techniques and Objects in Computer Science: Fault-tolerance and Other Interesting Applications
1996
European journal of combinatorics (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We also present our results for the case of fault-tolerance in hypercube-based parallel computer architectures , where we show the involvement of t -designs and t -covers in the structure of extremal fault-sets ...
online transaction processing (Section IV) ; in Part B , we briefly present our results in the areas of fault-tolerance . ...
In [24] , diagonal graphs are similarly employed to create fault-tolerant d -dimensional meshes and hypercubes of small degree , tori , 8-connected meshes and hexagonal meshes . ...
doi:10.1006/eujc.1996.0009
fatcat:girs75cznvdznkyddrs4qxsa5e
Adaptive and fault-tolerant routing algorithms for high performance 2D torus interconnection network
1992
Computers and Mathematics with Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The required hardware overhead for realizing the fault-tolerant scheme is small and no time penalty is paid in the fault-free cARe. ...
Adaptive and fault-tolerant schemes for muting messages in a 2D torns interconnection network for distributed memory multi-computers (message passing concurrent computers) are presented. ...
Dally [6] analyzes k-ary n-cube, including rings, tori, and hypercubes, under the assumptions that (1) networks must be embedded into the plane, (2) wire density is held constant This research work was ...
doi:10.1016/0898-1221(92)90075-s
fatcat:t4g3f2q6ondtbfgxesbc6e4zvu
Routing in modular fault-tolerant multiprocessor systems
1995
IEEE Transactions on Parallel and Distributed Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In the presence off faults in hypercubes and tori, we show that the worst case length of the message route is min {cr + f, (K + l)o} + c where cr is the shortest path in the absence of faults, K is the ...
Such a strategy may be applied to a variety of architectures including binary hypercubes and threedimensional tori. ...
Clearly, the FTBBs in the resulting system will satisfy the strong neighbors property. Hypercubes, meshes, and tori are examples of Cartesian product networks. ...
doi:10.1109/71.476192
fatcat:cv5eeu6glreihgdbjdee4csl5e
Fault diameter of k-ary n-cube networks
1997
IEEE Transactions on Parallel and Distributed Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
These results are then used to derive the fault diameter of the k-ary n-cube, which is shown to be D + 1 where D is the fault free diameter. ...
These results improve those obtained in [8] where the length of some of the paths has a variable increase (which can be arbitrarily large) over the minimum length. ...
, fault tolerance, low-cost embedding of other topologies, and support of efficient communication. ...
doi:10.1109/71.615436
fatcat:kzpnxzt7xfadvhnc3cv3qzgvvu
Communication algorithms in k-ary n-cube interconnection networks
1997
Information Processing Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In a static (or fixed) network, the nodes represent processors. Examples of static networks include rings, trees, meshes, tori, and hypercubes (all to be defined later). ...
Among these are the ring, the mesh, the tree, the torus, and the hypercube. ...
doi:10.1016/s0020-0190(96)00188-3
fatcat:6zlxe2ntdrckrkdz55a7mweuva
Honeycomb networks: Topological properties and communication algorithms
1997
IEEE Transactions on Parallel and Distributed Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
meshes and tori) tessellations. ...
The network cost, defined as the product of degree and diameter, is better for honeycomb networks than for the two other families based on square (mesh-connected computers and tori) and triangular (hexagonal ...
ACKNOWLEDGMENTS The author is grateful to the referees whose careful reading has greatly improved the clarity and conciseness of the presentation, and to Professor Michael A. ...
doi:10.1109/71.629486
fatcat:thpowr3xnzdlfeacs6eskcnj6i
Periodically regular chordal rings
1999
IEEE Transactions on Parallel and Distributed Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
them to competing fixed-degree architectures such as symmetric chordal rings, meshes, tori, and cube-connected cycles. ...
This flexibility has important implications for key system attributes such as architectural scalability, software portability, and fault tolerance. ...
They also provide smaller diameter and average distance than similar-sized 2D meshes, 2D tori, and CCC networks, support simpler routing algorithms, and are more easily adapted to fault tolerance in routing ...
doi:10.1109/71.774913
fatcat:6hyc53mngfehbchy5opccnrgqu
« Previous
Showing results 1 — 15 out of 57 results