Abstract
Abstract Trees are a useful class of computational structures. In parallel processing, mapping problems arise when the tree structure differs from the processor interconnection of the parallel computer. The MasPar's MP-2 is a massively parallel computer where processors are interconnected via the X-Net neighborhood two-dimensional mesh and the global multistage crossbar router network. We present novel mapping schemes for trees on the MasPar's MP-2 two-dimensional mesh and on the two-dimensional mesh together with the MasPar's MP-2 multistage crossbar network. Appropriate algorithms of the mapping scheme on the two-dimensional mesh (or grid) are presented and are shown to be superior over known mappings on square arrays (or grids).
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.
