Results 11  20
of
328
Multiple Multicast with Minimized Node Contention on Wormhole kary ncube Networks
 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
, 1999
"... This paper presents a new approach to minimize node contention while performing multiple multicast/broadcast on wormhole kary ncube networks with overlapped destination sets. The existing multicast algorithms in the literature deliver poor performance under multiple multicast because these algor ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
This paper presents a new approach to minimize node contention while performing multiple multicast/broadcast on wormhole kary ncube networks with overlapped destination sets. The existing multicast algorithms in the literature deliver poor performance under multiple multicast because
Exploiting global knowledge to achieve selftuned congestion control for kary ncube networks
 IN IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
, 2004
"... Network performance in tightlycoupled multiprocessors typically degrades rapidly beyond network saturation. Consequently, designers must keep a network below its saturation point by reducing the load on the network. Congestion control via source throttlingâ€”a common technique to reduce the network ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
, or communication patterns. This paper presents a globalknowledgebased, selftuned, congestion control technique that prevents saturation at high loads across different communication patterns for kary ncube networks. Our design is composed of two key components. First, we use global information about a network
Global Reduction in Wormhole kary ncube Networks with Multidestination Exchange Worms
 IN INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM
, 1994
"... This paper presents a new approach to implement global reduction operations (including barrier synchronization) in wormhole kary ncubes. The novelty lies in using multidestination message passing mechanism instead of single destination (unicast) messages. Using pairwise exchange worms along eac ..."
Abstract

Cited by 12 (11 self)
 Add to MetaCart
This paper presents a new approach to implement global reduction operations (including barrier synchronization) in wormhole kary ncubes. The novelty lies in using multidestination message passing mechanism instead of single destination (unicast) messages. Using pairwise exchange worms along
nCube Network: Node Disjoint Shortest Paths for Maximal Distance Pairs of Vertices
 Parallel Computing 30 (2004), 973
, 2002
"... In parallel and distributed systems many communications take place concurrently, so the routing algorithm as well as the underlying interconnection network plays a vital role in delivering all the messages efficiently. Fault tolerance and performance are often obtained by delivering the messages thr ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
through node disjoint shortest paths. In this paper we present two ecient algorithms to construct, under certain conditions, pairwise node disjoint shortest paths for pairs of vertices in an ncube in the presence of faulty nodes.
A Performance Model for kAry nCube Networks with SelfSimilar Traffic
, 2002
"... Recently a number of studies have indicated that network traffic exhibits noticeable selfsimilar behaviour, i.e., traffic is bursty over a wide range of time scales. This fractallike nature of traffic has received significant attention in the networking community as it has a considerable impact on ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
workloads may be very costly and timeconsuming because the convergence of simulations to a steady state is often very slow as burstiness appears over many time scales. This paper proposes the first analytical performance model for kary ncubes with selfsimilar traffic. The validity of the model
Performance analysis of kary ncube interconnection networks
 IEEE Transactions on Computers
, 1990
"... AbstmctVLSI communication networks are wirelimited. The cost of a network is not a function of the number of switches required, but rather a function of the wiring density required to construct the network. This paper analyzes communication networks of varying dimension under the assumption of co ..."
Abstract

Cited by 357 (18 self)
 Add to MetaCart
of constant wire bisection. Expressions for the latency, average case throughput, and hotspot throughput of kary ncube networks with constant bisection are derived that agree closely with experimental measurements. It is shown that lowdimensional networks (e.g., tori) have lower latency and higher hot
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
unknown title
"... www.elsevier.com/locate/parco nCube network: node disjoint shortest paths for maximal distance pairs of vertices q ..."
Abstract
 Add to MetaCart
www.elsevier.com/locate/parco nCube network: node disjoint shortest paths for maximal distance pairs of vertices q
A Partial IrregularNetwork Routing on Faulty kary ncubes
"... Interconnection networks have been studied to connect a number of processing elements on parallel computers. Their design increasingly includes a challenge to high faulttolerance, as entire systems become complicated. This paper presents a partial irregularnetwork routing in order to provide a high ..."
Abstract
 Add to MetaCart
high faulttolerance in kary ncube networks. Since an irregularnetwork routing usually performs poorly in kary ncube networks, it is only used for progressive deadlockrecovery, and avoiding hard failures. The network is logically divided into the fault and regular regions. In the regular region
kary mway Networks: the Dual of kary ncubes
"... This article presents kary mway networks, multidimensional mesh and tori networks that are viewed as the dual of kary ncube networks. An mway channel is the physical wiring of m router and processor links. An mway router interfaces two channels only, irrespective of the network topology or dim ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This article presents kary mway networks, multidimensional mesh and tori networks that are viewed as the dual of kary ncube networks. An mway channel is the physical wiring of m router and processor links. An mway router interfaces two channels only, irrespective of the network topology
Results 11  20
of
328