Title: Performance Modeling for Dynamic Algorithm Selection

Authors: M.McCracken, A.Snavely, A.Malony

Abstract: Adaptive algorithms are an important technique to achieve portable high performance. They choose among solution methods and optimizations according to expected performance on a particular ma- chine. Grid environments make the adaptation problem harder, because the optimal decision may change across runs and even during runtime. Therefore, the performance model used by an adaptive algorithm must be able to change decisions without high overhead. In this paper, we present work that is modifying previous research into rapid performance modeling to support adaptive grid applications through sampling and high granularity modeling. We also outline preliminary results that show the ability to predict differences in performance among algorithms in the same program.

Reference: @inproceedings{mccracken03dynamic, Author = {M.McCracken, A.Snavely, A.Malony}, Booktitle = {Workshop on Performance Modeling}, Title = {Performance Modeling for Dynamic Algorithm Selection}, Year = {2003}}