- Abstract:
-
Static performance prediction of implicitly parallel functional programs can be facilitated by restricting the source language to be shapely [7]. The resulting analyses should provide valuable support for the calculational style of program derivation. We build upon previous work in the area by extending the range of admissible programs, allowing us to demonstrate the first automated analysis of a complete program derivation, that of the well known maximum segment sum algorithm of Skillicorn and Cai [11]. We examine the accuracy of our predictions against the run time of real parallel programs.
- Links To Paper
- 1st Link
- Bibtex format
- @Article{EDI-INF-RR-0418,
- author = {
Yasushi Hayashi
and Murray Cole
and
},
- title = {Automated Cost Analysis of a Parallel Maximum Segment Sum Program Derivation},
- journal = {Parallel Processing Letters},
- year = 2002,
- month = {Mar},
- volume = {12(1)},
- pages = {95-112},
- url = {http://homepages.inf.ed.ac.uk/mic/Pubs/automated.pdf},
- }
|