Carlos Teijeiro
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
Carlos Teijeiro has a total of 41 co-authors. Here are the top co-authors by number of shared publications:
- Guillermo L. Taboada
Computer Architecture Group, CITIC, Universidade da Coruña, Campus de Elviña, 15071 A Coruña, Spain
9 shared publications - Juan Touriño
Universidade da Coruña, CITIC, Computer Architecture Group, A Coruña, Spain
8 shared publications - Andrés Gómez
Galicia Supercomputing Center (CESGA), Santiago de Compostela, Spain
4 shared publications - José Carlos Mourino
Galicia Supercomputing Center, Santiago de Compostela, Spain
4 shared publications - Ramón Doallo
University of A Coruña, Spain
4 shared publications - Thomas Hammerschmidt
Ruhr-Universität Bochum
4 shared publications
Latest Publications
- 1 February 2019
- Published by Elsevier in Computer Physics Communications
- Vol. 235, 221-233
BOPfox program for tight-binding and analytic bond-order potential calculations
- 1 February 2019
- Published by Elsevier in Computer Physics Communications
- Vol. 235, 221-233
BOPfox program for tight-binding and analytic bond-order potential calculations
- 1 December 2018
- Published by Elsevier in Computational Materials Science
- Vol. 155, 439-449
Parallelization comparison and optimization of a scale-bridging framework to model Cottrell atmospheres
- 1 December 2018
- Published by Elsevier in Computational Materials Science
- Vol. 155, 439-449
Parallelization comparison and optimization of a scale-bridging framework to model Cottrell atmospheres
- 1 September 2017
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 33 (2) , 227-241
Optimized parallel simulations of analytic bond-order potentials on hybrid shared/distributed memory with MPI and OpenMP
Analytic bond-order potentials (BOPs) allow to obtain a highly accurate description of interatomic interactions at a reasonable computational cost. However, for simulations with very large systems, the high memory demands require the use of a parallel implementation, which at the same time also optimizes the use of computational resources. The calculations of analytic BOPs are performed for a restricted volume around every atom and therefore have shown to be well suited for a message passing interface (MPI)-based parallelization based on a domain decomposition scheme, in which one process manages one big domain using the entire memory of a compute node. On the basis of this approach, the present work focuses on the analysis and enhancement of its performance on shared memory by using OpenMP threads on each MPI process, in order to use many cores per node to speed up computations and minimize memory bottlenecks. Different algorithms are described and their corresponding performance results are presented, showing significant performance gains for highly parallel systems with hybrid MPI/OpenMP simulations up to several thousands of threads.
- 1 September 2017
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 33 (2) , 227-241
Optimized parallel simulations of analytic bond-order potentials on hybrid shared/distributed memory with MPI and OpenMP
Analytic bond-order potentials (BOPs) allow to obtain a highly accurate description of interatomic interactions at a reasonable computational cost. However, for simulations with very large systems, the high memory demands require the use of a parallel implementation, which at the same time also optimizes the use of computational resources. The calculations of analytic BOPs are performed for a restricted volume around every atom and therefore have shown to be well suited for a message passing interface (MPI)-based parallelization based on a domain decomposition scheme, in which one process manages one big domain using the entire memory of a compute node. On the basis of this approach, the present work focuses on the analysis and enhancement of its performance on shared memory by using OpenMP threads on each MPI process, in order to use many cores per node to speed up computations and minimize memory bottlenecks. Different algorithms are described and their corresponding performance results are presented, showing significant performance gains for highly parallel systems with hybrid MPI/OpenMP simulations up to several thousands of threads.
- 1 July 2016
- Published by Elsevier in Computer Physics Communications
- Vol. 204, 64-73
Efficient parallelization of analytic bond-order potentials for large-scale atomistic simulations
- 1 July 2016
- Published by Elsevier in Computer Physics Communications
- Vol. 204, 64-73
Efficient parallelization of analytic bond-order potentials for large-scale atomistic simulations
- 12 January 2016
- Published by IOP Publishing in Modelling and Simulation in Materials Science and Engineering
- Vol. 24 (2) , 025008
Complexity analysis of simulations with analytic bond-order potentials
The modeling of materials at the atomistic level with interatomic potentials requires a reliable description of different bonding situations and relevant system properties. For this purpose, analytic bond-order potentials (BOPs) provide a systematic and robust approximation to density functional theory (DFT) and tight binding (TB) calculations at reasonable computational cost. This paper presents a formal analysis of the computational complexity of analytic BOP simulations, based on a detailed assessment of the most computationally intensive parts. Different implementation algorithms are presented alongside with optimizations for efficient numerical processing. The theoretical complexity study is complemented by systematic benchmarks of the scalability of the algorithms with increasing system size and accuracy level of the BOP approximation. Both approaches demonstrate that the computation of atomic forces in analytic BOPs can be performed with a similar scaling as the computation of atomic energies.
- 12 January 2016
- Published by IOP Publishing in Modelling and Simulation in Materials Science and Engineering
- Vol. 24 (2) , 025008
Complexity analysis of simulations with analytic bond-order potentials
The modeling of materials at the atomistic level with interatomic potentials requires a reliable description of different bonding situations and relevant system properties. For this purpose, analytic bond-order potentials (BOPs) provide a systematic and robust approximation to density functional theory (DFT) and tight binding (TB) calculations at reasonable computational cost. This paper presents a formal analysis of the computational complexity of analytic BOP simulations, based on a detailed assessment of the most computationally intensive parts. Different implementation algorithms are presented alongside with optimizations for efficient numerical processing. The theoretical complexity study is complemented by systematic benchmarks of the scalability of the algorithms with increasing system size and accuracy level of the BOP approximation. Both approaches demonstrate that the computation of atomic forces in analytic BOPs can be performed with a similar scaling as the computation of atomic energies.
- 8 May 2014
- Published by Springer Nature in Cluster Computing
- Vol. 17 (4) , 1473-1495
Scalable PGAS collective operations in NUMA clusters
- 8 May 2014
- Published by Springer Nature in Cluster Computing
- Vol. 17 (4) , 1473-1495
Scalable PGAS collective operations in NUMA clusters
- Open Access
- 1 April 2013
- Published by Elsevier in Computer Physics Communications
- Vol. 184 (4) , 1191-1202
Parallel Brownian dynamics simulations with the message-passing and PGAS programming models
- 1 April 2013
- Published by Elsevier in Computer Physics Communications
- Vol. 184 (4) , 1191-1202
Open AccessParallel Brownian dynamics simulations with the message-passing and PGAS programming models
- 1 January 2013
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 28 (1) , 72-89
Design and Implementation of an Extended Collectives Library for Unified Parallel C
- 1 January 2013
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 28 (1) , 72-89
Design and Implementation of an Extended Collectives Library for Unified Parallel C