HEP SISAL: parallel functional programming
on Parallel MIMD computation: HEP supercomputer and its applications
Data flow graph optimization in ifi
Proc. of a conference on Functional programming languages and computer architecture
Why functional programming matters
The Computer Journal - Special issue on Lazy functional programming
Conception, evolution, and application of functional programming languages
ACM Computing Surveys (CSUR)
POSC—a partitioning and optimizing SISAL compiler
ICS '90 Proceedings of the 4th international conference on Supercomputing
The aggregate update problem in functional programming systems
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A semantic model of reference counting and its abstraction (detailed summary)
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Garbage Collection of Linked Data Structures
ACM Computing Surveys (CSUR)
The VAL Language: Description and Analysis
ACM Transactions on Programming Languages and Systems (TOPLAS)
Shifting garbage collection overhead to compile time
Communications of the ACM
The semantic elegance of applicative languages
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
VAL- ORIENTED ALGORITHMIC LANGUAGE, PRELIMINARY REFERENCE MANUAL
VAL- ORIENTED ALGORITHMIC LANGUAGE, PRELIMINARY REFERENCE MANUAL
Graph transformation algorithms for array memory optimization in applicative languages
Graph transformation algorithms for array memory optimization in applicative languages
Compilation techniques for high-performance applicative computation
Compilation techniques for high-performance applicative computation
IEEE Parallel & Distributed Technology: Systems & Technology
Expressing Irregular Computations in Modern Fortran Dialects
LCR '98 Selected Papers from the 4th International Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers
Irregular computations in Fortran - expression and implementation strategies
Scientific Programming
From Contracts Towards Dependent Types: Proofs by Partial Evaluation
Implementation and Application of Functional Languages
Communications of the ACM
| Hi-index | 0.02 |
The acquisition of parallel processors in the scientific community is increasing, but the difficulties of programming parallel machines persist. Two approaches have emerged: automatic parallelizing compilers for extant languages, and new languages professed to provide simpler and cleaner parallel programming models. Unfortunately, because of their semantics most new languages have acquired a reputation for inefficiency. This paper compares the performance of SISAL, an applicative language for parallel numerical computations, and FORTRAN using the Livermore Loops. Our intent is to show that applicative programs, when compiled using a set of powerful yet simple optimization techniques, can achieve sequential execution speeds comparable to FORTRAN, and automatically utilize conventional shared memory multiprocessors.