Judit Gimenez
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Judit Gimenez has a total of 64 co-authors. Here are the top co-authors by number of shared publications:
- Jesus Labarta
Barcelona Supercomputing Center
26 shared publications - Harald Servat
Intel Corporation Iberia
13 shared publications - Germán Llort
Barcelona Supercomputing Center
12 shared publications - Juan Antonio Rodríguez González
Department of Applied Physics, University of Santiago de Compostela, 15782 Santiago de Compostela, Spain
7 shared publications Gabriele Jost
NASA Ames Research Center
4 shared publicationsKevin Huck
4 shared publications
Latest Publications
- 21 September 2016
- Published by Springer Nature
- p. 217-236
The Secrets of the Accelerators Unveiled: Tracing Heterogeneous Executions Through OMPT
- 21 September 2016
- Published by Springer Nature
- p. 217-236
The Secrets of the Accelerators Unveiled: Tracing Heterogeneous Executions Through OMPT
- Open Access
- 8 June 2016
- Published by Association for Computing Machinery (ACM)
- p. 1-10
Benefits of SMT and of Parallel Transpose Algorithm for the Large-Scale GYSELA Application
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\ud the European Union. We gratefully acknowledge the POP project, that has also received funding from the European\ud 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-\ud le-Châtel (France). The authors would also like to thank Chantal Passeron for assistance and for her precious help.Peer ReviewedPostprint (author's final draft
- 8 June 2016
- Published by Association for Computing Machinery (ACM)
- p. 1-10
Open AccessBenefits of SMT and of Parallel Transpose Algorithm for the Large-Scale GYSELA Application
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\ud the European Union. We gratefully acknowledge the POP project, that has also received funding from the European\ud 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-\ud le-Châtel (France). The authors would also like to thank Chantal Passeron for assistance and for her precious help.Peer ReviewedPostprint (author's final draft
- 25 July 2015
- Published by Springer Nature
- p. 57-69
Low-Overhead Detection of Memory Access Patterns and Their Time Evolution
- 25 July 2015
- Published by Springer Nature
- p. 57-69
Low-Overhead Detection of Memory Access Patterns and Their Time Evolution
- Open Access
- 1 June 2014
- Published by FSAEIHE South Ural State University (National Research University) in Supercomputing Frontiers and Innovations
- Vol. 1 (2) , 4-19
Scalability prediction for fundamental performance factors
Inferring the expected performance for parallel applications is getting harder than ever; applications need to be modeled for restricted or nonexistent systems and performance analysts are required to identify and extrapolate their behavior using only the available resources. Prediction models can be based on detailed knowledge of the application algorithms or on blindly trying to extrapolate measurements from existing architectures and codes. This paper describes the work done to define an intermediate methodology where the combination of (a) the essential knowledge about fundamental factors in parallel codes, and (b) detailed analysis of the application behavior at low core counts on current platforms, guides the modeling efforts to estimate behavior at very large core counts. Our methodology integrates the use of several components like instrumentation package, visualization tools, simulators, analytical models and very high level information from the application running on systems in production to build a performance model.
- 1 June 2014
- Published by FSAEIHE South Ural State University (National Research University) in Supercomputing Frontiers and Innovations
- Vol. 1 (2) , 4-19
Open AccessScalability prediction for fundamental performance factors
Inferring the expected performance for parallel applications is getting harder than ever; applications need to be modeled for restricted or nonexistent systems and performance analysts are required to identify and extrapolate their behavior using only the available resources. Prediction models can be based on detailed knowledge of the application algorithms or on blindly trying to extrapolate measurements from existing architectures and codes. This paper describes the work done to define an intermediate methodology where the combination of (a) the essential knowledge about fundamental factors in parallel codes, and (b) detailed analysis of the application behavior at low core counts on current platforms, guides the modeling efforts to estimate behavior at very large core counts. Our methodology integrates the use of several components like instrumentation package, visualization tools, simulators, analytical models and very high level information from the application running on systems in production to build a performance model.
- 1 May 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 941-951
Identifying Code Phases Using Piece-Wise Linear Regressions
Node-level performance is one of the factors that may limit applications from reaching the supercomputers' peak performance. Studying node-level performance and attributing it to the source code results into valuable insight that can be used to improve the application efficiency, albeit performing such a study may be an intimidating task due to the complexity and size of the applications. We present in this paper a mechanism that takes advantage of combining piece-wise linear regressions, coarse-grain sampling, and minimal instrumentation to detect performance phases in the computation regions even if their granularity is very fine. This mechanism then maps the performance of each phase into the application syntactical structure displaying a correlation between performance and source code. We introduce a methodology on top of this mechanism to describe the node-level performance of parallel applications, even for first-time seen applications. Finally, we demonstrate the methodology describing optimized in-production applications and further improving their performance applying small transformations to the code based on the hints discovered.
- 1 May 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 941-951
Identifying Code Phases Using Piece-Wise Linear Regressions
Node-level performance is one of the factors that may limit applications from reaching the supercomputers' peak performance. Studying node-level performance and attributing it to the source code results into valuable insight that can be used to improve the application efficiency, albeit performing such a study may be an intimidating task due to the complexity and size of the applications. We present in this paper a mechanism that takes advantage of combining piece-wise linear regressions, coarse-grain sampling, and minimal instrumentation to detect performance phases in the computation regions even if their granularity is very fine. This mechanism then maps the performance of each phase into the application syntactical structure displaying a correlation between performance and source code. We introduce a methodology on top of this mechanism to describe the node-level performance of parallel applications, even for first-time seen applications. Finally, we demonstrate the methodology describing optimized in-production applications and further improving their performance applying small transformations to the code based on the hints discovered.
- 13 December 2013
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 28 (2) , 252-273
Detailed and simultaneous power and performance analysis
- 13 December 2013
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 28 (2) , 252-273
Detailed and simultaneous power and performance analysis
- Open Access
- 17 November 2013
- Published by Association for Computing Machinery (ACM)
- p. 1-11
On the usefulness of object tracking techniques in performance analysis
Understanding the behavior of a parallel application is crucial if we are to tune it to achieve its maximum performance. Yet the behavior the application exhibits may change over time and depend on the actual execution scenario: particular inputs and program settings, the number of processes used, or hardware-specific problems. So beyond the details of a single experiment a far more interesting question arises: how does the application behavior respond to changes in the execution conditions? In this paper, we demonstrate that object tracking concepts from computer vision have huge potential to be applied in the context of performance analysis. We leverage tracking techniques to analyze how the behavior of a parallel application evolves through multiple scenarios where the execution conditions change. This method provides comprehensible insights on the influence of different parameters on the application behavior, enabling us to identify the most relevant code regions and their performance trends.
- 17 November 2013
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Open AccessOn the usefulness of object tracking techniques in performance analysis
Understanding the behavior of a parallel application is crucial if we are to tune it to achieve its maximum performance. Yet the behavior the application exhibits may change over time and depend on the actual execution scenario: particular inputs and program settings, the number of processes used, or hardware-specific problems. So beyond the details of a single experiment a far more interesting question arises: how does the application behavior respond to changes in the execution conditions? In this paper, we demonstrate that object tracking concepts from computer vision have huge potential to be applied in the context of performance analysis. We leverage tracking techniques to analyze how the behavior of a parallel application evolves through multiple scenarios where the execution conditions change. This method provides comprehensible insights on the influence of different parameters on the application behavior, enabling us to identify the most relevant code regions and their performance trends.
- 1 October 2013
- Published by Elsevier in Future Generation Computer Systems
- Vol. 29 (8) , 2197-2204
Scalability analysis of Dalton, a molecular structure program
- 1 October 2013
- Published by Elsevier in Future Generation Computer Systems
- Vol. 29 (8) , 2197-2204
Scalability analysis of Dalton, a molecular structure program
- 1 August 2013
- Published by Elsevier in Parallel Computing
- Vol. 39 (8) , 336-353
Framework for a productive performance optimization
- 1 August 2013
- Published by Elsevier in Parallel Computing
- Vol. 39 (8) , 336-353
Framework for a productive performance optimization
- 1 January 2013
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 414-428
On the Instrumentation of OpenMP and OmpSs Tasking Constructs
- 1 January 2013
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 414-428
On the Instrumentation of OpenMP and OmpSs Tasking Constructs