Abstract
This paper describes how parallel dataflow programming can be simply and efficiently integrated with the Ada tasking model. Three extensions to standard Ada are proposed: parallel composition of statements, a parallel for-loop statement, and single-assignment types. Using these constructs, parallel Ada programs can be written without explicit tasking, that are identical—except for two new reserved words—to sequential Ada programs that satisfy the same specifications. These programs can be developed as sequential programs, then executed as deterministic parallel programs for high performance. The proposed extensions are defined by transformation into standard Ada tasking, and can efficiently be implemented by straightforward preprocessing, without any change to the underlying Ada compiler or run-time system.
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.
