𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The dance party problem and its application to collective communication in computer networks

✍ Scribed by Xin Wang; Edward K. Blum; D.Stott Parker; Daniel Massey

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
996 KB
Volume
23
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

✦ Synopsis

Motivated by implementing collective communication operations on workstation clusters, a problem of scheduling a dance party is formulated. The problem is solved by two algorithms based on searching and divide-and-conquer that generate suboptimal schedules and an algorithm based on graph factorization that generates optimal schedules. It is shown how to use dance schedules to implement collective communication operations such as all -gather. Experiment data on a single ethernet segment of SUN SPARC-10 workstations and on a switch connected network, the IBM SP2, show that the all -gather implementation that simply uses the optimal schedule performs better for long messages than the implementations of system MPL from IBM and public-domain systems LAM and MPICH/pA

πŸ“œ SIMILAR VOLUMES

The Kohonen network incorporating explic
The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem
✍ N. Aras; B.J. Oommen; Δ°.K. AltΔ±nel πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 193 KB

In this paper we introduce a new self-organizing neural network, the Kohonen Network Incorporating Explicit Statistics (KNIES) that is based on Kohonen's Self-Organizing Map (SOM). The primary difference between the SOM and the KNIES is the fact that every iteration in the training phase includes tw

Computable analysis of the abstract Cauc
Computable analysis of the abstract Cauchy problem in a Banach space and its applications I
✍ Klaus Weihrauch; Ning Zhong πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 222 KB πŸ‘ 1 views

## Abstract We study computability of the abstract linear Cauchy problem equation image where __A__ is a linear operator, possibly unbounded, on a Banach space __X__. We give necessary and sufficient conditions for __A__ such that the solution operator __K__: __x__ ↦ __u__ of the problem (1) is c

Realization Theory of Ladder Networks in
Realization Theory of Ladder Networks in Terms of the Poles and Zeros of Reflection Coefficient and its Application to a Bandpass Matching Problem
✍ R. Srinivasagopalan; B.A. Shenoi πŸ“‚ Article πŸ“… 1972 πŸ› Elsevier Science 🌐 English βš– 774 KB

Neceaaary and su&%ient condition8 for the realization of 1088k38, tOWpaSS, ladder network8 terminated by a resietance are presented, in term.8 of the poles and zero8 of the resection coeficient. These condition8 yield explicit expre88ion.s for the element VdUe8. They are then extended to highpa netw