Bitwise Aggregate Networks

Authors:
R. Hoare;H. Dietz;T. Mattox;S. Kim
Affiliations:
-;-;-;-
Venue:
SPDP '96 Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP '96)
Year:
1996

Citing 0
Cited 5

ClusterNet: An Object-Oriented Cluster Network

IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
A Case for Aggregate Networks

IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
The absolute center of a network: Dedicated to the memory of Jonathan Halpern 1940–1981

Networks
Implications of application usage characteristics for collective communication offload

International Journal of High Performance Computing and Networking
Hardware support for OpenMP collective operations

LCPC'09 Proceedings of the 22nd international conference on Languages and Compilers for Parallel Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Typical communication networks for parallel processing are based on sending data from one processor to one, or all, of the other processors. Using such a network, many simple operations that require information from every processor requires many point-to-point or broadcast communications. These aggregate operations can be as simple as a barrier synchronization or as complex as an arithmetic reduction. In this paper, we discuss a class of networks that directly implement a wide range of aggregate operations. These networks are capable of performing aggregate operations in a single communication operation using only simple bitwise combining logic in a trivially scalable tree configuration.