Abstract
We address the task of systematically designing efficient programs for parallel machines. Our approach starts with a sequential algorithm and proceeds by expressing it in terms of standard, pre-implemented parallel components called skeletons. We demonstrate the skeleton-based design process using a tridiagonal system solver as our example application. We develop a cost-optimal parallel version of our application and implement it in message passing interface (MPI). The performance of our solution is demonstrated experimentally on a Cray T3E machine.
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.
