Analysis and Optimization of a Hybrid Linear Equation Solver using Task-Based Parallel Programming Models
Saved in:
| Title: | Analysis and Optimization of a Hybrid Linear Equation Solver using Task-Based Parallel Programming Models |
|---|---|
| Authors: | Claudia Rosas |
| Contributors: | Vladimir Subotic, José Carlos Sancho, Jesús Labarta |
| Publisher Information: | Zenodo |
| Publication Year: | 2013 |
| Collection: | Zenodo |
| Subject Terms: | parallel applications |
| Description: | This paper describes a methodology and tools to analyze and optimize the performance of task-based parallel applications. For illustrative purposes, a cutting-edge implementation of the Jacobi method aimed to address software challenges at exascale computers is evaluated. Specifically, the analysis was carried out on synchronous and asynchronous task-based implementations of the Jacobi method. The methodology consists of three basic steps: (i) performance analysis; (ii) prediction; and (iii) implementation. First, by instrumenting and tracing an application a general overview of its behavior can be obtained. The Paraver visualization tool enables the identification of performance bottlenecks or scalability problems. Secondly, with the help of prediction tools, such as Tareador and Dimemas, the inherent parallelism of the application is evaluated. Finally, the code is refactored to solve potential inefficiencies that prevent it to achieve higher performance. This final step is accomplished by using the OmpSs task-based parallel programming language. Results reported from using the methodology highlighted performance issues regarding to memory access, synchronization among the threads, and processors with long waiting periods. Additionally, the OmpSs implementation enabled the parallel execution of core functions of the application inside each thread, therefore obtaining a greater utilization of the computational resources. |
| Document Type: | text |
| Language: | unknown |
| Relation: | https://zenodo.org/communities/prace/; https://zenodo.org/records/806945; oai:zenodo.org:806945; https://doi.org/10.5281/zenodo.806945 |
| DOI: | 10.5281/zenodo.806945 |
| Availability: | https://doi.org/10.5281/zenodo.806945 https://zenodo.org/records/806945 |
| Rights: | Creative Commons Attribution 4.0 International ; cc-by-4.0 ; https://creativecommons.org/licenses/by/4.0/legalcode |
| Accession Number: | edsbas.3713DA6 |
| Database: | BASE |
Nájsť tento článok vo Web of Science | Abstract: | This paper describes a methodology and tools to analyze and optimize the performance of task-based parallel applications. For illustrative purposes, a cutting-edge implementation of the Jacobi method aimed to address software challenges at exascale computers is evaluated. Specifically, the analysis was carried out on synchronous and asynchronous task-based implementations of the Jacobi method. The methodology consists of three basic steps: (i) performance analysis; (ii) prediction; and (iii) implementation. First, by instrumenting and tracing an application a general overview of its behavior can be obtained. The Paraver visualization tool enables the identification of performance bottlenecks or scalability problems. Secondly, with the help of prediction tools, such as Tareador and Dimemas, the inherent parallelism of the application is evaluated. Finally, the code is refactored to solve potential inefficiencies that prevent it to achieve higher performance. This final step is accomplished by using the OmpSs task-based parallel programming language. Results reported from using the methodology highlighted performance issues regarding to memory access, synchronization among the threads, and processors with long waiting periods. Additionally, the OmpSs implementation enabled the parallel execution of core functions of the application inside each thread, therefore obtaining a greater utilization of the computational resources. |
|---|---|
| DOI: | 10.5281/zenodo.806945 |