AUTOMATED COST ANALYSIS OF A PARALLEL MAXIMUM SEGMENT SUM PROGRAM DERIVATION

YASUSHI HAYASHI, MURRAY COLE

Research output: Contribution to journalArticlepeer-review

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.
Original languageEnglish
Pages (from-to)95-111
Number of pages17
JournalParallel Processing Letters
Volume12
Issue number01
DOIs
Publication statusPublished - Mar 2002

Fingerprint Dive into the research topics of 'AUTOMATED COST ANALYSIS OF A PARALLEL MAXIMUM SEGMENT SUM PROGRAM DERIVATION'. Together they form a unique fingerprint.

Cite this