Abstract
Previous approaches to solving divide-and-conquer algorithms required a number of direct neighbor communications equal to the diameter of the computer. For a k dimensional mesh, this diameter is k /sup k/ square root n-k where n is the number of processors. The paper introduces the notion of a DC Transpose, which is a remapping of data on a mesh, using a global routing mechanism such as the global router on the Mas-Par MP-1. With a single DC Transpose, the number of direct neighbor communications is reduced to 2k /sup 2k/ square root n-2k. DC Transpose and its associated mappings are described, and benchmarks on the MasPar MP-1 are presented. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
