Results 1  10
of
38,181
The gGoodNeighbor Conditional Diagnosability of kAry nCubes under the PMC Model and MMModel
"... Abstractâ€”The diagnosability of a system is defined as the maximum number of faulty processors that the system can guarantee to identify, which plays an important role in measuring of the reliability of multiprocessor systems. In the work of Peng et al. in 2012, they proposed a new measure for fault ..."
Abstract
 Add to MetaCart
the PMC model and MM model for k 4; n 3 and 0 g n: Our study shows the ggoodneighbor conditional diagnosability of kary ncube is several times larger than the classical diagnosability of kary ncube. Index Termsâ€”PMC diagnosis model, MM diagnosis model, kary ncube, conditional connectivity
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 11 (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
On bottleneck partitioning of kary ncubes
, 1994
"... Graph partitioning is a topic of extensive interest, with applications to parallel processing. In this context graph nodes typically represent computation, and edges represent communication. One seeks to distribute the workload by partitioning the graph so that every processor has approximately the ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
to be the bottleneck, or maximal processor cost induced by the partition. For a general graph the problem of finding an optimal partitioning is intractable. In this paper we restrict our attention to the class of kary ncube graphs with uniformly weighted nodes. (liven mild restrictions on the node weight and number
On Bottleneck Partitioning of kary ncubes
, 1994
"... Graph partitioning is a topic of extensive interest, with applications to parallel processing. In this context graph nodes typically represent computation, and edges represent communication. One seeks to distribute the workload by partitioning the graph so that every processor has approximately the ..."
Abstract
 Add to MetaCart
to be the boitleneck, or maximal processor cost induced by the partition. For a general graph the problem of finding an optimal partitioning is intractable. In this paper we restrict our attention to the class of kary ncube graphs with uniformly weighted nodes. Given mild restrictions on the node weight and number
Throughput Fairness in KAry NCube Networks
"... The performance of an interconnection network is measured by two metrics: average latency and peak network throughput. Network throughput is the total number of packets delivered per unit of time. ..."
Abstract
 Add to MetaCart
The performance of an interconnection network is measured by two metrics: average latency and peak network throughput. Network throughput is the total number of packets delivered per unit of time.
Modelling freespace optical kary ncube wormhole networks
 J Parallel Distr Comput
, 1998
"... This paper presents an optical interconnect model for kary ncube network topologies based on freespace analysis. This model integrates relevant parameters inherent to optics with traditional network parameters to make it applicable for performance evaluation of parallel processor optical network ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper presents an optical interconnect model for kary ncube network topologies based on freespace analysis. This model integrates relevant parameters inherent to optics with traditional network parameters to make it applicable for performance evaluation of parallel processor optical network
TotalExchange on Wormhole kary ncubes with Adaptive Routing
, 1998
"... The totalexchange is one of the most dense communication patterns and is at the heart of numerous applications and programming models in parallel computing. In this paper we present a simple randomized algorithm to efficiently schedule the totalexchange on the family of kary ncubes with adaptive ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
The totalexchange is one of the most dense communication patterns and is at the heart of numerous applications and programming models in parallel computing. In this paper we present a simple randomized algorithm to efficiently schedule the totalexchange on the family of kary ncubes
Minimal Adaptive Routing with Limited Injection on Toroidal kary ncubes
 In Supercomputing 96
, 1996
"... Virtual channels can be used to implement deadlock free adaptive routing algorithms and increase network throughput. Unfortunately, they introduce asymmetries in the use of buffers of symmetric networks as the toroidal kary ncubes. ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
Virtual channels can be used to implement deadlock free adaptive routing algorithms and increase network throughput. Unfortunately, they introduce asymmetries in the use of buffers of symmetric networks as the toroidal kary ncubes.
An Analysis of Connectivity of kary ncube mdiag Interconnection Networks
, 1992
"... The difference among different topologies in interconnection networks is a debated issue among highly parallel machine designers, since opposing parameters influence the network performance. This paper presents a new model, kary ncube mdiags, which generalizes existing kary ncube topologies to ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
The difference among different topologies in interconnection networks is a debated issue among highly parallel machine designers, since opposing parameters influence the network performance. This paper presents a new model, kary ncube mdiags, which generalizes existing kary ncube topologies
Results 1  10
of
38,181