Parallel Application Signature for Performance Analysis and Prediction

Wong, Alvaro; Rexachs, Dolores; Luque, Emilio

doi:10.1109/tpds.2014.2329688

Cited by 35 publications

(12 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We have analyzed the execution of each of these benchmarks with the PAS2P tool [26]. We find that the communications represent 82% of the execution time of the CG class B with 16 processes.…”

Section: Limitations and Overhead Analysismentioning

confidence: 99%

See 1 more Smart Citation

Hybrid Message Pessimistic Logging. Improving current pessimistic message logging protocols

Meyer

Muresano

Castro-Len

et al. 2017

Journal of Parallel and Distributed Computing

Self Cite

View full text Add to dashboard Cite

With the growing scale of HPC applications, there has been an increase in the number of interruptions as a consequence of hardware failures. The remarkable decrease of Mean Time Between Failures (MTBF) in current systems encourages the research of suitable fault tolerance solutions. Message logging combined with uncoordinated checkpoint compose a scalable rollback-recovery solution. However, message logging techniques are usually responsible for most of the overhead during failure-free executions. Taking this into consideration, this paper proposes the Hybrid Message Pessimistic Logging (HMPLHMPL) which focuses on combining the fast recovery feature of pessimistic receiver-based message logging with the low failure-free overhead introduced by pessimistic sender-based message logging. The HMPLHMPL manages messages using a distributed controller and storage to avoid harming system’s scalability. Experiments show that the HMPLHMPL is able to reduce overhead by 34% during failure-free executions and 20% in faulty executions when compared with a pessimistic receiver-based message logging.This research has been supported by the MINECO (MICINN) Spain under contracts TIN2011-24384 and TIN2014-53172-P.Peer ReviewedPostprint (author's final draft

show abstract

Section: Limitations and Overhead Analysismentioning

confidence: 99%

“…Scientific parallel applications are normally composed of a set of phases that are repeated during application execution [26]. Some of these phases could be computation bound and others communication bound.…”

Section: Limitations and Overhead Analysismentioning

confidence: 99%

Hybrid Message Pessimistic Logging. Improving current pessimistic message logging protocols

Meyer

Muresano

Castro-Len

et al. 2017

Journal of Parallel and Distributed Computing

Self Cite

View full text Add to dashboard Cite

show abstract

“…Another important element is to find the communication pattern (source and destination of the package) and volume (size of the message sent). In this sense, we have used a tool called PAS2P (Parallel Application Signature for Performance Prediction), which allows us to know the behavior of the SPMD-MPI application making a signature of it [33] [34]. This tool gives us the communication pattern that is a key step in order to know the communication behavior of the application.…”

Section: Characterization Phasementioning

confidence: 99%

An approach for an efficient execution of SPMD applications on Multi-core environments

Muresano

Meyer

Rexachs

et al. 2017

Future Generation Computer Systems

Self Cite

View full text Add to dashboard Cite

Executing traditional Message Passing Interface (MPI) applications on multi-core cluster balancing speed and computational efficiency is a difficult task that parallel programmers have to deal with. For this reason, communications on multi-core clusters ought to be handled carefully in order to improve performance metrics such as efficiency, speedup, execution time and scalability. In this paper we focus our attention on SPMD (Single Program Multiple Data) applications with high communication volume and synchronicity and also following characteristics such as: static, local and regular. This work proposes a method for SPMD applications, which is focused on managing the communication heterogeneity (different cache level, RAM memory, network, etc.) on homogeneous multi-core computing platform in order to improve the application efficiency. In this sense, the main objective of this work is to find analytically the ideal number of cores necessary that allows us to obtain the maximum speedup, while the computational efficiency is maintained over a defined threshold (strong scalability). This method also allows us to determine how the problem size must be increased in order to maintain an execution time constant while the number of cores are expanded (weak scalability) considering the tradeoff between speed and efficiency. This methodology has been tested with different benchmarks and applications and we achieved an average improvement around 30.35% of efficiency in applications tested using different problems sizes and multi-core clusters. In addition, results show that maximum speedup with a defined efficiency is located close to the values calculated with our analytical model with an error rate lower than 5% for the applications tested.This research has been supported by the MINECO (MICINN) Spain under contracts TIN2011-24384 and TIN2014-\ud 53172-PPeer ReviewedPostprint (author's final draft

show abstract

“…PAS2P (Parallel Application Signature for Performance Prediction) [12] is a tool that allows us to analyze the dynamic behavior of the application, charac terizing it in a set of phases that represent the performance of the application. With the phases, PAS2P constructs the application signature, which is defined by the set of phases which represent the application behavior at the performance level.…”

Section: Introductionmentioning

confidence: 99%

Benchmark Based on Application Signature to Analyze and Predict Their Behavior

Tirado

Wong

Rexachs

et al. 2019

Communications in Computer and Information Science

Self Cite

View full text Add to dashboard Cite

Currently, there are benchmark sets that measure the per formance of HPC systems under specific computing and communication properties. These benchmarks represent the kernels of applications that measure specific hardware components. If the user's application is not represented by any benchmark, it is not possible to obtain an equiva lent performance metric. In this work, we propose a benchmark based on the signature of an MPI application obtained by the PAS2P method. PAS2P creates the application signature in order to predict the execution time, which we believe will be very adjusted in relation to the execution time of the full application. The signature has two performance qual ities: the bounded time to execute it (a benchmark property) and the quality of prediction. Therefore, we propose to extend the signature by giving the benchmark capacities such as the efficiency of the application over the HPC system. The performance metrics will be performed by the benchmark proposed. The experimentation validates our proposal with an average error of prediction close to 7%.

show abstract

Parallel Application Signature for Performance Analysis and Prediction

Cited by 35 publications

References 23 publications

Hybrid Message Pessimistic Logging. Improving current pessimistic message logging protocols

Hybrid Message Pessimistic Logging. Improving current pessimistic message logging protocols

An approach for an efficient execution of SPMD applications on Multi-core environments

Benchmark Based on Application Signature to Analyze and Predict Their Behavior

Contact Info

Product

Resources

About