Abstract
Several algorithms that illustrate fundamental data parallel operations and the implementation of virtual topologies in terms of hypercube operations are given. A geometric induction principle is developed and used for proving the correctness of these algorithms. The algorithms show how an elementary SIMD language can be used to formally specify and verify data parallel algorithms.
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.
