Results 1  10
of
113
Efficient Algorithms for AlltoAll Communications in MultiPort MessagePassing Systems
 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
, 1997
"... We present efficient algorithms for two alltoall communication operations in messagepassing systems: index (or alltoall personalized communication) and concatenation (or alltoall broadcast). We assume a model of a fully connected messagepassing system, in which the performance of any pointto ..."
Abstract

Cited by 103 (0 self)
 Add to MetaCart
We present efficient algorithms for two alltoall communication operations in messagepassing systems: index (or alltoall personalized communication) and concatenation (or alltoall broadcast). We assume a model of a fully connected messagepassing system, in which the performance of any pointtopoint communication is independent of the senderreceiver pair. We also assume that each processor has k ≥ 1 ports, through which it can send and receive k messages in every communication round. The complexity measures we use are independent of the particular system topology and are based on the communication startup time, and on the communication bandwidth. In the index operation among n processors, initially, each processor has n blocks of data, and the goal is to exchange the i th block of processor j with the j th block of processor i. We present a class of index algorithms that is designed for all values of n and that features a tradeoff between the communication startup time and the data transfer time. This class of algorithms includes two special cases: an algorithm that is optimal with respect to the measure of the startup time, and an algorithm that is optimal with respect to the measure of the data transfer time. We also present experimental results featuring the performance tuneability of our index algorithms on the IBM SP1 parallel system. In the concatenation operation, among n processors, initially, each processor has one block of data, and the goal is to concatenate the n blocks of data from the n processors, and to make the concatenation result known to all the processors. We present a concatenation algorithm that is optimal, for most values of n, in the number of communication rounds and in the amount of data transferred.
Dissemination Of Information In Interconnection Networks (Broadcasting & Gossiping)
, 1996
"... this article follows the aims stated above. The first section introduces this research area. The basic definitions are given and the fundamental, simple observations concerning the relations among the complexity measures defined are carefully explained. This section is ..."
Abstract

Cited by 100 (7 self)
 Add to MetaCart
this article follows the aims stated above. The first section introduces this research area. The basic definitions are given and the fundamental, simple observations concerning the relations among the complexity measures defined are carefully explained. This section is
Packet Routing In FixedConnection Networks: A Survey
, 1998
"... We survey routing problems on fixedconnection networks. We consider many aspects of the routing problem and provide known theoretical results for various communication models. We focus on (partial) permutation, krelation routing, routing to random destinations, dynamic routing, isotonic routing ..."
Abstract

Cited by 35 (3 self)
 Add to MetaCart
We survey routing problems on fixedconnection networks. We consider many aspects of the routing problem and provide known theoretical results for various communication models. We focus on (partial) permutation, krelation routing, routing to random destinations, dynamic routing, isotonic routing, fault tolerant routing, and related sorting results. We also provide a list of unsolved problems and numerous references.
Interval Routing Schemes
, 1998
"... Interval routing was introduced to reduce the size of routing tables: a router finds the direction where to forward a message by determining which interval contains the destination address of the message, each interval being associated to one particular direction. This way of implementing a routin ..."
Abstract

Cited by 33 (5 self)
 Add to MetaCart
Interval routing was introduced to reduce the size of routing tables: a router finds the direction where to forward a message by determining which interval contains the destination address of the message, each interval being associated to one particular direction. This way of implementing a routing function is quite attractive but very little is known about the topological properties that must satisfy a network to support an interval routing function with particular constraints (shortest paths, limited number of intervals associated to each direction, etc.). In this paper we investigate the study of the interval routing functions. In particular, we characterize the set of networks which support a linear or a linear strict interval routing function with only one interval per direction. We also derive practical tools to measure the efficiency of an interval routing function (number of intervals, length of the paths, etc.), and we describe large classes of networks which support optimal (linear) interval routing functions. Finally, we derive the main properties satisfied by the popular networks used to interconnect processors in a distributed memory parallel computer.
An approximation algorithm for the wireless gathering problem
 608, 2008. [Online]. Available: http://www.sciencedirect.com/science/article/B6V8M4SPJ1PW1/2/ab4b7362e69a1d9335454aa926c39784
"... Abstract. The Wireless Gathering Problem is to find a schedule for data gathering in a wireless static network. The problem is to gather a set of messages from the nodes in the network at which they originate to a central node, representing a powerful base station. The objective is to minimize the ..."
Abstract

Cited by 28 (3 self)
 Add to MetaCart
(Show Context)
Abstract. The Wireless Gathering Problem is to find a schedule for data gathering in a wireless static network. The problem is to gather a set of messages from the nodes in the network at which they originate to a central node, representing a powerful base station. The objective is to minimize the time to gather all messages. The sending pattern or schedule should avoid interference of radio signals, which distinguishes the problem from wired networks. We study the Wireless Gathering Problem from a combinatorial optimization point of view in a centralized setting. This problem is known to be NPhard when messages have no release time. We consider the more general case in which messages may be released over time. For this problem we present a polynomialtime online algorithm which gives a 4approximation. We also show that within the class of shortest path following algorithms no algorithm can have approximation ratio better than 4. We also formulate some challenging open problems concerning complexity and approximability for variations of the problem.
Memory Requirement for Universal Routing Schemes
 IN 14 TH ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC
, 1995
"... In this paper, we deal with the compact routing problem, that is implementing routing schemes that use a minimum memory size on each router. In [20], Peleg and Upfal showed that there is no hope to do that with less than a total \Omega\Gamma n 1+1=(2s+4) ) memory bits for any stretch factor s 1. ..."
Abstract

Cited by 28 (8 self)
 Add to MetaCart
(Show Context)
In this paper, we deal with the compact routing problem, that is implementing routing schemes that use a minimum memory size on each router. In [20], Peleg and Upfal showed that there is no hope to do that with less than a total \Omega\Gamma n 1+1=(2s+4) ) memory bits for any stretch factor s 1. We improve this bound for stretch factors s ! 2 by proving that any nearshortest path routing scheme uses a total of \Omega\Gamma n 2 ) memory bits.
On the Design and Implementation of Broadcast and Global Combine Operations Using the Postal Model
 IEEE Transactions on Parallel and Distributed Systems
, 1996
"... AbstractThere are a number of models that were proposed in recent years for message passing parallel systems. Examples are the postal model and its generalization the LogP model. In the postal model a parameter h is used to model the communication latency of the messagepassing system. Each node du ..."
Abstract

Cited by 22 (1 self)
 Add to MetaCart
AbstractThere are a number of models that were proposed in recent years for message passing parallel systems. Examples are the postal model and its generalization the LogP model. In the postal model a parameter h is used to model the communication latency of the messagepassing system. Each node during each round can send a fixedsize message and, simultaneously, receive a message of the same size. Furthermore, a message sent out during round r will incur a latency of hand will arrive at the receiving node at round r + h 1. Our goal in this paper is to bridge the gap between the theoretical modeling and the practical implementation. In particular, we investigate a number of practical issues related to the design and implementation of two collective communication operations, namely, the broadcast operation and the global combine operation. Those practical issues include, for example, 1) techniques for measurement of the value of h on a given machine, 2) creating efficient broadcast algorithms that get the latency hand the number of nodes n as parameters and 3) creating efficient global combine algorithms for parallel machines with h which is not an integer. We propose solutions that address those practical issues and present results of an experimental study of the new algorithms on the Intel Delta machine. Our main conclusion is that the postal model can help in performance prediction and tuning, for example, a properly tuned broadcast improves the known implementation by more than 20%. Index TermsBroadcast, global combine, postal model, complete graph, collective communication 1
Adaptive Broadcasting With Faulty Nodes
, 1996
"... We consider broadcasting from a faultfree source to all nodes of a completely connected nnode network in the presence of k faulty nodes. Every node can communicate with at most one other node in a unit of time and during this period every pair of communicating nodes can exchange information packe ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
We consider broadcasting from a faultfree source to all nodes of a completely connected nnode network in the presence of k faulty nodes. Every node can communicate with at most one other node in a unit of time and during this period every pair of communicating nodes can exchange information packets. Faulty nodes can receive information but cannot send it. Broadcasting is adaptive, i.e. a node schedules its next communication on the basis of information currently available to it. We study worst case running time of faulttolerant broadcasting algorithms in two models: in the wakeup model only nodes already having the source message can call other nodes and in the unrestricted model all faultfree nodes can call. In the first model we give an optimal algorithm working in time k +dlog(n \Gamma k)e. In the second model we give an algorithm working in time O(log 2 n), whenever the fraction of faulty nodes is bounded by a constant smaller than 1. Key words: adaptive, algorithm, broadc...
TimeEfficient Broadcast in Radio Networks
, 2010
"... Broadcasting is a basic network communication task, where a message initially held by a source node has to be disseminated to all other nodes in the network. Fast algorithms for broadcasting in radio networks have been studied in a wide variety of different models and under different requirements. S ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
(Show Context)
Broadcasting is a basic network communication task, where a message initially held by a source node has to be disseminated to all other nodes in the network. Fast algorithms for broadcasting in radio networks have been studied in a wide variety of different models and under different requirements. Some of the main parameters giving rise to the different variants of the problem are the accessibility of knowledge about the network topology, the availability of collision detection mechanisms, the wakeup mode, the topology classes considered, and the use of randomness. This chapter introduces the problem, reviews the literature on timeefficient broadcasting algorithms for radio networks under a variety of models and assumptions, and illustrates some of the basic techniques.
Optimal information dissemination in Star and Pancake networks
, 1996
"... This paper presents a new decomposition technique for hierarchical Cayley graphs. This technique yields a very easy implementation of the divide and conquer paradigm for some problems on very complex architectures as the star graph or the pancake. As applications, we introduce algorithms for broadca ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
This paper presents a new decomposition technique for hierarchical Cayley graphs. This technique yields a very easy implementation of the divide and conquer paradigm for some problems on very complex architectures as the star graph or the pancake. As applications, we introduce algorithms for broadcasting and prefixlike operations that improve the best known bounds for these problems. We also give the first nontrivial optimal gossiping algorithms for these networks. In stargraphs and pancakes with N = n! processors, our algorithms take less than dlog Ne+ 1:5n steps. 1 Introduction The success of a parallel computer topology depends heavily on two points: ffl the existence of efficient communication schemes, ffl the existence of programming paradigms that facilitate the design of algorithms. This fact can be witnessed by the large number of machines based on the hypercube interconnection network, for which optimal information dissemination algorithms exist, and divide and conquer ...