A combining mechanism for parallel computers

DSpace/Manakin Repository

A combining mechanism for parallel computers

Citable link to this page


Title: A combining mechanism for parallel computers
Author: Valiant, Leslie G.
Citation: Valiant, Leslie G. 1992. A combining mechanism for parallel computers. Harvard Computer Science Group Technical Report TR-24-92.
Full Text & Related Files:
Abstract: In a multiprocessor computer communication among the components may be based either on a simple router, which delivers messages point-to-point like a mail service, or on a more elaborate combining network that, in return for a greater investment in hardware, can combine messages to the same address prior to delivery. This paper describes a mechanism for recirculating messages in a simple router so that the added functionality of a combining network, for arbitrary access patterns, can be achieved by it with provable efficiency. The method brings together the messages with the same destination address in more than one stage, and at a set of components that is determined by a hash function and decreases in number at each stage.
Terms of Use: This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAA
Citable link to this page: http://nrs.harvard.edu/urn-3:HUL.InstRepos:26506437
Downloads of this work:

Show full Dublin Core record

This item appears in the following Collection(s)


Search DASH

Advanced Search