José Carlos Mourino
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
José Carlos Mourino has a total of 49 co-authors. Here are the top co-authors by number of shared publications:
- Andrés Gómez
Galicia Supercomputing Center (CESGA), Santiago de Compostela, Spain
7 shared publications - Ramón Doallo
University of A Coruña, Spain
5 shared publications - Carlos Teijeiro
SURF
4 shared publications - Fernando Obelleiro
Departamento de Teoría de la Señal y Comunicaciones, AtlanTTic Resarch Center, University of Vigo, 36310 Vigo, Spain
4 shared publications - Guillermo L. Taboada
Computer Architecture Group, CITIC, Universidade da Coruña, Campus de Elviña, 15071 A Coruña, Spain
4 shared publications - Jose Luis Rodriguez
Dept. Teoría do Sinal e Comunicacións, E. E. Telecomunicación, Universidade de Vigo, 36310 Vigo, Spain
4 shared publications
Latest Publications
- Open Access
- 23 October 2024
- Published by Frontiers Media SA in Frontiers in Public Health
- Vol. 12, 1448988
The SINFONIA project repository for AI-based algorithms and health data
The SINFONIA project’s main objective is to develop novel methodologies and tools that will provide a comprehensive risk appraisal for detrimental effects of radiation exposure on patients, workers, caretakers, and comforters, the public, and the environment during the management of patients suspected or diagnosed with lymphoma, brain tumors, and breast cancers. The project plan defines a series of key objectives to be achieved on the way to the main objective. One of these objectives is to develop and operate a repository to collect, pool, and share data from imaging and non-imaging examinations and radiation therapy sessions, histological results, and demographic information related to individual patients with lymphoma, brain tumors, and breast cancers. This paper presents the final version of that repository, a cloud-based platform for imaging and non-imaging data. It results from the implementation and integration of several software tools and programming frameworks under an evolutive architecture according to the project partners’ needs and the constraints of the General Data Protection Regulation. It provides, among other services, data uploading and downloading, data sharing, file decompression, data searching, DICOM previsualization, and an infrastructure for submitting and running Artificial Intelligence models.
- 23 October 2024
- Published by Frontiers Media SA in Frontiers in Public Health
- Vol. 12, 1448988
Open AccessThe SINFONIA project repository for AI-based algorithms and health data
The SINFONIA project’s main objective is to develop novel methodologies and tools that will provide a comprehensive risk appraisal for detrimental effects of radiation exposure on patients, workers, caretakers, and comforters, the public, and the environment during the management of patients suspected or diagnosed with lymphoma, brain tumors, and breast cancers. The project plan defines a series of key objectives to be achieved on the way to the main objective. One of these objectives is to develop and operate a repository to collect, pool, and share data from imaging and non-imaging examinations and radiation therapy sessions, histological results, and demographic information related to individual patients with lymphoma, brain tumors, and breast cancers. This paper presents the final version of that repository, a cloud-based platform for imaging and non-imaging data. It results from the implementation and integration of several software tools and programming frameworks under an evolutive architecture according to the project partners’ needs and the constraints of the General Data Protection Regulation. It provides, among other services, data uploading and downloading, data sharing, file decompression, data searching, DICOM previsualization, and an infrastructure for submitting and running Artificial Intelligence models.
- 5 October 2017
- Published by SPIE-Intl Soc Optical Eng
- p. 15
Wavelet-based multicomponent denoising on GPU to improve the classification of hyperspectral images
- 5 October 2017
- Published by SPIE-Intl Soc Optical Eng
- p. 15
Wavelet-based multicomponent denoising on GPU to improve the classification of hyperspectral images
- 1 May 2014
- Published by Elsevier in Future Generation Computer Systems
- Vol. 34, 17-25
Fault-tolerant virtual cluster experiments on federated sites using BonFIRE
- 1 May 2014
- Published by Elsevier in Future Generation Computer Systems
- Vol. 34, 17-25
Fault-tolerant virtual cluster experiments on federated sites using BonFIRE
- 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
- 1 December 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Antennas and Propagation Magazine
- Vol. 51 (6) , 20-28
High Scalability FMM-FFT Electromagnetic Solver for Supercomputer Systems
An efficient parallel implementation of the Fast Multipole Method (FMM) combined with the fast Fourier transform (FFT) is presented in this paper. The good scaling properties of the FMM-FFT, combined with a smart parallelization strategy, has been shown to be very effective when using large parallel supercomputers. A challenging problem with more than 150 million unknowns has been solved, demonstrating that the proposed implementation of the FMM-FFT constitutes a real alternative to the more frequently used multilevel approaches, such as the Multilevel FMM (MLFMA). Even more importantly, we have achieved a high efficiency with 1,024 parallel processors, which indeed constitutes one of the better scalability results ever reached for a rigorous integral-equation electromagnetic solver.
- 1 December 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Antennas and Propagation Magazine
- Vol. 51 (6) , 20-28
High Scalability FMM-FFT Electromagnetic Solver for Supercomputer Systems
An efficient parallel implementation of the Fast Multipole Method (FMM) combined with the fast Fourier transform (FFT) is presented in this paper. The good scaling properties of the FMM-FFT, combined with a smart parallelization strategy, has been shown to be very effective when using large parallel supercomputers. A challenging problem with more than 150 million unknowns has been solved, demonstrating that the proposed implementation of the FMM-FFT constitutes a real alternative to the more frequently used multilevel approaches, such as the Multilevel FMM (MLFMA). Even more importantly, we have achieved a high efficiency with 1,024 parallel processors, which indeed constitutes one of the better scalability results ever reached for a rigorous integral-equation electromagnetic solver.
- Open Access
- 5 October 2009
- Published by Association for Computing Machinery (ACM)
- p. 1-7
UPC performance evaluation on a multicore system
As size and architectural complexity of High Performance Computing systems increases, the need for productive programming tools and languages becomes more important. The UPC language aims to be a good choice for a productive parallel programming. However, productivity is influenced not only by expressiveness of the language, but also by its performance. To assess the current UPC performance in high performance multicore systems, and therefore to help improve UPC developers future productivity, this paper provides an up-to-date UPC performance evaluation at various levels, evaluating two collective implementations, comparing their results with their MPI counterparts, and finally evaluating UPC and MPI performance in computational kernels. This analysis shows a path to optimize UPC collectives performance. This work also provides a performance snapshot of UPC vs the currently most popular choice for parallel programming, MPI. This snapshot, altogether with the UPC collectives analysis, shows that there is room for improvement and, besides its worse performance, UPC is suitable for a productive development of most HPC applications.
- 5 October 2009
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessUPC performance evaluation on a multicore system
As size and architectural complexity of High Performance Computing systems increases, the need for productive programming tools and languages becomes more important. The UPC language aims to be a good choice for a productive parallel programming. However, productivity is influenced not only by expressiveness of the language, but also by its performance. To assess the current UPC performance in high performance multicore systems, and therefore to help improve UPC developers future productivity, this paper provides an up-to-date UPC performance evaluation at various levels, evaluating two collective implementations, comparing their results with their MPI counterparts, and finally evaluating UPC and MPI performance in computational kernels. This analysis shows a path to optimize UPC collectives performance. This work also provides a performance snapshot of UPC vs the currently most popular choice for parallel programming, MPI. This snapshot, altogether with the UPC collectives analysis, shows that there is room for improvement and, besides its worse performance, UPC is suitable for a productive development of most HPC applications.
- Open Access
- 5 October 2009
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Evaluation of UPC programmability using classroom studies
- 5 October 2009
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessEvaluation of UPC programmability using classroom studies
- 1 July 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 15-18
Parallel FMM-FFT solver for the analysis of hundreds of millions of unknowns
An efficient parallel implementation of the fast multipole method (FMM) combined with the fast fourier transform (FFT) is presented. The good scaling properties of the FMM-FFT, combined with a careful parallelization strategy, has shown to be very effective when using large parallel high performance supercomputers. For the case of very large problems, with hundreds of millions of unknowns, a nested scheme has been derived that further reduces the memory consumption. A challenging problem with more than 0.5 billion unknowns has been solved using this implementation, which demonstrates the ability of the algorithm to take advantage of the availability of supercomputers for the analysis of large, leading-edge electromagnetic problems.
- 1 July 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 15-18
Parallel FMM-FFT solver for the analysis of hundreds of millions of unknowns
An efficient parallel implementation of the fast multipole method (FMM) combined with the fast fourier transform (FFT) is presented. The good scaling properties of the FMM-FFT, combined with a careful parallelization strategy, has shown to be very effective when using large parallel high performance supercomputers. For the case of very large problems, with hundreds of millions of unknowns, a nested scheme has been derived that further reduces the memory consumption. A challenging problem with more than 0.5 billion unknowns has been solved using this implementation, which demonstrates the ability of the algorithm to take advantage of the availability of supercomputers for the analysis of large, leading-edge electromagnetic problems.
- 1 June 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15223965,p. 1-4
Analysis of 0.5 billion unknowns using a parallel FMM-FFT solver
In this paper, we demonstrate the usefulness of a variation of the single-level FMM, namely the FMM-Fast Fourier Transform (FMM-FFT), to take advantage of the large amount of computational resources available in modern HPC systems.
- 1 June 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15223965,p. 1-4
Analysis of 0.5 billion unknowns using a parallel FMM-FFT solver
In this paper, we demonstrate the usefulness of a variation of the single-level FMM, namely the FMM-Fast Fourier Transform (FMM-FFT), to take advantage of the large amount of computational resources available in modern HPC systems.
- 6 May 2009
- Published by Springer Nature in Computer Science - Research and Development
- Vol. 23 (3-4) , 169-175
High scalability multipole method. Solving half billion of unknowns
- 6 May 2009
- Published by Springer Nature in Computer Science - Research and Development
- Vol. 23 (3-4) , 169-175
High scalability multipole method. Solving half billion of unknowns