Abstract
The authors study the design and implementation issues for nonnumeric parallel algorithms on multiple instruction/multiple data (MIMD) and single instruction, multiple data (SIMD) machines. Prototypical examples considered are time-space optimal merging and sorting routines. The representative MIMD and SIMD machines are the Sequence Symmetry SSI and the Connection Machine CM-2. The conversion of shared-memory parallel codes to the data parallel paradigm is described. The experiences are highlighted with examples obtained during the process of MIMD to SIMD program transformation. Unexpected events can occur when algorithms designed with one architectural style in mind are modified for execution on another. Timings and other measurements are useful in identifying important bottlenecks. Some relative strengths and weaknesses of the two competing models that have become evident during this transformation process are discussed. >
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.
