POSC: A Partitioning and Optimizing SISAL Compiler
- International Business Machines Corp., Yorktown Heights, NY (USA). Thomas J. Watson Research Center
- Lawrence Livermore National Lab., CA (USA)
Single-assignment languages like SISAL offer parallelism at all levels --- among arbitrary operations, conditionals, loop iterations, and function calls. All control data dependences are local, and can be easily determined from the program. Various studies of SISAL programs have that they contain massive amounts of potential parallelism. There are two major challenges in converting this potential parallelism into real speedup on multiprocessor systems. First, it is important to carefully select the useful parallelism in a SISAL program, so as to obtain good speedup by trading off parallelism with overhead. Second, it is important to do sequential optimizations, so that the sequential components (tasks) of the SISAL program have comparable execution times with sequential languages such as Fortran, Pascal and C. The POSC compiler system described in this paper addresses both issues by integrating previous work on efficient sequential implementation of SISAL programs with previous work on selecting the useful parallelism in a SISAL program. The combined approach is validated by real speedup measurements on a Sequent Balance multiprocessor. 30 refs., 1 tab.
- Research Organization:
- Lawrence Livermore National Lab., CA (USA)
- Sponsoring Organization:
- DOE/ER
- DOE Contract Number:
- W-7405-ENG-48
- OSTI ID:
- 6845768
- Report Number(s):
- UCRL-102737-Rev.1; CONF-9006114--1-Rev.1; ON: DE90010679
- Country of Publication:
- United States
- Language:
- English
Similar Records
SISAL: Toward resolving the parallel programming crisis
SISAL: Toward resolving the parallel programming crisis