Results 21  30
of
328
Efficient dispersal of information for security, load balancing, and fault tolerance
 Journal of the ACM
, 1989
"... Abstract. An Information Dispersal Algorithm (IDA) is developed that breaks a file F of length L = ( F ( into n pieces F,, 1 5 i 5 n, each of length ( F, 1 = L/m, so that every m pieces suffice for reconstructing F. Dispersal and reconstruction are computationally efficient. The sum of the lengths ..."
Abstract

Cited by 561 (1 self)
 Add to MetaCart
cations between processors in parallel computers. For the latter problem provably timeefftcient and highly faulttolerant routing on the ncube is achieved, using just constant size buffers. Categories and Subject Descriptors: E.4 [Coding and Information Theory]: nonsecret encoding schemes
Alleviating Consumption Channel Bottleneck in WormholeRouted kary ncube Systems
, 1997
"... This paper identifies performance degradation in wormhole routed kary ncube networks due to limited number of routertoprocessor consumption channels at each node. Many recent research in wormhole routing have advocated the advantages of adaptive routing and virtual channel flow control schemes t ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
This paper identifies performance degradation in wormhole routed kary ncube networks due to limited number of routertoprocessor consumption channels at each node. Many recent research in wormhole routing have advocated the advantages of adaptive routing and virtual channel flow control schemes
The Generalized Dimension Exchange Method for Load Balancing in kary ncubes and Variants
, 1995
"... The Generalized Dimension Exchange (GDE) method is a fully distributed load balancing method that operates in a relaxation fashion for multicomputers with a direct communication network. It is parameterized by an exchange parameter that governs the splitting of load between a pair of directly conne ..."
Abstract

Cited by 44 (9 self)
 Add to MetaCart
connected processors during load balancing. An optimal would lead to the fastest convergence of the balancing process. Previous work has resulted in the optimal for the binary ncubes. In this paper, we derive the optimal 's for the kary ncube network and its variantsthe ring, the torus
Optimal Phase Barrier Synchronization in kary ncube Wormholerouted Systems Using Multirendevouz Primitives
 In Workshop on FineGrain Massively Parallel Coordination
, 1993
"... : We propose a new multiphase barrier synchronization algorithm for kary ncube networks using our earlier developed multirendezvous synchronization primitives [4]. The algorithm incurs minimal cost with optimal number of communication phases. The optimality is guided by system configuration parame ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
: We propose a new multiphase barrier synchronization algorithm for kary ncube networks using our earlier developed multirendezvous synchronization primitives [4]. The algorithm incurs minimal cost with optimal number of communication phases. The optimality is guided by system configuration
Augmented kary ncubes
 Information Sciences
"... We define an interconnection network AQn,k which we call the augmented kary ncube by extending a kary ncube in a manner analogous to the existing extension of an ndimensional hypercube to an ndimensional augmented cube. We prove that the augmented kary ncube AQn,k has a number of attractive ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We define an interconnection network AQn,k which we call the augmented kary ncube by extending a kary ncube in a manner analogous to the existing extension of an ndimensional hypercube to an ndimensional augmented cube. We prove that the augmented kary ncube AQn,k has a number of attractive
Express cubes: Improving the performance of kary ncube interconnection networks
 IEEE Transactions on Computers
, 1991
"... AbstructExpress cubes are kary ncube interconnection networks augmented by express channels that provide a short path for nonlocal messages. An express cube combines the logarithmic diameter of a multistage network with the wireefficiency and ability to exploit locality of a lowdimensional mes ..."
Abstract

Cited by 60 (2 self)
 Add to MetaCart
AbstructExpress cubes are kary ncube interconnection networks augmented by express channels that provide a short path for nonlocal messages. An express cube combines the logarithmic diameter of a multistage network with the wireefficiency and ability to exploit locality of a low
A Cost and Speed Model for kary ncube Wormhole Routers
 HIT INTERCONNECTS '93
, 1993
"... A great deal of research has been published on the performance of wormhole routers with advanced features such as adaptivity and virtual lanes. In most cases, the effectiveness of such novel routers is evaluated on the basis of the achieved network throughput (channel utilization), ignoring the impo ..."
Abstract

Cited by 148 (1 self)
 Add to MetaCart
A great deal of research has been published on the performance of wormhole routers with advanced features such as adaptivity and virtual lanes. In most cases, the effectiveness of such novel routers is evaluated on the basis of the achieved network throughput (channel utilization), ignoring
Multicasting in the Hypercube, Chord and Binomial Graphs
, 2009
"... We discuss multicasting for the ncube network and its close variants, the Chord and the Binomial Graph (BNG) Network. We present simple transformations and proofs that establish that the spmulticast (shortest path) and Steiner tree problems for the ncube, Chord and the BNG network are NPComplete ..."
Abstract
 Add to MetaCart
We discuss multicasting for the ncube network and its close variants, the Chord and the Binomial Graph (BNG) Network. We present simple transformations and proofs that establish that the spmulticast (shortest path) and Steiner tree problems for the ncube, Chord and the BNG network are NP
The NonUniform Communication Performance of Adaptive Routing for Hierarchical Interconnection Network for 3D
"... The Toriconnected mESH (TESH) Network is a kary ncube networks of multiple basic modules, in which the basic modules are 2Dmesh networks that are hierarchically interconnected for higher level kary ncube networks. Many adaptive routing algorithms for kary ncube networks have already been pro ..."
Abstract
 Add to MetaCart
The Toriconnected mESH (TESH) Network is a kary ncube networks of multiple basic modules, in which the basic modules are 2Dmesh networks that are hierarchically interconnected for higher level kary ncube networks. Many adaptive routing algorithms for kary ncube networks have already been
Incomplete kary ncube and Its Derivatives
 J. Parallel and Distributed Computing
, 2004
"... Incomplete or pruned kary ncube, nX3; is derived as follows. All links of dimension n 1 are left in place and links of the remaining n 1 dimensions are removed, except for one, which is chosen periodically from the remaining dimensions along the intact dimension n 1: This leads to a node degree of ..."
Abstract

Cited by 10 (8 self)
 Add to MetaCart
Incomplete or pruned kary ncube, nX3; is derived as follows. All links of dimension n 1 are left in place and links of the remaining n 1 dimensions are removed, except for one, which is chosen periodically from the remaining dimensions along the intact dimension n 1: This leads to a node degree
Results 21  30
of
328