Abstract

Abstract : This paper addresses the issue of how to make the task of writing correct and efficient parallel programs easier. Domain morphism is a new construct for specifying parallel-program optimization at a high level, and enables an equational program transformation whereby the optimized program containing implementation details is derived mechanically. In addition, we introduce the constructs index domain, data field, communication form, and hypersurfaces for facilitating parallel programming and generating efficient target parallel programs with explicit synchronization and communication. We describe an equational theory and new program transformation procedures motivated by these new constructs. A programming example illustrating the use of these constructs and the program transformation steps is given.

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 call

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.