|
Abstract : |
While last year's report [16] loosely introduced the general concepts behind the Pamela approach toward modeling and analysis of parallel systems, this report exclusively focuses on the calculus of the methodology. In particular, it defines an algorithmic approach toward serialization analysis, which enables (future) mechanization of the analysis. Thus, a technique is developed to automatically compile symbolic performance models in the course of program translation. It is shown that the resulting performance models fundamentally outperform traditional static estimation approaches at a negligible increase in cost. This claim is illustrated by two case studies, i.e., an LU factorization algorithm on a multiprocessor,, |
