Application of the Polytope Model to Functional Programs [chapter]

Nils Ellmenreich, Christian Lengauer, Martin Griebl
2000 Lecture Notes in Computer Science  
New areas of applications make the world of supercomputing more important than ever before. The programming of parallel machines remains di cult, even though new languages are being developed every year. They often follow the imperative paradigm, enriched with low-level parallel directives. To improve on this situation, we propose the use of functional languages, known for their ease of programming due to their high level of abstraction, and employ a speci c parallelization method based on the
more » ... olytope model, which has been successful for imperative scienti c programs. We describe the prerequisites for adapting the polytope model to Haskell, a non-strict functional language. Di erent evaluation strategies are being considered and the question of how indexed data structures are to be dealt with in a functional language is examined. Finally, a parallelization of the LU decomposition algorithm exempli es the method.
doi:10.1007/3-540-44905-1_14 fatcat:zpi6cjpeb5bmfh6duotvoqwp7a