학술논문

A case for aggregate networks
Document Type
Conference
Source
Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing Parallel processing. Parallel and distributed processing Parallel Processing Symposium, 1998. IPPS/SPDP 1998. Proceedings of the First Merged International ... and Symposium on Parallel and Distributed Processing 1998. :162-166 1998
Subject
Computing and Processing
Communication, Networking and Broadcast Technologies
Computer aided software engineering
Aggregates
Logic
Microcomputers
Switches
Intelligent networks
Message passing
Read only memory
Routing
Microprocessors
Language
ISSN
1063-7133
Abstract
Parallel processing networks, even full crossbars, that only implement point to point and multicast message passing are inefficient for collective communications because multiple messages must be transmitted to/from each processor to implement a single collective operation. However, all of the information needed for a collective communication can be made available to the network control logic within a single communication. By making this control logic capable of executing functions on the information aggregated from all of the processors, any collective communication can be implemented without additional messages or processor involvement. Networks with such logic are called aggregate networks and are capable of performing routing, computation, and storage/retrieval of global information. The paper gives a detailed example of each of these types of aggregate functions.