Results 11 - 20 of 328

Multiple Multicast with Minimized Node Contention on Wormhole k-ary n-cube Networks

by Ram Kesavan, Dhabaleswar K. Panda - 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 k-ary n-cube 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 k-ary n-cube networks with overlapped destination sets. The existing multicast algorithms in the literature deliver poor performance under multiple multicast because

Exploiting global knowledge to achieve self-tuned congestion control for k-ary n-cube networks

by Mithuna Thottethodi, Alvin R. Lebeck, Shubhendu S. Mukherjee - IN IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS , 2004
"... Network performance in tightly-coupled 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 global-knowledge-based, self-tuned, congestion control technique that prevents saturation at high loads across different communication patterns for k-ary n-cube networks. Our design is composed of two key components. First, we use global information about a network

Global Reduction in Wormhole k-ary n-cube Networks with Multidestination Exchange Worms

by Dhabaleswar K. Panda - IN INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM , 1994
"... This paper presents a new approach to implement global reduction operations (including barrier synchronization) in wormhole k-ary n-cubes. 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 k-ary n-cubes. The novelty lies in using multidestination message passing mechanism instead of single destination (unicast) messages. Using pairwise exchange worms along

n-Cube Network: Node Disjoint Shortest Paths for Maximal Distance Pairs of Vertices

by Teofilo Gonzalez, Teo Lo Gonzalez, David Serena - 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 n-cube in the presence of faulty nodes.

A Performance Model for k-Ary n-Cube Networks with Self-Similar Traffic

by Geyong Min, et al. , 2002
"... Recently a number of studies have indicated that network traffic exhibits noticeable self-similar behaviour, i.e., traffic is bursty over a wide range of time scales. This fractal-like 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 time-consuming 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 k-ary n-cubes with self-similar traffic. The validity of the model

Performance analysis of k-ary n-cube interconnection networks

by William J. Dally - IEEE Transactions on Computers , 1990
"... Abstmct-VLSI communication networks are wire-limited. 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 commu-nication 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 hot-spot throughput of k-ary n-cube networks with constant bisection are derived that agree closely with experi-mental measurements. It is shown that low-dimensional networks (e.g., tori) have lower latency and higher hot

Modelling free-space optical k-ary n-cube wormhole networks

by Mongkol Raksapatcharawong, Timothy Mark Pinkston - J Parallel Distr Comput , 1998
"... This paper presents an optical interconnect model for k-ary n-cube network topologies based on free-space 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 k-ary n-cube network topologies based on free-space 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

by Teofilo F. Gonzalez, David Serena
"... www.elsevier.com/locate/parco n-Cube network: node disjoint shortest paths for maximal distance pairs of vertices q ..."
Abstract - Add to MetaCart
www.elsevier.com/locate/parco n-Cube network: node disjoint shortest paths for maximal distance pairs of vertices q

A Partial Irregular-Network Routing on Faulty k-ary n-cubes

by Michihiro Koibuchi, Tsutomu Yoshinaga
"... 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 irregular-network routing in order to provide a high ..."
Abstract - Add to MetaCart
high fault-tolerance in k-ary n-cube networks. Since an irregular-network routing usually performs poorly in k-ary n-cube networks, it is only used for progressive deadlock-recovery, and avoiding hard failures. The network is logically divided into the fault and regular regions. In the regular region

k-ary m-way Networks: the Dual of k-ary n-cubes

by Muhammed F. Mudawwar
"... This article presents k-ary m-way networks, multidimensional mesh and tori networks that are viewed as the dual of k-ary n-cube networks. An m-way channel is the physical wiring of m router and processor links. An m-way router interfaces two channels only, irrespective of the network topology or dim ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
This article presents k-ary m-way networks, multidimensional mesh and tori networks that are viewed as the dual of k-ary n-cube networks. An m-way channel is the physical wiring of m router and processor links. An m-way router interfaces two channels only, irrespective of the network topology
Results 11 - 20 of 328