Research Directions in Parallel Functional Programming
Programming is hard. Building a large program is like constructing a steam locomotive through a hole the size of a postage stamp. An artefact that is the fruit of hundreds of person-years is only ever seen by anyone through a lOO-line window. In some ways it is astonishing that such large systems wo...
Other Authors: | , |
---|---|
Format: | eBook |
Language: | English |
Published: |
London
Springer London
1999, 1999
|
Edition: | 1st ed. 1999 |
Subjects: | |
Online Access: | |
Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
Table of Contents:
- I. Fundamentals
- 1. Introduction
- 2. Foundations
- 3. Programming Language Constructs
- 4. Proof
- 5. Realisations for Strict Languages
- 6. Realisations for Non-Strict Languages
- II. Current Research Areas
- 7. Data Parallelism
- 8. Cost Modelling
- 9. Shaping Distributions
- 10. Performance Monitoring
- 11. Memory Performance of Dataflow Programs
- 12. Portability of Performance in the BSP Model
- 13. Algorithmic Skeletons
- 14. Coordination Languages
- 15. Parallel and Distributed Programming in Concurrent Clean
- 16. Functional Process Modelling
- 17. Validating Programs in Concurrent ML
- 18. Explicit Parallelism
- III. Conclusion
- 19. Large Scale Functional Applications
- 20. Summary