Parallelism and Compilers

Christoph W. Keßler

Habilitation thesis, 336 pages, FB IV, Universitšt Trier, Germany, Dec. 2000.


1 Introduction and Overview
1.1 Instruction Scheduling
1.2 Automatic Program Comprehension and Automatic Parallelization
1.3 Design and Implementation of Parallel Programming Languages
2 Instruction Scheduling
2.1 Introduction
2.2 Basic Definitions
2.3 Contiguous Schedules
2.4 Computing Optimal Schedules
2.5 Extension for Optimal Scheduling of Spill Code
2.6 Extension for Partial Recomputations
2.7 Related Work
2.8 Summary
3 Automatic Comprehension and Parallelization of Sparse Matrix Codes
3.1 Introduction
3.2 Vectors and (Sparse) Matrices
3.3 Concepts
3.4 Speculative Concept Recognition
3.5 SPARAMAT Implementation
3.6 The Concept Specification Language CSL
3.7 Related work
3.8 Future Work
3.9 Summary
4 Design of Parallel Programming Languages
4.1 The SPMD Processor Group Concept
4.2 Fork Language Design
4.3 A Plea for Structured Parallel Programming in Fork
4.4 ForkLight Language Design
4.4 NestStep Language Design
4.6 Other Parallel Programming Languages
4.7 Summary
5 Implementation of Parallel Programming Languages
5.1 Compiling Fork for the SB-PRAM
5.2 Compiling Fork for Other Parallel Architectures
5.3 Compiling ForkLight for an Asynchronous PRAM
5.4 Compiling NestStep to a Distributed Memory System
5.5 Summary



@misc{ Kessler_d3,
 author = {Christoph W. Ke{\ss}ler},
 title = {Parallelism and Compilers},
 howpublished = {Habilitation thesis, 336 pages, FB IV, Universitšt Trier, Germany},
 year = 2000, month = dec


Copyright notice: This section contains links to material covered by copyright; copyright may be held by the author and/or the publisher. You may browse them at your convenience (in the same spirit as you may read a journal or a proceedings article in a public library). Retrieving, copying, or distributing these files, however, may violate the copyright protection law. We recommend that the user obey international law in accessing this directory.
Note also that the material made accessible below may be based on a submitted version and thus differ in minor details from the published version.

Christoph Kessler