Using Abstraction in Explicity Parallel Programs.
Abstract
It is well-known that writing parallel programs that are both fast and correct is significantly harder than writing sequential ones. In this thesis we introduce a transition-based approach to the design and implementation of parallel programs. This approach is aimed at applications whose complex data and control structures make them hard to parallelize by conventional means. It is based on a programming model with explicit parallelism, and it incorporates data and process parallelism within a uniform framework. The transition-based approach addresses the problem of program synthesis by breaking the development process into four distinct phases, each with explicit correctness and performance requirements. Module interfaces are well-defined so that rigorous correctness arguments can be made when desired. Application-specific scheduling is used to enhance performance, and significant performance tuning of the scheduler can be done in the last phase of development.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jul 01, 1991
- Accession Number
- ADA239142
Entities
People
- Katherine A. Yelick
Organizations
- Massachusetts Institute of Technology