• algorithmic skeletons
• parallel
• simulated annealing

The thesis provides a tool to explore the performances achieved using functionally equivalent parallel programs obtained through refactoring of an initial parallel program in a structured parallel programming context. The refactoring rules may easily lead to innite refactoring trees. The thesis considers nite trees and looks for nodes delivering the minimum service time (that is maximum performance according to the available performance models).
A parallel exploration solution has been designed based on simulated annealing. Experiments show that good solutions are actually found and that the parallel algorithm shows good speedup and scalability on state-of-the-art multicore architectures.