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
Testing the dynamic full access property of a class of multistage interconnection networks
1994
IEEE Transactions on Parallel and Distributed Systems
Preserved Fulltext
We also evaluate the probability that a banyan network loses the DFA property, given the number of faulty switching elements. ...
A banyan network and its topologically equivalent ones have recently been adopted as the interconnection networks in a multiprocessor system. ...
An extensive comparison of the proposed reduced hypercube (RH) topology with the conventional hypercube is included. ...
doi:10.1109/71.329668
fatcat:sloeefv3b5cn3cxvkzygrpcati
The Folded Hypercube ATM Switches
[chapter]
2001
Lecture Notes in Computer Science
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 2004; you can also visit the original URL.
The file type is application/pdf.
This research proposes three new ATM switches based on the folded hypercube network (FHC). The performance of the three architectures are studied using a network model and simulation. ...
This research shows a new approach to designing ATM switches by using the FHC as the switching fabric for the first time instead of using the crossbar, multi-path, or Banyan-based switching fabrics. iii ...
Figure 2 . 2 13 Three different topologies of Banyan networks. A large number of proposed ATM switches are based on the Banyan networks due to their attractive properties [AhD89, AwM95b, Ch91, To90]. ...
doi:10.1007/3-540-47734-9_37
fatcat:7pnxi33dcrbvflwpabbxopspbq
Page 473 of Mathematical Reviews Vol. , Issue 94a
[page]
1994
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.
The number of spanning trees of the generalized hypercube network. (English summary)
Math. Comput. Modelling 17 (1993), no. 6, 97-107. ...
In this paper, generalized hypercube networks are presented, based on a mixed radix number system. ...
An Efficient Dynamic Parallel and Distributed Network with Hybrid Hyper Cube
2020
International Journal of Advanced Trends in Computer Science and Engineering
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 2020; you can also visit the original URL.
The file type is application/pdf.
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. ...
hypercube and torus. ...
The Hybrid Hypercube is a variation of the hypercube and it gives a promising topology of interconnection networks for enormously equal frameworks. ...
doi:10.30534/ijatcse/2020/147942020
fatcat:fw76mz2eeramxjk5ayzjy6ur3m
Optimal all-to-all personalized exchange in d-nary banyan multistage interconnection networks
2007
Journal of combinatorial optimization
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 this paper, we will correct the flaw and generalize Massini's algorithm to be applicable to d-nary (each switch is of size d × d) banyan multistage interconnection networks. ...
Thus in (Discret Appl Math 128:435-446, 2003), Massini proposed a new optimal algorithm, which is independent of the network topologies and does not require pre-computation or memory allocation for a Latin ...
Acknowledgement The main results of this paper was done while the first author was a student in Professor Frank K. Hwang's Interconnection Networks class. ...
doi:10.1007/s10878-007-9065-5
fatcat:jyo4gp3lgzdt3br5ucvzfhxznm
Fractal Aspects in Classical Parallel Computing
2016
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 2018; you can also visit the original URL.
The file type is application/pdf.
In this paper, we prove that many parallel communication topologies and several parallel algorithms have fractal properties, which leads to the idea that there is a strong connection between the classical ...
Maricel Agop contributed to preparing Section 1, and he conceived of Section 2 (Self-Similarity Property of Fractals). All the authors have read and approved the final manuscript. ...
Conflicts of Interest: The authors declare no conflict of interest. ...
doi:10.3390/computers5030019
fatcat:z6rr7yt5ifgnvetppsgrqwvat4
The REFINE multiprocessor — theoretical properties and algorithms
1995
Parallel 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 2017; you can also visit the original URL.
The file type is application/pdf.
of the capabilities of the hypercube topology. ...
The mathematical properties of the REFINE topology and the hardware for the reconfiguration switch are described. ...
The reconfigurable network for RF, thus enables the REFINE multiprocessor to possess many of the desired properties of a general purpose reconfigurable system. ...
doi:10.1016/0167-8191(95)00032-9
fatcat:avvtr7fbxjaxnemwcyykst7tpe
All-to-all personalized communication on multistage interconnection networks
2003
Discrete Applied Mathematics
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.
; furthermore it is applicable to any log N stage multistage networks since it is independent of the topology. ? ...
In this paper, we consider this problem for log N stage Multistage Interconnection Networks (MINs). It is proved that the set of admissible permutations for a MIN can be partitioned in Latin Squares. ...
Finally, each of the equivalent log N stage banyan MINs requires an "ad hoc" decomposition in basic permutations, since the algorithm to obtain the Latin Square depends on the network topology. ...
doi:10.1016/s0166-218x(02)00504-8
fatcat:m4rwibhwi5gxvonc47fpngtjla
A New Cost Effective and Reliable Interconnection Topology for Parallel Computing Systems
2019
International Journal of Engineering and Advanced Technology
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 2020; you can also visit the original URL.
The file type is application/pdf.
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 proposed topology (TC) exploits
most of the important properties of hypercube and torus. ...
doi:10.35940/ijeat.f8363.088619
fatcat:jbf7a4fp4zha3akd6r7rhw7ja4
BanyanNet-a bidirectional equivalent of ShuffleNet
1994
Journal of Lightwave Technology
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 2010; you can also visit the original URL.
The file type is application/pdf.
A number of virtual topologies have been proposed [8]. These include: ShuffleNet [9], [lo], [7], Hypercube [ 1 I], Generalized Hypercube [8], DeBmijn [12], and MSN (Manhattan Street Network) [13]. ...
Such assignments are based on an interconnection topology. Since this topology is not directly related to the physical connection of nodes, it is referred to as a virtual topology. ...
These networks are essentially made up of superimposed trees. ("Banyan" is the name of a multiply rooted tree in India.) Of the general class of Banyan networks, ShuffleNet. (b) Star implementation. ...
doi:10.1109/50.336068
fatcat:yep3nobcybfnnppmuulkshihai
Overlapped Subarray Segmentation: An Efficient Test Method for Cellular Arrays
1993
VLSI design (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.
As such, it is directly applicable to most arithmetic circuits which are generally quite regular. It is based on exhaustive testing of overlapping segments of the array. ...
The high coverage of the proposed technique makes it attractive for testing current VLSI and future WSI arrays. ...
Specifically, the topological testing approach is demonstrated by developing tests for the multistage interconnection network and the hypercube network. ...
doi:10.1155/1993/76586
fatcat:zswn5ilxsjeibldh5u6b2t2jx4
Guest Editor's Introduction Interconnection Networks for Parallel and Distributed Processing
1987
Computer
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 2015; you can also visit the original URL.
The file type is application/pdf.
A number of structures or topologies such as loop, tree, full connection, and hypercube have been proposed to connect a network of computers. ...
It compares the properties of different networks and provides the reader with the state of the art in this area. ...
doi:10.1109/mc.1987.1663585
fatcat:yxvykdw3uvcgtnzpgyu32cek54
Properties and performance of the block shift network
1997
IEEE Transactions on Circuits and Systems I Fundamental Theory and 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 2006; you can also visit the original URL.
The file type is application/pdf.
The topological properties of the BSN with different parameters are analyzed and compared with those of existing popular networks. ...
As an interconnection network, hypercube topology offers certain advantages such as high data bandwidth and low message latency to achieve computational efficiency. ...
Combination of several different networks has been used to construct new networks. Recent examples are Hyperbanyan [13] , Banyan-hypercube [33] , and Hyper-deBruijn [14] . ...
doi:10.1109/81.554320
fatcat:yvgukltjbvdmle3oy2ac25eju4
Parallel routing and wavelength assignment for optical multistage interconnection networks
2004
International Conference on Parallel Processing, 2004. ICPP 2004.
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.
Multistage interconnection networks (MINs) are among the most efficient switching architectures in terms of the number of switching elements (SEs) used. ...
By applying our permutation decomposition and graph coloring techniques, the proposed algorithms can route any permutation without crosstalk in wavelength-rearrangeable space-strict-sense Banyan networks ...
Several well-known networks, such as Banyan, Butterfly, Omega, and Baseline, belong to this class. It has been shown that these networks are topologically equivalent [1] . ...
doi:10.1109/icpp.2004.1327924
dblp:conf/icpp/LuZ04
fatcat:uorhyoyeobckrcvjksfe5h4vq4
Optical binary de Bruijn networks for massively parallel computing: design methodology and feasibility study
1995
Applied Optics
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 2016; you can also visit the original URL.
The file type is application/pdf.
One of the most popular point-to-point interconnection networks for parallel computers today is the hypercube. ...
Unfortunately the hypercube possesses a major drawback, which is the complexity of its node structure: the number of links per node increases as the network grows in size. ...
This property makes it very difficult to construct large-scale systems with the hypercube topology. The second popular network is the mesh topology. ...
doi:10.1364/ao.34.006714
pmid:21060526
fatcat:fibhmcylqbhznc7jbuebzcj7om
« Previous
Showing results 1 — 15 out of 66 results