String players know that bowing properly is the hardest skill they have to learn. In other work [FH97], we develop an algorithm that calculates bowings for BowTech, a project that supports string performers. This algorithm takes a significant amount of time to execute (in our second test case, an hour for the implementation, written in Ada). We have implemented a parallel version of the algorithm in GpH, a parallel superset of Haskell, and measured the quality of output on size pieces of music. The parallel program has been refined using the GranSim simulator and measured on two parallel architectures: a shared memory multiprocessor and a network of workstations.
@InProceedings{bowings,
author = {Cordelia Hall and Hans-Wolfgang Loidl and Phil Trinder and Kevin Hammond and John O'Donnell},
title = {Refining a Parallel Algorithm For Calulating Bowings},
booktitle = {Proceedings of the Glasgow Workshop on Functional Programming},
year = {1997},
address = {Ullapool, Scotland},
month = sep
}