Synthetic signature program for performance scalability

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

Abstract

Due to the complexity of message-passing applications, prediction of the scalability is becoming an increasingly complex goal. To make an efficient use of the system, it is important to predict the application scalability in a target system. Based on prediction models, such as PAS2P (Parallel Application Signature for Performance Prediction), we propose to create a Synthetic Signature (SS) program that allows us to predict the application performance using a limited set of resources and in a bounded analysis time. The SS uses the Scalable Logical Traces (SLT) as input, containing the relevant behavior of the communications and compute of the application. We model this information given by the process’s small-scaled PAS2P signatures to generate a Scaled Trace for N number of processes. Basically, the SS will be executed per iterations in order to obtain the performance prediction. The prediction error was 3.59% for all applications tested using 4 nodes of the system.

Cite

CITATION STYLE

APA

Panadero, J., Wong, A., Rexachs, D., & Luque, E. (2016). Synthetic signature program for performance scalability. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9573, pp. 345–355). Springer Verlag. https://doi.org/10.1007/978-3-319-32149-3_33

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