Self-optimizing MPI applications: A simulation-based approach

2Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Historically, high performance systems use schedulers and intelligent resource managers in order to optimize system usage and application performance. Most of the times, applications just issue requests of resources to the central system. This centralized approach is an unnecessary constraint for a class of potentially flexible applications, whose resource usage may be modulated as a function of the system status. In this paper we propose a tool which, in a way essentially transparent to final users, lets the application to self-tune in function of the status of the target execution environment. The approach hinges on the use of the MetaPL/HeSSE methodology, i.e., on the use of simulation to predict execution times and skeletal descriptions of the application to describe run-time resource usage. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Mancini, E. P., Rak, M., Torella, R., & Villano, U. (2005). Self-optimizing MPI applications: A simulation-based approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3726 LNCS, pp. 143–155). Springer Verlag. https://doi.org/10.1007/11557654_20

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