Show Entry in Conferences and Workshops

You may return to the Main Menu when done.

Showing 1 entry

Michael O. McCracken, Allan Snavely, Allen Malony, "Performance Modeling for Dynamic Algorithm Selection," Proc. International Conference on Computational Science (ICCS'03), LNCS 2660, Springer, Berlin, pp. 749-758, 2003.

Keywords: performance modeling, adaptive algorithms

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 machine. 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.


Created: Wed Feb 18 10:31:38 2004

Current Collection: Conferences and Workshops
[ Menu | List | Show | About ]

Return to the ParaDucks Research Group Publications page.