Application of the polytope model to functional programs

New areas of applications make the world of supercomputing more important than ever before. The programming of parallel machines remains dicult, 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 specic parallelization method based on the polytope model, which has been suc-cessful for imperative scientic programs. We describe the prerequisites for adapting the polytope model to Haskell, a non-strict functional language. Dierent 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.