Filters








9,230 Hits in 3.3 sec

An Algorithm for Constructing Hamiltonian Cycle in Metacube Networks

Yamin Li, Shietung Peng, Wanming Chu
2007 Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2007)  
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).  ...  In this paper, we show that the Metacube is Hamiltonian and give an efficient algorithm to construct a Hamiltonian cycle in Metacube networks.  ...  If a Hamiltonian cycle exists, many algorithms, originally based on ring or linear array, can be applied to the interconnection network.  ... 
doi:10.1109/pdcat.2007.4420182 fatcat:nmcq7npbwnavjjeu6dzjp4jznu

An Algorithm for Constructing Hamiltonian Cycle in Metacube Networks

Yamin Li, Shietung Peng, Wanming Chu
2007 Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2007)  
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).  ...  In this paper, we show that the Metacube is Hamiltonian and give an efficient algorithm to construct a Hamiltonian cycle in Metacube networks.  ...  If a Hamiltonian cycle exists, many algorithms, originally based on ring or linear array, can be applied to the interconnection network.  ... 
doi:10.1109/pdcat.2007.9 dblp:conf/pdcat/LiPC07 fatcat:65x6nxo5gzfmpibj7ppu2bruyy

Performance evaluation of wormhole routed network processor-memory interconnects

T. Kocak, J. Engel
2006 Proceedings 20th IEEE International Parallel & Distributed Processing Symposium  
We utilize our customdesigned, event-driven, interconnect simulator to evaluate the performance of wormhole routed packet-based off-chip k-ary n-cube interconnect architectures for line cards.  ...  Our performance results show that wormhole routed k-ary n-cube based interconnect topologies significantly outperform the existing line card interconnects and they are able to sustain higher traffic loads  ...  Results show that k-ary n-cube based topologies significantly outperforms the current solutions on network line cards.  ... 
doi:10.1109/ipdps.2006.1639641 dblp:conf/ipps/KocakE06 fatcat:v4omw3rkwjczxdvokzopth4fgm

Off-chip communication architectures for high throughput network processors

Jacob Engel, Taskin Kocak
2009 Computer Communications  
We investigate multiple k-ary n-cube based interconnects and propose two variations of 2-ary 3-cube interconnect called the 3D-bus and 3D-mesh.  ...  Therefore, indirect interconnects are replaced with direct, packet-based networks such as mesh, torus or k-ary n-cubes.  ...  InFig. 4.32 the number of cubes is based on the number of 3D-cubes appear in different dimensions of the Torus network.For example, in a 4-dimensional Torus network there are 2 3D-cubes connected as shown  ... 
doi:10.1016/j.comcom.2008.12.043 fatcat:n44wcdfjgjhzji5tzqgx2abo3q

K-ary n-cube based off-chip communications architecture for high-speed packet processors

J. Engel, T. Kocak
2005 48th Midwest Symposium on Circuits and Systems, 2005.  
A k-ary n-cube interconnect architecture is proposed, as an off-chip communications architecture for line cards, to increase the throughput of the currently used memory system.  ...  The k-ary n-cube architecture allows multiple packet processing elements on a line card to access multiple memory modules.  ...  The load or offered-load is the number of packets injected into the interconnect network per second and depends on the processing elements which are generating them.  ... 
doi:10.1109/mwscas.2005.1594497 fatcat:hdx7hjifvjc7bpwzmirrjshy7u

Fault diameter of interconnection networks

M.S. Krishnamoorthy, B. Krishnamurthy
1987 Computers and Mathematics with Applications  
We derive fault diameter of specific classes of commonly used interconnection networks and various types of product graphs.  ...  We introduce the concept of fault diameter of interconnection networks. The motivation is to estimate the degradation of performance under maximally fault conditions.  ...  INTRODUCTION A number of researchers have investigated the design of fault tolerant interconnection networks. A common notion of fault tolerance is based on the connectivity of the underlying graph.  ... 
doi:10.1016/0898-1221(87)90085-x fatcat:ap5ftdzst5f75fomdat6wxl5ha

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

2019 International Journal of Engineering and Advanced Technology  
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  ...  Additional links from a torus interconnection network are added to the base hypercube interconnection network to form an n-dimensional TOR-CUBE. e.g.  ... 
doi:10.35940/ijeat.f8363.088619 fatcat:jbf7a4fp4zha3akd6r7rhw7ja4

Topological Properties of Hierarchical Interconnection Networks: A Review and Comparison

Mostafa Abd-El-Barr, Turki F. Al-Somani
2011 Journal of Electrical and Computer Engineering  
The first class includes Hierarchical Cubic Networks, Hierarchical Completely Connected Networks, and Triple-based Hierarchical Interconnection Networks.  ...  Hierarchical interconnection networks (HINs) provide a framework for designing networks with reduced link cost by taking advantage of the locality of communication that exists in parallel applications.  ...  Acknowledgments The authors would like to acknowledge the support of Kuwait University and Al Baha University.  ... 
doi:10.1155/2011/189434 fatcat:kzljlcwa5rb4hdxfjhxsuumou4

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

Wenjun Xiao, Behrooz Parhami
2005 International Journal of Computer Mathematics  
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 also derive a general factorization theorem on subgraphs of Cayley digraphs by their automorphism groups.  ...  Acknowledgements Wenjun Xiao's research was supported by the Natural Science Foundation of China and Fujian Province.  ... 
doi:10.1080/00207160512331331101 fatcat:vf3druz67zehdf3dw2wmjrceaa

The offset cube: a three-dimensional multicomputer network topology using through-wafer optics

W.S. Lacy, J.L. Cruz-Rivera, D.S. Wills
1998 IEEE Transactions on Parallel and Distributed Systems  
While the offset cube is not proposed as a general replacement for the mesh topology, it leverages the benefits of through-wafer optical interconnect more effectively than a mesh by completely eliminating  ...  This paper presents the offset cube, a new network topology designed to exploit the packaging benefits of through-wafer optical interconnect in ultra-compact MPP systems.  ...  ACKNOWLEDGEMENTS We wish to thank Sudhakar Yalamanchili for reviewing a draft of this paper and for his insightful feedback during several discussions.  ... 
doi:10.1109/71.722222 fatcat:dtwoffijljcvljq7e7fezzkmza

Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

Dally, Seitz
1987 IEEE transactions on computers  
A deadlock-free routing algorithm can be generated for arbitrary interconnection networks using the concept of virtual channels.  ...  This method is used to develop deadlock-free routing algorithms for k-ary n-cubes, for cube-connected cycles, and for shuffle-exchange networks.  ...  Steele for pointing out problems in an early version of this paper and the referees for their helpful suggestions.  ... 
doi:10.1109/tc.1987.1676939 fatcat:hdykfs6ab5ef3gjnxtepojnqta

An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes

D.H. Linder, J.C. Harden
1991 IEEE transactions on computers  
Virtual interconnection networks allowing adaptive, deadlock-free routing arc examined for three k-ary n-cube topologies: unidirectional, torus-connected bidirectional, and mesh-connected bidirectional  ...  A channel dependency graph is taken as the definition of what connections are possible and any routing function must use only those connections defined by it.  ...  The physical interconnection network for a mesh-connected 4-ary 2-cube is identical to the network in Fig. 4 except that the end-around connections are dropped.  ... 
doi:10.1109/12.67315 fatcat:xpfxamxmbjfptpgtqwr5woppt4

The Hamiltonicity of Crossed Cubes in the Presence of Faults

Emad Abuelrub
2008 Engineering Letters  
The crossed cube is considered as one of the most promising variations of the hypercube topology, due to its ability of preserving many of the attractive properties of the hypercube and reducing the diameter  ...  by a factor of two.  ...  HAMILTONICITY OF A FAULTY CROSSED CUBE One of the special significant features of the crossed cube is its ability to simulate other interconnection networks in the presence of faults.  ... 
dblp:journals/engl/Abuelrub08 fatcat:e2mlmqtqk5fdrednlvihhl4xb4

An Efficient Dynamic Parallel and Distributed Network with Hybrid Hyper Cube

Venkat Reddy P
2020 International Journal of Advanced Trends in Computer Science and Engineering  
In this manuscript, we suggest another hybrid interconnection network topology named "Hybrid Hyper Cube (HHC)"that will be a result of two old style mainstream interconnection geographies to be specific  ...  The interconnection network topology is the very significant contemplations in plan of equal frameworks as it is spine network over that the various parts of PC speak with one another.  ...  PROPOSED NETWORK Interconnection networks assume a significant job in the general execution of the framework.  ... 
doi:10.30534/ijatcse/2020/147942020 fatcat:fw76mz2eeramxjk5ayzjy6ur3m

Sufficient conditions for Hamiltonicity in multiswapped networks

Iain A. Stewart
2017 Journal of Parallel and Distributed Computing  
happens, multiswapped networks also generalize previously studied hierarchical crossed cubes).  ...  This lends credence to the role of tori as fundamental networks within the study of interconnection networks.  ...  This work was supported by the EPSRC grant 'Interconnection Networks: Practice unites with Theory (INPUT)' EP/K015680/1.  ... 
doi:10.1016/j.jpdc.2016.10.015 fatcat:xnmhmgiymzatdf6vbfyw5gwzma
« Previous Showing results 1 — 15 out of 9,230 results