Parallel graph reduction on a supercomputer: A status report
We describe an ongoing effort to develop a parallel graph reduction run-time system hosted on a multiprocessor supercomputer. This run-time system is presently augmented by the functional language compiler of the ALFALFA system. Admittedly, parallel graph reduction is hardly a novel idea. The interesting notion is the provision of a parallel execution environment sufficiently powerful to support development of large prototypical scientific and symbolic codes in a functional language. This will allow the investigation of the functional programming paradigm within these application domains in an empirical fashion. In this paper, we discuss the motivation for the effort, describe the basic elements of the implementation, and provide some preliminary insight distilled from our experience with an initial version of the run-time system.
KeywordsShared Memory Functional Language Error Handling Graph Reduction Shared Memory Multiprocessor
Unable to display preview. Download preview PDF.
- (1).Bobrowicz, F., "The Los Alamos Multitasking Control Library," Los Alamos National Laboratory unclassified release (in preparation).Google Scholar
- (2).Cray Research, Inc., CRAY X-MP Series Mainframe Reference Manual, HR-0032 (1982), Cray Research, Inc.Google Scholar
- (3).Hudak, P., "ALFL Reference Manual and Programmer's Guide," Research report YALEU/DCS/RR-322, 2nd ed., Computer Science Department, Yale University, October 1984.Google Scholar
- (4).Hudak, P., and Goldberg, B., "Distributed execution of functional programs using serial combinators," Proc. 1985 International Conference on Parallel Processing, August 1985, pp. 831–839.Google Scholar