DocumentCode
652267
Title
Tuning SPMD Applications in Order to Increase Performability
Author
Meyer, Hans-Georg ; Muresano, Ronal ; Rexachs, Dolores ; Luque, Emilio
Author_Institution
Comput. Archit. & Oper. Syst. Dept., Univ. Autonoma of Barcelona, Barcelona, Spain
fYear
2013
fDate
16-18 July 2013
Firstpage
1170
Lastpage
1178
Abstract
When running parallel applications on HPC clusters usually the prior objectives are: almost linear speedup, efficient resources utilization, scalability and successful completion. Hence, applications executions are now facing a multiobjective problem which is focused on improving Performance while giving Fault Tolerance (FT) support, this combination is defined as Performability. The performance of Single Program Multiple Data (SPMD) applications written using a message-passing library (MPI) may be seriously affected, when applying a message logging approach, because they are tightly coupled and have a huge amount of communications. In this sense, we have proposed a novel method for SPMD applications which allows us to obtain the maximum speedup under a defined efficiency threshold considering the impact of a fault tolerance strategy when executing on multicore clusters. This method is based on four phases: characterization, tile distribution, mapping and scheduling. The idea of this method is to manage the effects of the added overhead of FT techniques, which seriously affect the MPI application performance. In this sense, our method manages the overheads of message logging by overlapping them with computation. Then, the main objective of this method is to determine the approximate number of computational cores and the ideal number of tiles, which permit us to obtain a suitable balance between speedup, efficiency and dependability. The obtained results illustrate that we can find the maximum speedup under a defined efficiency using a FT strategy with a small error rate of 5.4% for the worst case. By using our method, we can also determine the ideal problem size for a given number of computational cores (weak scalability) using FT with an error of around 5.8%. Results also show that our message logging approach could be tuned to introduce a constant overhead percentage when scaling the size of the problem.
Keywords
application program interfaces; message passing; multiprocessing systems; parallel processing; resource allocation; software fault tolerance; software performance evaluation; FT techniques; HPC clusters; MPI application performance; SPMD application tuning; computational cores; fault tolerance strategy; fault tolerance support; linear speedup; message logging approach; message-passing library; multicore clusters; parallel applications; performability; resource utilization; scalability; single program multiple data applications; tile distribution; Fault tolerance; Fault tolerant systems; Multicore processing; Receivers; Scalability; Tiles; Efficiency; Fault Tolerance; Performability; RADIC; SPMD; Scalability;
fLanguage
English
Publisher
ieee
Conference_Titel
Trust, Security and Privacy in Computing and Communications (TrustCom), 2013 12th IEEE International Conference on
Conference_Location
Melbourne, VIC
Type
conf
DOI
10.1109/TrustCom.2013.141
Filename
6680962
Link To Document