Symbolic cost estimation of parallel applications

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Symbolic cost models are an important performance engineering tool because of their diagnostic value and their very low solution cost when the computation features regularity. However, especially for parallel applications their derivation, including the symbolic simplifications essential for low solution cost, is an effort-intensive and error-prone process. We present a tool that automatically compiles process-oriented performance simulation models into symbolic cost models that are symbolically simplified to achieve extremely low solution cost. As the simulation models are intuitively close to the parallel program and machine under study, derivation effort is significantly reduced. Apart from its use as a stand-alone tool, the compiler is also used within a symbolic cost estimator for data-parallel programs. With minimal program annotation by the user, symbolic cost models are automatically generated in a matter of seconds, while the evaluation time of the models ranges in the milliseconds. Experimental results on four data-parallel programs show that the average prediction error is less than 15%. Apart from providing program scalability assessment, the models correctly predict the best design alternative in all cases.

Cite

CITATION STYLE

APA

van Gemund, A. J. C. (2002). Symbolic cost estimation of parallel applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2400, pp. 147–156). Springer Verlag. https://doi.org/10.1007/3-540-45706-2_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free