ACM Home Page
Please provide us with feedback. Feedback
Automatic parallelization of APL-style programs
Full text PdfPdf (553 KB)
Source International Conference on APL archive
Conference proceedings on APL 90: for the future table of contents
Copenhagen, Denmark
Pages: 76 - 80  
Year of Publication: 1990
ISBN:0-89791-371-X
Also published in ...
Author
Wai-Mee Ching  Thomas J. Watson Research Center, P.O. Box 704, Yorkrown Heighls, NY
Sponsors
SIGAPL: ACM Special Interest Group on APL Programming Language
Danish Data Assn. :
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 6,   Citation Count: 5
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/97808.97826
What is a DOI?

ABSTRACT

APL-style programs use high level primitives on arrays instead of DO-loops whenever possible. For such programs, the average size of a basic blocks is much large than those in their FORTRAN counterparts. Hence, it is sufficiently profitable and relative easy to concentrate on basic blocks when parallelizing APL-style programs. But such an approach must depend on an APL compiler. The APL/370 compiler we have been developing aims at implementing automatic parallelization of APL programs at basic block level. The compiler exploits functional parallelism on data independent sub-expressions and data parallelism of array primitives on array elements. The compiler front end does a local data dependency analysis and emits synchronization flags at function nodes. The back end does partitioning of (assembly code) array loop. A set of low-level synchronization primitives on MVS has also been developed. This will enable us to run compiled applications in parallel mode on IBM 3090 multi-processors to access the effectiveness of various scheduling methods on a shared memory model.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
T. Agerwala and Arvind, ed., Data Flow Systems, IEEE Computer, Feb., 1982.
2
 
3
 
4
M. Burke et al., Automatic Generation of Nested, Fork-Join Parallelism, Jour. of Supercomputing vol.3,71-88. 1989.
 
5
 
6
 
7
W.-M. Ching and A. Xu, A Vector Code Back End of the APL370 Compiler on IBM 3090 and some Performance Comparisons, Proc. of APL'88 Conf., 69-76, 1988.
8
 
9
R. Cytron and J. Ferrante, What's in a name? On the value of renaming for parallelism detection and storage allocation, Proc. of 1987 Intern'1 Conf. on on Parallel Processing, 19-27, 1987.
10
11
 
12
 
13
C. Polychronopoulos et al., Parafrase-2: An Evironmen1 for Parallelizing, Partitioning, Synchronizing Programs on Multiprocessors, Proc. of 1989 Intern'1 Conf. on Parallel Processing, 11-39-48, 1989.



Peer to Peer - Readers of this Article have also read: