Parallel execution of LISP programs in the parallel run time environment
Abstract: "This thesis addresses several issues on designing a run-time system for parallel execution of lisp programs in the PARCEL environment. In particular, we present practical techniques for task scheduling and dynamic control of parallelism. PARCEL is an [sic] parallelizing compiler whic...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Urbana, Ill.
1990
|
| Schriftenreihe: | Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report
991 |
| Schlagworte: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | Abstract: "This thesis addresses several issues on designing a run-time system for parallel execution of lisp programs in the PARCEL environment. In particular, we present practical techniques for task scheduling and dynamic control of parallelism. PARCEL is an [sic] parallelizing compiler which automatically restructures input programs into parallelized codes, where most parallelism is expressed in doall constructs. Due to the characteristics of lisp programs, these doalls are often nested dynamically. Several microtasking schemes are discussed for the efficient execution of dynamically nested doalls. A significant performance degradation will result if every opportunity for parallel execution is taken without considering the limited processing capacity We present methods based on multiple-version of object codes for controlling the growth of parallelism. The key to the success of these methods is the decision when to switch from executing parallel version to executing sequential version, and vise versa. A framework is proposed for investigating this problem and for comparing performance of different control schemes. All of the schemes proposed have been implemented in the PARCEL run-time system, and the experimental results are discussed in detail. |
|---|---|
| Beschreibung: | Urbana, Ill., Univ., Diss. |
| Beschreibung: | 83 S. |