Augmenting Ada for SIMD parallel processing
Journal Article
·
· IEEE Trans. Software Eng.; (United States)
A minimal set of features which make Ada suitable for use with single instruction stream-multiple data stream type architectures is presented. The general machine model used is briefly explained, and the specification of interprocessor communications is discussed. The declaration of variables is described, and operators which act collectively on the set of all processing elements are explained. Statements which allow access to subsets of processing elements in unconditional and data conditional form are presented. An example using the proposed constructs is given. 36 references.
- Research Organization:
- Purdue University, West Lafayette, IN
- OSTI ID:
- 5724649
- Journal Information:
- IEEE Trans. Software Eng.; (United States), Journal Name: IEEE Trans. Software Eng.; (United States) Vol. SE-11; ISSN IESED
- Country of Publication:
- United States
- Language:
- English
Similar Records
Extensions of ADA for SIMD parallel processing
FFT algorithms for SIMD parallel processing systems
Parallel programming with Ada
Conference
·
Fri Dec 31 23:00:00 EST 1982
·
OSTI ID:5209927
FFT algorithms for SIMD parallel processing systems
Journal Article
·
Fri Feb 28 23:00:00 EST 1986
· J. Parallel Distrib. Comput.; (United States)
·
OSTI ID:6505932
Parallel programming with Ada
Journal Article
·
Thu Dec 31 23:00:00 EST 1987
· Int. J. Supercomput. Appl.; (United States)
·
OSTI ID:6214590