Detailed algorithms for all-to-all broadcast and reduction are given for arrays mapped by binary or binary-reflected Gray code encoding to the processing nodes of binary cube networks. Algorithms are also given for the local computation of the array indices for the communicated data, thereby reducing the demand for communications bandwidth. For the Connection Machine system CM-200, Hamiltonian cycle based all-to-all communication algorithms yield a performance that is a factor of two to ten higher than the performance offered by algorithms based on trees, butterfly networks, or the Connection Machine router. The peak data rate achieved for all-to-all broadcast on a 2048 node Connection Machine system CM-200 is 5.4 Gbytes/sec when no recordi...
All-to-all broadcast refers to the process by which every node broadcasts its certain piece of infor...
A method to reduce broadcast time in wormholerouted hypercube systems is described. The method takes...
In this paper we present several algorithms for all-too-many personalized communications which avoid...
Detailed algorithms for all-to-all broadcast and reduction are given for arrays mapped by binary or ...
In irregular all-to-all communication, messages are exchanged between every pair of processors. The ...
International audienceThis paper presents two simple all-to-all broadcasting algorithms on honeycomb...
Hypercube algorithms are developed for a variety of communication-intensive tasks such as transposin...
All-to-all personalized communication is a class of permutations in which each processor sends a uni...
We develop an all-to-all broadcast scheme that achieves maximum bandwidth efficiency for clusters wi...
AbstractWe present optimal schedules for permutations in which each node sends one or several unique...
This thesis presents results of evaluating the communications capabilities of the generalized hyperc...
Hypercube algorithms may be developed for a variety of communication-intensive tasks such as sending...
We define all-to-all encode, a collective communication operation serving as a primitive in decentra...
Graduation date: 1989We will describe two known strategies for static processor\ud allocation in an ...
AbstractThe goal of this paper is to present practical experiments on broadcasting algorithms on a c...
All-to-all broadcast refers to the process by which every node broadcasts its certain piece of infor...
A method to reduce broadcast time in wormholerouted hypercube systems is described. The method takes...
In this paper we present several algorithms for all-too-many personalized communications which avoid...
Detailed algorithms for all-to-all broadcast and reduction are given for arrays mapped by binary or ...
In irregular all-to-all communication, messages are exchanged between every pair of processors. The ...
International audienceThis paper presents two simple all-to-all broadcasting algorithms on honeycomb...
Hypercube algorithms are developed for a variety of communication-intensive tasks such as transposin...
All-to-all personalized communication is a class of permutations in which each processor sends a uni...
We develop an all-to-all broadcast scheme that achieves maximum bandwidth efficiency for clusters wi...
AbstractWe present optimal schedules for permutations in which each node sends one or several unique...
This thesis presents results of evaluating the communications capabilities of the generalized hyperc...
Hypercube algorithms may be developed for a variety of communication-intensive tasks such as sending...
We define all-to-all encode, a collective communication operation serving as a primitive in decentra...
Graduation date: 1989We will describe two known strategies for static processor\ud allocation in an ...
AbstractThe goal of this paper is to present practical experiments on broadcasting algorithms on a c...
All-to-all broadcast refers to the process by which every node broadcasts its certain piece of infor...
A method to reduce broadcast time in wormholerouted hypercube systems is described. The method takes...
In this paper we present several algorithms for all-too-many personalized communications which avoid...