Analyzing stores and references in a parallel symbolic language

1 January 1994

proceedings article
Published by Association for Computing Machinery (ACM)

Vol. VII (3) , 294-305
https://doi.org/10.1145/182409.182493

Abstract

We describe an analysis of a parallel language in which processes communicate via first-class mutable shared locations. The sequential core of the language defines a higher-order strict functional language with list data structures. The parallel extensions permit processes and shared locations to be dynamically created; synchronization among processes occurs exclusively via shared locations.The analysis is defined by an abstract interpretation on this language. The interpretation is efficient and useful, facilitating a number of important optimizations related to synchronization, processor/thread mapping, and storage management.

Keywords

SEQUENTIAL CORE
SHARED LOCATION
ANALYZING STORE
ABSTRACT INTERPRETATION
PARALLEL LANGUAGE
PARALLEL SYMBOLIC LANGUAGE
FIRST-CLASS MUTABLE
STORAGE MANAGEMENT
PARALLEL EXTENSION
HIGHER-ORDER STRICT FUNCTIONAL LANGUAGE
LIST DATA STRUCTURE
IMPORTANT OPTIMIZATIONS
HIGHER ORDER
DATA STRUCTURE
FUNCTIONAL LANGUAGE

This publication has 0 references indexed in Scilit: