• Publications
  • Influence
Efficient Algorithms for All-to-All Communications in Multiport Message-Passing Systems
We present efficient algorithms for two all-to-all communication operations in message-passing systems: index (or all-to-all personalized communication) and concatenation (or all-to-all broadcast).Expand
  • 257
  • 22
Designing broadcasting algorithms in the postal model for message-passing systems
In many distributed-memory parallel computers and high-speed communication networks, the exact structure of the underlying communication network may be ignored. These systems assume that the networkExpand
  • 173
  • 9
Designing broadcasting algorithms in the postal model for message-passing systems
In many distributed-memory parallel computers and high-speed communication networks, the exact structure of the underlying communication network may be ignored. These systems assume that the networkExpand
  • 60
  • 8
Efficient algorithms for all-to-all communications in multi-port message-passing systems
We present efficient algorithms for two all-to-all communication operations in message-passing systems: <italic>index</italic> (or all-to-all personalized communication) andExpand
  • 81
  • 5
Process Groups: a mechanism for the coordination of and communication among processes in the Venus collective communication library
  • V. Bala, S. Kipnis
  • Computer Science
  • [] Proceedings Seventh International Parallel…
  • 13 April 1993
In programming massively parallel computers, it is often necessary to have sets of processes cooperate in performing certain computations and communications. Most run-time libraries require that suchExpand
  • 23
  • 5
Designing Efficient, Scalable, and Portable Collective Communication Libraries
We describe methods for designing efficient, scalable, and portable collective communication primitives for multiprocessor systems. To achieve efficiency, we introduce the technique of split-phaseExpand
  • 22
  • 5
CCL: A Portable and Tunable Collective Communication Library for Scalable Parallel Computers
A collective communication library for parallel computers includes frequently used operations such as broadcast, reduce, scatter, gather, concatenate, synchronize, and shift. Such a library providesExpand
  • 75
  • 3
The organization of permutation architectures with bussed interconnections
This paper explores the problem of efficiently permuting data stored in VLSI chips in accordance with a predetermined set of permutations. By connecting chips with shared bus interconnections, asExpand
  • 21
  • 2
Optimal multiple message broadcasting in telephone-like communication systems
We consider the problem of broadcasting multiple messages from one processor to many processors in telephone-like communication systems. In such systems, processors communicate in rounds, where inExpand
  • 22
  • 2
Optimal multiple message broadcasting in telephone-like communication systems
We consider the problem of broadcasting multiple messages from one processor to many processors in telephone-like communication systems. In such systems, processors communicate in rounds, where inExpand
  • 22
  • 2