Title :
A case for aggregate networks
Author :
Hoare, Raymond R. ; Dietz, Henry G.
Author_Institution :
Sch. of Electr. & Comput. Eng., Purdue Univ., West Lafayette, IN, USA
fDate :
30 Mar-3 Apr 1998
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
Keywords :
message passing; parallel architectures; parallel machines; processor scheduling; aggregate functions; aggregate networks; collective communication; collective communications; full crossbars; global information storage/retrieval; multicast message passing; multiple messages; network control logic; parallel processing networks; processor involvement; routing; single collective operation; Aggregates; Computer aided software engineering; Intelligent networks; Logic; Message passing; Microcomputers; Microprocessors; Read only memory; Routing; Switches;
Conference_Titel :
Parallel Processing Symposium, 1998. IPPS/SPDP 1998. Proceedings of the First Merged International ... and Symposium on Parallel and Distributed Processing 1998
Conference_Location :
Orlando, FL
Print_ISBN :
0-8186-8404-6
DOI :
10.1109/IPPS.1998.669905