Skip to main content

Resultados relacionados

Resultados totales (Incluyendo duplicados): 10
Encontrada(s) 1 página(s)

UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

Performance analysis and optimization of the FFTXlib on the Intel knights landing architecture

  • Wagner, Michael
  • López, Victor
  • Morillo, Julian
  • Cavazzoni, Carlo
  • Affinito, Fabio
  • Gimenez, Judit
  • Labarta Mancho, Jesús José|||0000-0002-7489-4727
In this paper, we address the decreasing performance of the FFTXlib, the Fast Fourier Transformation (FFT) kernel of Quantum ESPRESSO, when scaling to a full KNL node. An increased performance in the FFTXlib will likewise increase the performance of the entire Quantum ESPRESSO code one of the most used plane-wave DFT codes in the community of material science. Our approach focuses on, first, overlapping computation and communication and, second, decreasing resource contention for higher compute efficiency. In order to achieve this we use the OmpSs programming model based on task dependencies. We allow overlapping of computation and communication by converting all steps of the FFT into tasks following a flow dependency. In the same way, we decrease resource contention by converting each FFT into an individual task that can be scheduled asynchronously. In both cases, multiple FFTs can be computed in parallel. The task-based optimizations are implemented in the FFTXlib and show up to 10% runtime reduction on the already highly optimized version. Since the task scheduling is done dynamically during execution by the parallel runtime, not statically by the user, it also frees the user from finding the ideal parallel configuration himself., We gratefully acknowledge the support of the MaX and POP projects, which have received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No. 676598 and 676553, respectively., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

Analyzing the efficiency of hybrid codes

  • Giménez Lucas, Judit
  • Mercadal, Estanislao
  • Llort, German
  • Méndez, Sandra
Hybrid parallelization may be the only path for most codes to use HPC systems on a very large scale. Even within a small scale, with an increasing number of cores per node, combining MPI with some shared memory thread-based library allows to reduce the application network requirements. Despite the benefits of a hybrid approach, it is not easy to achieve an efficient hybrid execution. This is not only because of the added complexity of combining two different programming models, but also because in many cases the code was initially designed with just one level of parallelization and later extended to a hybrid mode. This paper presents our model to diagnose the efficiency of hybrid applications, distinguishing the contribution of each parallel programming paradigm. The flexibility of the proposed methodology allows us to use it for different paradigms and scenarios, like comparing the MPI+OpenMP and MPI+CUDA versions of the same code., This work has been partially developed under the scope of POP CoE which has received funding from the European Union´s Horizon 2020 research and innovation programme (under grant agreements No. 676553 and 824080), and with the support of the Comision Interministerial de Ciencia y Tecnología (CICYT) under contract No. PID2019- 107255GB-C22. We also want to acknowledge the ChEESE CoE and the EDANYA group from Universidad de Málaga (www.uma.es/edanya) that granted us permission to report on the Tsunami-HySEA analysis., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Efficient Computation of Sparse Matrix Functions for Large-Scale Electronic Structure Calculations: The CheSS Library

  • Mohr, Stephan|||0000-0003-2510-5805
  • Dawson, William
  • Wagner, Michael
  • Caliste, Damien
  • Nakajima, Takahito
  • Genovese, Luigi
We present CheSS, the “Chebyshev Sparse Solvers” library, which has been designed to solve typical problems arising in large-scale electronic structure calculations using localized basis sets. The library is based on a flexible and efficient expansion in terms of Chebyshev polynomials and presently features the calculation of the density matrix, the calculation of matrix powers for arbitrary powers, and the extraction of eigenvalues in a selected interval. CheSS is able to exploit the sparsity of the matrices and scales linearly with respect to the number of nonzero entries, making it well-suited for large-scale calculations. The approach is particularly adapted for setups leading to small spectral widths of the involved matrices and outperforms alternative methods in this regime. By coupling CheSS to the DFT code BigDFT, we show that such a favorable setup is indeed possible in practice. In addition, the approach based on Chebyshev polynomials can be massively parallelized, and CheSS exhibits excellent scaling up to thousands of cores even for relatively small matrix sizes., We gratefully acknowledge the support of the MaX (SM) and POP (MW) projects, which have received funding from the European Union's Horizon 2020 research and innovation programme under grant agreement No. 676598 and 676553, respectively. This work was also supported by the Energy oriented Centre of Excellence (EoCoE), grant agreement number 676629, funded within the Horizon2020 framework of the European Union, as well as by the Next-Generation Supercomputer project (the K computer project) and the FLAGSHIP2020 within the priority study5 (Development of new fundamental technologies for high-efficiency energy creation, conversion/storage and use) from the Ministry of Education, Culture, Sports, Science and Technology (MEXT) of Japan. We (LG, DC, WD, TN) gratefully acknowledge the joint CEA-RIKEN collaboration action., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

Benefits of SMT and of Parallel Transpose Algorithm for the Large-Scale GYSELA Application

  • Latu, Guillaume
  • Bigot, Julien
  • Bouzat, Nicolas
  • Gimenez, Judit
  • Grandgirard, Virginie
This article describes how we manage to increase performance and to extend features of a large parallel application through the use of simultaneous multithreading (SMT) and by designing a robust parallel transpose algorithm. The semi-Lagrangian code Gysela typically performs large physics simulations using a few thousands of cores, between 1k cores up to 16k on x86-based clusters. However, simulations with finer resolutions and with kinetic electrons increase those needs by a huge factor, providing a good example of applications requiring Exascale machines. To improve Gysela compute times, we take advantage of efficient SMT implementations available on recent INTEL architectures. We also analyze the cost of a transposition communication scheme that involves a large number of cores in our case. Adaptation of the code for balance load whenever using both SMT and good deployment strategy led to a significant reduction that can be up to 38% of the execution times., This work was strongly supported by the Energy oriented Centre of Excellence (EoCoE), grant agreement number 676629, funded within the Horizon 2020 framework of the European Union. We gratefully acknowledge the POP project, that has also received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No 676553. This work was possible due to the generous computational and software engineering supports from FZJ Juelich (Germany) and CCRT Bruyères- le-Châtel (France). The authors would also like to thank Chantal Passeron for assistance and for her precious help., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

Performance optimisation and productivity centre of excellence

  • Bridgwater, Sally
As machines get larger and scientific applications advance, it is more and more imperative to fully utilize high performance computing (HPC) capability. The complexity and changing landscape of parallel computers may lead to users being unable or unsure how to achieve optimal performance from their applications and fully utilize their HPC resources. The Performance Optimisation and Productivity Centre of Excellence in Computing Applications (POP) has received funding from the European Commission as part of the Horizon 2020 programme to help alleviate these issues. It aims to uncover inefficiencies and their causes in existing parallel HPC applications that will lead to an improvement in the productivity and competitiveness of European organizations, in academia, government and industry. The POP project will drive efforts to highlight the need for and best practices in performance optimization through performance audits on codes along with training events to improve knowledge in this area. The aim is to help developers target their code development and refactoring in the most efficient direction and provide a return on investment from the savings due to the performance improvement. The POP project combines the expertise and experience of Barcelona Supercomputing Center (BSC), High Performance Computing Center Stuttgart, Jülich Supercomputing Centre (JSC), Numerical Algorithms Group Ltd (NAG), RWTH Aachen and TERATEC. This combination provides longstanding and well respected resources in the academic and commercial realms. The POP members have come together to create a coherent and consistent methodology to give a clear, precise and useful overview of the performance of each HPC application. The services of the POP project are free of charge to organizations with in the EU to analyze and advise on any parallel code in academic, government or industrial organizations of any domain., Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Performance optimisation and productivity centre of excellence

  • Bridgwater, Sally
As machines get larger and scientific applications advance, it is more and more imperative to fully utilize high performance computing (HPC) capability. The complexity and changing landscape of parallel computers may lead to users being unable or unsure how to achieve optimal performance from their applications and fully utilize their HPC resources. The Performance Optimisation and Productivity Centre of Excellence in Computing Applications (POP) has received funding from the European Commission as part of the Horizon 2020 programme to help alleviate these issues. It aims to uncover inefficiencies and their causes in existing parallel HPC applications that will lead to an improvement in the productivity and competitiveness of European organizations, in academia, government and industry. The POP project will drive efforts to highlight the need for and best practices in performance optimization through performance audits on codes along with training events to improve knowledge in this area. The aim is to help developers target their code development and refactoring in the most efficient direction and provide a return on investment from the savings due to the performance improvement. The POP project combines the expertise and experience of Barcelona Supercomputing Center (BSC), High Performance Computing Center Stuttgart, Jülich Supercomputing Centre (JSC), Numerical Algorithms Group Ltd (NAG), RWTH Aachen and TERATEC. This combination provides longstanding and well respected resources in the academic and commercial realms. The POP members have come together to create a coherent and consistent methodology to give a clear, precise and useful overview of the performance of each HPC application. The services of the POP project are free of charge to organizations with in the EU to analyze and advise on any parallel code in academic, government or industrial organizations of any domain., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Analyzing the efficiency of hybrid codes

  • Giménez Lucas, Judit
  • Mercadal, Estanislao
  • Llort, German
  • Méndez, Sandra
Hybrid parallelization may be the only path for most codes to use HPC systems on a very large scale. Even within a small scale, with an increasing number of cores per node, combining MPI with some shared memory thread-based library allows to reduce the application network requirements. Despite the benefits of a hybrid approach, it is not easy to achieve an efficient hybrid execution. This is not only because of the added complexity of combining two different programming models, but also because in many cases the code was initially designed with just one level of parallelization and later extended to a hybrid mode. This paper presents our model to diagnose the efficiency of hybrid applications, distinguishing the contribution of each parallel programming paradigm. The flexibility of the proposed methodology allows us to use it for different paradigms and scenarios, like comparing the MPI+OpenMP and MPI+CUDA versions of the same code., This work has been partially developed under the scope of POP CoE which has received funding from the European Union´s Horizon 2020 research and innovation programme (under grant agreements No. 676553 and 824080), and with the support of the Comision Interministerial de Ciencia y Tecnología (CICYT) under contract No. PID2019- 107255GB-C22. We also want to acknowledge the ChEESE CoE and the EDANYA group from Universidad de Málaga (www.uma.es/edanya) that granted us permission to report on the Tsunami-HySEA analysis., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Efficient Computation of Sparse Matrix Functions for Large-Scale Electronic Structure Calculations: The CheSS Library

  • Mohr, Stephan
  • Dawson, William
  • Wagner, Michael
  • Caliste, Damien
  • Nakajima, Takahito
  • Genovese, Luigi
We present CheSS, the “Chebyshev Sparse Solvers” library, which has been designed to solve typical problems arising in large-scale electronic structure calculations using localized basis sets. The library is based on a flexible and efficient expansion in terms of Chebyshev polynomials and presently features the calculation of the density matrix, the calculation of matrix powers for arbitrary powers, and the extraction of eigenvalues in a selected interval. CheSS is able to exploit the sparsity of the matrices and scales linearly with respect to the number of nonzero entries, making it well-suited for large-scale calculations. The approach is particularly adapted for setups leading to small spectral widths of the involved matrices and outperforms alternative methods in this regime. By coupling CheSS to the DFT code BigDFT, we show that such a favorable setup is indeed possible in practice. In addition, the approach based on Chebyshev polynomials can be massively parallelized, and CheSS exhibits excellent scaling up to thousands of cores even for relatively small matrix sizes., We gratefully acknowledge the support of the MaX (SM) and POP (MW) projects, which have received funding from the European Union's Horizon 2020 research and innovation programme under grant agreement No. 676598 and 676553, respectively. This work was also supported by the Energy oriented Centre of Excellence (EoCoE), grant agreement number 676629, funded within the Horizon2020 framework of the European Union, as well as by the Next-Generation Supercomputer project (the K computer project) and the FLAGSHIP2020 within the priority study5 (Development of new fundamental technologies for high-efficiency energy creation, conversion/storage and use) from the Ministry of Education, Culture, Sports, Science and Technology (MEXT) of Japan. We (LG, DC, WD, TN) gratefully acknowledge the joint CEA-RIKEN collaboration action., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Performance analysis and optimization of the FFTXlib on the Intel knights landing architecture

  • Wagner, Michael
  • López, Victor
  • Morillo, Julian
  • Cavazzoni, Carlo
  • Affinito, Fabio
  • Gimenez, Judit
  • Labarta Mancho, Jesús José
In this paper, we address the decreasing performance of the FFTXlib, the Fast Fourier Transformation (FFT) kernel of Quantum ESPRESSO, when scaling to a full KNL node. An increased performance in the FFTXlib will likewise increase the performance of the entire Quantum ESPRESSO code one of the most used plane-wave DFT codes in the community of material science. Our approach focuses on, first, overlapping computation and communication and, second, decreasing resource contention for higher compute efficiency. In order to achieve this we use the OmpSs programming model based on task dependencies. We allow overlapping of computation and communication by converting all steps of the FFT into tasks following a flow dependency. In the same way, we decrease resource contention by converting each FFT into an individual task that can be scheduled asynchronously. In both cases, multiple FFTs can be computed in parallel. The task-based optimizations are implemented in the FFTXlib and show up to 10% runtime reduction on the already highly optimized version. Since the task scheduling is done dynamically during execution by the parallel runtime, not statically by the user, it also frees the user from finding the ideal parallel configuration himself., We gratefully acknowledge the support of the MaX and POP projects, which have received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No. 676598 and 676553, respectively., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Benefits of SMT and of Parallel Transpose Algorithm for the Large-Scale GYSELA Application

  • Latu, Guillaume
  • Bigot, Julien
  • Bouzat, Nicolas
  • Gimenez, Judit
  • Grandgirard, Virginie
This article describes how we manage to increase performance and to extend features of a large parallel application through the use of simultaneous multithreading (SMT) and by designing a robust parallel transpose algorithm. The semi-Lagrangian code Gysela typically performs large physics simulations using a few thousands of cores, between 1k cores up to 16k on x86-based clusters. However, simulations with finer resolutions and with kinetic electrons increase those needs by a huge factor, providing a good example of applications requiring Exascale machines. To improve Gysela compute times, we take advantage of efficient SMT implementations available on recent INTEL architectures. We also analyze the cost of a transposition communication scheme that involves a large number of cores in our case. Adaptation of the code for balance load whenever using both SMT and good deployment strategy led to a significant reduction that can be up to 38% of the execution times., This work was strongly supported by the Energy oriented Centre of Excellence (EoCoE), grant agreement number 676629, funded within the Horizon 2020 framework of the European Union. We gratefully acknowledge the POP project, that has also received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No 676553. This work was possible due to the generous computational and software engineering supports from FZJ Juelich (Germany) and CCRT Bruyères- le-Châtel (France). The authors would also like to thank Chantal Passeron for assistance and for her precious help., Peer Reviewed, Postprint (author's final draft)