Abstract
This paper presents some mapping heuristics for creation of partitionable SIMD/MIMD machines having fragment-free (perfect) memory maps. Necessary and sufficient conditions are formulated for this. If these conditions are not obtainable, then the memory mapping problem reverts into a modification of 2-D bin packing problem. Techniques are analyzed to effect configurability of massively parallel architectures for optimizing certain measures such as performance and memory exploitation.
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 callMore From: Massively Parallel Processing Applications and Development
Disclaimer: 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.
