Show simple item record

dc.contributor.authorElster, Anne C.en_US
dc.contributor.authorLi, Hungwenen_US
dc.date.accessioned2007-04-23T17:36:11Z
dc.date.available2007-04-23T17:36:11Z
dc.date.issued1989-05en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-1003en_US
dc.identifier.urihttps://hdl.handle.net/1813/6803
dc.description.abstractThe Polymorphic Torus architecture is a reconfigurable, massively parallel finegrained system, which in its two-dimensional $(N^{2})$ case has a lower wiring complexity than, say, hypercubes. However, due to the dynamic connection features at run-time, it allows several parallel structures such as trees, rings, and hypercubes to be emulated efficiently. In this paper, we consider algorithms that are especially well-suited for hypercubes, i.e. algorithms that take advantage of the relatively high connectivity of the hypercube topology, and show how these algorithms attain comparable bounds on a 2-D Polymorphic Torus. In particular, algorithms for dense matrix vector multiplication (including using 2 orthogonal trees for the matrix-vector case), sparse matrix-vector multiplication, and the FFT are discussed.en_US
dc.format.extent1812035 bytes
dc.format.extent440931 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleHypercube Algorithms on the Polymorphic Torusen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics