PARLOG: parallel programming in logic
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
ANNA: a language for annotating Ada programs
ANNA: a language for annotating Ada programs
Formal Verification of Ada Programs
IEEE Transactions on Software Engineering
An introduction to parallel programming
An introduction to parallel programming
Retire Fortran?: a debate rekindled
Communications of the ACM
A conceptual framework for a nonprocedural programming language
Communications of the ACM
Integrating Functional and Imperative Parallel Programming: CC++ Solutions to the Salishan Problems
Proceedings of the 8th International Symposium on Parallel Processing
A Primer for Program Composition Notation
A Primer for Program Composition Notation
Parallel Programming with Declarative Ada
Parallel Programming with Declarative Ada
CC++: A Declarative Concurrent Object Oriented Programming Notation
CC++: A Declarative Concurrent Object Oriented Programming Notation
VAL- ORIENTED ALGORITHMIC LANGUAGE, PRELIMINARY REFERENCE MANUAL
VAL- ORIENTED ALGORITHMIC LANGUAGE, PRELIMINARY REFERENCE MANUAL
ACM SIGPLAN Notices
Declarative Ada: parallel dataflow programming in a familiar context
CSC '95 Proceedings of the 1995 ACM 23rd annual conference on Computer science
Performance of a high-level parallel programming layer defined on top of the Ada tasking model
Proceedings of the conference on TRI-Ada '95: Ada's role in global markets: solutions for a changing complex world
A parallel programming model for ada
SIGAda '11 Proceedings of the 2011 ACM annual international conference on Special interest group on the ada programming language
Hi-index | 0.00 |
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.