On the implementation of applicative languages on shared-memory, MIMD multiproce

Authors:
Ching-Cheng Lee;Stephen Skedzielewski;John Feo
Affiliations:
The Computer Research Group, Lawrence Livermore National Laboratory;The Computer Research Group, Lawrence Livermore National Laboratory;The Computer Research Group, Lawrence Livermore National Laboratory
Venue:
PPEALS '88 Proceedings of the ACM/SIGPLAN conference on Parallel programming: experience with applications, languages and systems
Year:
1988

Citing 4
Cited 1

DI: an interactive debugging interpreter for applicative languages

SIGPLAN '87 Papers of the Symposium on Interpreters and interpretive techniques
Future scientific programming on parallel machines

Proceedings of the 1st International Conference on Supercomputing
Applicative Parallelism on a Shared-Memory Multiprocessor

IEEE Software
Graph transformation algorithms for array memory optimization in applicative languages

Graph transformation algorithms for array memory optimization in applicative languages

How to write parallel programs: a guide to the perplexed

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents the performance of a set of algorithms written in SISAL [MSA*85] and run on multiprocessor Sequent, DEC, and Cray computers. We describe our current runtime system and discuss its implementation on each machine. We indicate where our automatic approach to parallelization works well, as well as sources of inefficient behavior. Overall we find our systems encouraging for the first release of the native-code generating software. We suggest improvements to the compiler and runtime systems, many already developed but not yet implemented, to alleviate the inefficiencies.