Intensive hypercube communication Prearranged communication in link-bound machines,
dc.contributor.author | Stout, Quentin F. | en_US |
dc.contributor.author | Wagar, Bruce | en_US |
dc.date.accessioned | 2006-04-10T13:54:22Z | |
dc.date.available | 2006-04-10T13:54:22Z | |
dc.date.issued | 1990-10 | en_US |
dc.identifier.citation | Stout, Quentin F., Wagar, Bruce (1990/10)."Intensive hypercube communication Prearranged communication in link-bound machines,." Journal of Parallel and Distributed Computing 10(2): 167-181. <http://hdl.handle.net/2027.42/28830> | en_US |
dc.identifier.uri | http://www.sciencedirect.com/science/article/B6WKJ-4BRJJ67-50/2/aad13b47c3b8164ea7070ffa0ce4dcd6 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/28830 | |
dc.description.abstract | Hypercube algorithms are developed for a variety of communication-intensive tasks such as transposing a matrix, histogramming, sending a (long) message from one node to another, broadcasting a message from one node to all others, broadcasting a message from each node to all others, and exchanging messages between nodes via a fixed permutation. The algorithm for exchanging via a fixed permutation can be viewed as a deterministic analog of Valiant's randomized routing. The algorithms are for link-bound hypercubes in which local processing time is ignored, communication time predominates, message headers are not needed because all nodes know the task being performed, and all nodes can use all communication links simultaneously. Through systematic use of techniques such as pipelining, hatching, variable packet sizing, symmetrizing, and completing, for all these problems algorithms which achieve a time with an optimal highest-order term are obtained. | en_US |
dc.format.extent | 1520234 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Elsevier | en_US |
dc.title | Intensive hypercube communication Prearranged communication in link-bound machines, | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Philosophy | en_US |
dc.subject.hlbsecondlevel | Computer Science | en_US |
dc.subject.hlbtoplevel | Humanities | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, Michigan 48109-2122, USA | en_US |
dc.contributor.affiliationum | Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, Michigan 48109-2122, USA | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/28830/1/0000664.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/0743-7315(90)90026-L | en_US |
dc.identifier.source | Journal of Parallel and Distributed Computing | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.