Antonio Gómez-Iglesias
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
Antonio Gómez-Iglesias has a total of 168 co-authors. Here are the top co-authors by number of shared publications:
- Miguel A. Vega-Rodríguez
Universidad de Extremadura
26 shared publications - Miguel Cárdenas-Montes
Departamento de Investigación Básica, Centro de Investigaciones Energéticas, Medioambientales y Tecnológicas (CIEMAT), Madrid, Spain
25 shared publications - Francisco Castejon
National Fusion Laboratory, CIEMAT, 28040 Madrid, Spain
15 shared publications Enrique Morales-Ramos
7 shared publicationsCarlos Rosales
Texas Advanced Computing Center, The University of Texas at Austin, J.J. Pickle Research Center, Austin, Texas
3 shared publicationsJuan José Rodríguez-Vázquez
Centro de Investigaciones Energeticas Medioambientales y Tecnologicas
3 shared publications
Latest Publications
- 10 April 2019
- Published by Springer Nature
- p. 123-139
High-Level Approaches for Leveraging Deep-Memory Hierarchies on Modern Supercomputers
- 10 April 2019
- Published by Springer Nature
- p. 123-139
High-Level Approaches for Leveraging Deep-Memory Hierarchies on Modern Supercomputers
- 1 August 2018
- Published by Elsevier in Parallel Computing
- Vol. 76, 28-41
Performance evaluation of the three-point angular correlation function
- 1 August 2018
- Published by Elsevier in Parallel Computing
- Vol. 76, 28-41
Performance evaluation of the three-point angular correlation function
- Open Access
- 9 July 2017
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Evaluation of Intel Omni-Path on the Intel Knights Landing Processor
When a new technology is introduced into the HPC community, it is necessary to understand its performance and how it can affect the way applications interact with the hardware. Intel has recently introduced two new elements into the HPC ecosystem that are being widely adopted by many centers: Intel Omni-Path high performance network and Intel Knights Landing processor. While it is possible to find different studies that analyze the efficiency of the Knights Landing processor, it is not the same situation for Omni-Path, the new 100 Gb/s fabric from Intel. This paper presents a set of studies that investigate the effectiveness of system comprised of this processor and network. The outcomes of this work can be used as guidelines for a better exploitation of these resources on production systems. Also, the methodology employed during our tests can be replicated on a variety of systems and centers to find the ideal configurations of their hardware resources and provide users with recommendations that can improve the performance of their codes and the overall throughput of the clusters.
- 9 July 2017
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessEvaluation of Intel Omni-Path on the Intel Knights Landing Processor
When a new technology is introduced into the HPC community, it is necessary to understand its performance and how it can affect the way applications interact with the hardware. Intel has recently introduced two new elements into the HPC ecosystem that are being widely adopted by many centers: Intel Omni-Path high performance network and Intel Knights Landing processor. While it is possible to find different studies that analyze the efficiency of the Knights Landing processor, it is not the same situation for Omni-Path, the new 100 Gb/s fabric from Intel. This paper presents a set of studies that investigate the effectiveness of system comprised of this processor and network. The outcomes of this work can be used as guidelines for a better exploitation of these resources on production systems. Also, the methodology employed during our tests can be replicated on a variety of systems and centers to find the ideal configurations of their hardware resources and provide users with recommendations that can improve the performance of their codes and the overall throughput of the clusters.
- 1 May 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1325-1332
Performance Prediction of HPC Applications on Intel Processors
It is commonly the case that a small number of widely used applications make up a large fraction of the workload of HPC centers. Predicting the performance of important applications running on specific processors enables HPC centers to design best performing system configurations and to insure good performance for the most popular applications on new systems. In the analyses presented in this paper we use applications that are widely used on current open science HPC systems. We characterize the performance of these applications across a spectrum of modern processors and then create a mathematical model to predict their behavior on possible future processors. The hardware sensitivity studies required to build the predictive model are carried out in an HPC cloud resource with bare metal access, and we describe the process and advantages of this approach in detail. We define and discuss the mathematical model that we have designed and compare the predicted performance of these codes with the empirical results obtained in different chips. Finally, we also use the model to estimate the efficiency of future chips. The results indicate that the model is able to estimate the performance of these codes with a relatively small error across a fairly wide spectrum of chips.
- 1 May 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1325-1332
Performance Prediction of HPC Applications on Intel Processors
It is commonly the case that a small number of widely used applications make up a large fraction of the workload of HPC centers. Predicting the performance of important applications running on specific processors enables HPC centers to design best performing system configurations and to insure good performance for the most popular applications on new systems. In the analyses presented in this paper we use applications that are widely used on current open science HPC systems. We characterize the performance of these applications across a spectrum of modern processors and then create a mathematical model to predict their behavior on possible future processors. The hardware sensitivity studies required to build the predictive model are carried out in an HPC cloud resource with bare metal access, and we describe the process and advantages of this approach in detail. We define and discuss the mathematical model that we have designed and compare the predicted performance of these codes with the empirical results obtained in different chips. Finally, we also use the model to estimate the efficiency of future chips. The results indicate that the model is able to estimate the performance of these codes with a relatively small error across a fairly wide spectrum of chips.
- 1 May 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 703-712
Time and Energy to Solution Evaluation for the Three-Point Angular Correlation Function
This paper analyzes the performance of different implementations of a three-point angular correlation function. This function is used in the study of large scale distribution of galaxies in a variety of computational platforms. The function is based on histogram construction and presents a large computational cost. This cost dramatically increases with the size of the datasets. The implementation presents several challenges depending of the target platform that need to be addressed to achieve the best possible performance. We have considered two different GPUs, a set of x86 Intel machines (multi- and many-core), as well as an FPGA. We first study the best possible implementation for each platform in terms of time to solution. We then compare the power used by those platforms for a predefined number of datasets. Energy is one of the main constraints that computer architects are facing nowadays. The results will be used to evaluate the performance of this function considering those two targets - time and energy - for those platforms and to analyze the suitability of each of those platforms for this specific problem.
- 1 May 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 703-712
Time and Energy to Solution Evaluation for the Three-Point Angular Correlation Function
This paper analyzes the performance of different implementations of a three-point angular correlation function. This function is used in the study of large scale distribution of galaxies in a variety of computational platforms. The function is based on histogram construction and presents a large computational cost. This cost dramatically increases with the size of the datasets. The implementation presents several challenges depending of the target platform that need to be addressed to achieve the best possible performance. We have considered two different GPUs, a set of x86 Intel machines (multi- and many-core), as well as an FPGA. We first study the best possible implementation for each platform in terms of time to solution. We then compare the power used by those platforms for a predefined number of datasets. Energy is one of the main constraints that computer architects are facing nowadays. The results will be used to evaluate the performance of this function considering those two targets - time and energy - for those platforms and to analyze the suitability of each of those platforms for this specific problem.
- 27 December 2016
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 266-278
Resource Constrained Job Scheduling with Parallel Constraint-Based ACO
- 27 December 2016
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 266-278
Resource Constrained Job Scheduling with Parallel Constraint-Based ACO
- 25 November 2016
- Published by Springer Nature
- p. 503-511
Bin Recycling Strategy for an Accuracy-Aware Implementation of Two-Point Angular Correlation Function on GPU
- 25 November 2016
- Published by Springer Nature
- p. 503-511
Bin Recycling Strategy for an Accuracy-Aware Implementation of Two-Point Angular Correlation Function on GPU
- 6 October 2016
- Published by Springer Nature
- p. 307-318
A Comparative Study of Application Performance and Scalability on the Intel Knights Landing Processor
- 6 October 2016
- Published by Springer Nature
- p. 307-318
A Comparative Study of Application Performance and Scalability on the Intel Knights Landing Processor
- 17 September 2016
- Published by Springer Nature
- p. 13-30
Using High Performance Computing for Conquering Big Data
- 17 September 2016
- Published by Springer Nature
- p. 13-30
Using High Performance Computing for Conquering Big Data
- 16 September 2016
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 29 (5)
Parallel evaluation of nonseparable functions by evolutionary algorithms on GPU
Summary: Soft computing takes advantage of the computational capabilities provided by graphics processing units (GPUs), as it is reflected in the numerous works published every year. However, comparisons among these works are challenging because of their peculiarities. When evaluating evolutionary algorithms on GPUs, the data layout is a commonality for all the cases. In the current work the most promising data layout for a parallel evaluation of evolutionary algorithms on GPU is evaluated. The general scope of this work makes it broadly applicable, being useful for accelerating the fitness calculation of large instances of any population‐based evolutionary algorithm. For optimal performance to be achieved in this evaluation, it should be done through a hardware‐software co‐design approach. The co‐design process might imply a risk of overfitting. Because of this, a trade‐off in the co‐design approach is necessary for long‐term sustainability of the performance of such code. As a consequence of this study, a statement about the most promising data layout for evaluating large instances of population‐based evolutionary algorithms on GPU is presented. From the different approaches studied, the strategy with allocation of 1 individual per thread on registers with coalesced access to global memory on both Fermi and Kepler architectures outperforms all the other strategies.
- 16 September 2016
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 29 (5)
Parallel evaluation of nonseparable functions by evolutionary algorithms on GPU
Summary: Soft computing takes advantage of the computational capabilities provided by graphics processing units (GPUs), as it is reflected in the numerous works published every year. However, comparisons among these works are challenging because of their peculiarities. When evaluating evolutionary algorithms on GPUs, the data layout is a commonality for all the cases. In the current work the most promising data layout for a parallel evaluation of evolutionary algorithms on GPU is evaluated. The general scope of this work makes it broadly applicable, being useful for accelerating the fitness calculation of large instances of any population‐based evolutionary algorithm. For optimal performance to be achieved in this evaluation, it should be done through a hardware‐software co‐design approach. The co‐design process might imply a risk of overfitting. Because of this, a trade‐off in the co‐design approach is necessary for long‐term sustainability of the performance of such code. As a consequence of this study, a statement about the most promising data layout for evaluating large instances of population‐based evolutionary algorithms on GPU is presented. From the different approaches studied, the strategy with allocation of 1 individual per thread on registers with coalesced access to global memory on both Fermi and Kepler architectures outperforms all the other strategies.