Parallel Program Simulation via Transformation (A Tale of Parallel Quicksort)
|
Abstract:
Abstract. This paper describes how the evaluation of parallel programs may be simulated by transforming a parallel program into a sequential one which generates simulation information in addition to its standard results. This technique allows the programmer to investigate the performance of key programs and algorithms in an abstract way but without having to solve complicated recurrence equations. The main advantage of this technique is its flexibility. It is shown how by using this technique, several different kinds of information concerning a parallel program's behaviour may be generated, including: average parallelism measurements and task profiles. A functional language is used as the candidate parallel language, and Quicksort is used as the example program. 1
Citations
| 1128 | Lectures on constructive functional programming – Bird - 1988 |
| 496 | S.: The Implementation of Functional Programming Languages – Jones - 1987 |
| 89 | A gentle introduction to Haskell – Hudak, Fasel - 1992 |
| 45 | Parallel Programming using Functional Languages (Report CSC 91/R3 – Roe - 1991 |
| 26 | Algorithms and Complexity – Wilf - 1986 |
| 3 | Simulating Multiprocessor Architectures for Compiled Graph-Reduction – Deschner - 1989 |
