Ramón Doallo
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
Ramón Doallo has a total of 143 co-authors. Here are the top co-authors by number of shared publications:
- Juan Touriño
Universidade da Coruña, CITIC, Computer Architecture Group, A Coruña, Spain
35 shared publications - Basilio B. Fraguela
Universidade da Coruña, CITIC, Computer Architecture Group, A Coruña, Spain
29 shared publications - Guillermo L. Taboada
Computer Architecture Group, CITIC, Universidade da Coruña, Campus de Elviña, 15071 A Coruña, Spain
29 shared publications - Margarita Amor
Facultade de Informática da Coruña, Universidade da Coruña (UDC), A Coruña, Spain
20 shared publications - Diego Andrade
Universidade da Coruña
11 shared publications - Patricia González
University of A Coruña
10 shared publications
Latest Publications
- Open Access
- 2 October 2023
- Published by Universidade da Coruna
- p. 75-81
Self-adaptive Cooperation Scheme in a Parallel ACO Algorithm for Binary Combinatorial Problems
The ant colony optimization (ACO) is widely used for combinatorial optimization problems, although it can suffer from fast convergence to local minima. In order to provide a versatile implementation of ACO, we present a parallel multicolony strategy with an improved cooperation scheme for binary combinatorial problems. Our proposal is based on a self-adaptive method, which assigns appropriate run-time cooperation levels to each problem based on its size and available computational resources. We evaluate this proposal with problems with different levels of cooperation and number of processes. All these configurations combined show its flexibility as a versatile solver for this type of problems.
- 2 October 2023
- Published by Universidade da Coruna
- p. 75-81
Open AccessSelf-adaptive Cooperation Scheme in a Parallel ACO Algorithm for Binary Combinatorial Problems
The ant colony optimization (ACO) is widely used for combinatorial optimization problems, although it can suffer from fast convergence to local minima. In order to provide a versatile implementation of ACO, we present a parallel multicolony strategy with an improved cooperation scheme for binary combinatorial problems. Our proposal is based on a self-adaptive method, which assigns appropriate run-time cooperation levels to each problem based on its size and available computational resources. We evaluate this proposal with problems with different levels of cooperation and number of processes. All these configurations combined show its flexibility as a versatile solver for this type of problems.
- Open Access
- 20 December 2022
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 66 (7) , 1802-1816
Interactive Visualization of Large Point Clouds Using an Autotuning Multiresolution Out-Of-Core Strategy
Due to the increasingly large amount of data acquired into point clouds, from LiDAR (Light Detection and Ranging) sensors and 2D/3D sensors, massive point clouds processing has become a topic with high interest for several fields. Current client-server applications usually use multiresolution out-of-core proposals; nevertheless, the construction of the data structures required is very time-consuming. Furthermore, these multiresolution approaches present problems regarding point density changes between different levels of detail and artifacts due to the rendering of elements entering and leaving the field of view. We present an autotuning multiresolution out-of-core strategy to avoid these problems. Other objectives are reducing loading times while maintaining low memory requirements, high visualization quality and achieving interactive visualization of massive point clouds. This strategy identifies certain parameters, called performance parameters, and defines a set of premises to obtain the goals mentioned above. The optimal parameter values depend on the number of points per cell in the multiresolution structure. We test our proposal in our web-based visualization software designed to work with the structures and storage format used and display massive point clouds achieving interactive visualization of point clouds with more than 27 billion points.
- 20 December 2022
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 66 (7) , 1802-1816
Open AccessInteractive Visualization of Large Point Clouds Using an Autotuning Multiresolution Out-Of-Core Strategy
Due to the increasingly large amount of data acquired into point clouds, from LiDAR (Light Detection and Ranging) sensors and 2D/3D sensors, massive point clouds processing has become a topic with high interest for several fields. Current client-server applications usually use multiresolution out-of-core proposals; nevertheless, the construction of the data structures required is very time-consuming. Furthermore, these multiresolution approaches present problems regarding point density changes between different levels of detail and artifacts due to the rendering of elements entering and leaving the field of view. We present an autotuning multiresolution out-of-core strategy to avoid these problems. Other objectives are reducing loading times while maintaining low memory requirements, high visualization quality and achieving interactive visualization of massive point clouds. This strategy identifies certain parameters, called performance parameters, and defines a set of premises to obtain the goals mentioned above. The optimal parameter values depend on the number of points per cell in the multiresolution structure. We test our proposal in our web-based visualization software designed to work with the structures and storage format used and display massive point clouds achieving interactive visualization of point clouds with more than 27 billion points.
- Open Access
- 20 July 2022
- Published by Elsevier in Expert Systems with Applications
- Vol. 208
Parallel ant colony optimization for the training of cell signaling networks
- 20 July 2022
- Published by Elsevier in Expert Systems with Applications
- Vol. 208
Open AccessParallel ant colony optimization for the training of cell signaling networks
- Open Access
- 24 June 2022
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 78 (18) , 19522-19544
Land consolidation through parcel exchange among landowners using a distributed Spark-based genetic algorithm
Land consolidation is an essential tool for public administrations to reduce the fragmentation of land ownership. In particular, parcel exchange shows promising potential for restructuring parcel holdings, even more when the number of parcels and owners involved is large. Unfortunately, the number of possible exchange combinations grows very quickly with the number of participating landowners and parcels, with the associated challenge of finding an acceptable solution. In this paper, we present a high-performance solution for parcel exchange based on genetic algorithms. Our proposal, using Apache Spark framework, is based on the exploiting of distributed-memory systems with effortless access in order to reduce the execution time. This also allows increasing the search width through multiple populations that share their advances. This can be achieved without compromising the search depth thanks to the higher amount of resources available from using distributed-memory systems. Our proposal is capable of achieving better solutions in lower amounts of time compared to previous works, showing that genetic algorithms on a high performance system can be used to propose fair parcel exchanges under strict time constraints, even in complex scenarios. The performance achieved allows for fast trial of several options, reducing the time usually needed to perform administrative procedures associated with land fragmentation problems. Specifically, our proposal is capable of combining the benefits of both depth-focused and width-focused multithreaded parallelization. It matches the speedup gains of depth-focused multithreaded parallelization. The width-focused parallelization provides local minimum resilience and fitness value reduction potential. In this paper, multithreading solutions and Spark-based solutions are tested.
- 24 June 2022
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 78 (18) , 19522-19544
Open AccessLand consolidation through parcel exchange among landowners using a distributed Spark-based genetic algorithm
Land consolidation is an essential tool for public administrations to reduce the fragmentation of land ownership. In particular, parcel exchange shows promising potential for restructuring parcel holdings, even more when the number of parcels and owners involved is large. Unfortunately, the number of possible exchange combinations grows very quickly with the number of participating landowners and parcels, with the associated challenge of finding an acceptable solution. In this paper, we present a high-performance solution for parcel exchange based on genetic algorithms. Our proposal, using Apache Spark framework, is based on the exploiting of distributed-memory systems with effortless access in order to reduce the execution time. This also allows increasing the search width through multiple populations that share their advances. This can be achieved without compromising the search depth thanks to the higher amount of resources available from using distributed-memory systems. Our proposal is capable of achieving better solutions in lower amounts of time compared to previous works, showing that genetic algorithms on a high performance system can be used to propose fair parcel exchanges under strict time constraints, even in complex scenarios. The performance achieved allows for fast trial of several options, reducing the time usually needed to perform administrative procedures associated with land fragmentation problems. Specifically, our proposal is capable of combining the benefits of both depth-focused and width-focused multithreaded parallelization. It matches the speedup gains of depth-focused multithreaded parallelization. The width-focused parallelization provides local minimum resilience and fitness value reduction potential. In this paper, multithreading solutions and Spark-based solutions are tested.
- Open Access
A New Spatial Criteria Method to Delimit Rural Settlements towards Boundaries Equity: Land Use Optimization for Decision Making in Galicia, NW Spain
Rural settlements (RS) are a reality of rural areas. They consist of cluster of buildings and ways of life mainly associated with activities related to agriculture. As economic policies applied in rural development have evolved, the physical delimitation of rural areas has become more important because such areas are recipients of financial support, which depends on an area’s characteristics. Thus, it is necessary to formulate a new spatial approach for RS delimitation. The objective of this study is to define spatial criteria for identification and delimitation of the RS to recognize the morphological context of each RS. With respect to methodology, RS in the community of Galicia, Northwestern Spain were studied, and factors for spatial characterization were defined according to experts’ evaluations. Subsequently, spatial restrictions and conditions were identified for the delimitation of boundaries. The criteria that this research proposes reveal numerically adjustable factors that can recognize and interpret the morphological characteristics of each RS, which is also evidenced by the results of RS delimitations. It can be concluded that the numerically defined criteria associated with a spatial operation allow the adaptation to the morphological characteristics of any RS, as well as spatial equity by recognizing the differentiation of building structures and land uses of each RS, rather unlike the criteria defined by the law.
Open AccessA New Spatial Criteria Method to Delimit Rural Settlements towards Boundaries Equity: Land Use Optimization for Decision Making in Galicia, NW Spain
Rural settlements (RS) are a reality of rural areas. They consist of cluster of buildings and ways of life mainly associated with activities related to agriculture. As economic policies applied in rural development have evolved, the physical delimitation of rural areas has become more important because such areas are recipients of financial support, which depends on an area’s characteristics. Thus, it is necessary to formulate a new spatial approach for RS delimitation. The objective of this study is to define spatial criteria for identification and delimitation of the RS to recognize the morphological context of each RS. With respect to methodology, RS in the community of Galicia, Northwestern Spain were studied, and factors for spatial characterization were defined according to experts’ evaluations. Subsequently, spatial restrictions and conditions were identified for the delimitation of boundaries. The criteria that this research proposes reveal numerically adjustable factors that can recognize and interpret the morphological characteristics of each RS, which is also evidenced by the results of RS delimitations. It can be concluded that the numerically defined criteria associated with a spatial operation allow the adaptation to the morphological characteristics of any RS, as well as spatial equity by recognizing the differentiation of building structures and land uses of each RS, rather unlike the criteria defined by the law.
- 1 May 2020
- Published by Elsevier in Future Generation Computer Systems
- Vol. 106, 572-584
An automatic optimizer for heterogeneous devices
- 1 May 2020
- Published by Elsevier in Future Generation Computer Systems
- Vol. 106, 572-584
An automatic optimizer for heterogeneous devices
- Open Access
- 21 February 2020
- Published by MDPI AG in Remote Sensing
- Vol. 12 (4) , 719
Big Data Geospatial Processing for Massive Aerial LiDAR Datasets
For years, Light Detection and Ranging (LiDAR) technology has been considered as a challenge when it comes to developing efficient software to handle the extremely large volumes of data this surveying method is able to collect. In contexts such as this, big data technologies have been providing powerful solutions for distributed storage and computing. In this work, a big data approach on geospatial processing for massive aerial LiDAR point clouds is presented. By using Cassandra and Spark, our proposal is intended to support the execution of any kind of heavy time-consuming process; nonetheless, as an initial case of study, we have focused on fast ground-only rasters obtention to generate digital terrain models (DTMs) from massive LiDAR datasets. Filtered clouds obtained from the isolated processing of adjacent zones may exhibit errors located on the boundaries of the zones in the form of misclassified points. Usually, this type of error is corrected through manual or semi-automatic procedures. In this work, we also present an automated strategy for correcting errors of this type, improving the quality of the classification process and the DTMs obtained while minimizing user intervention. The autonomous nature of all computing stages, along with the low processing times achieved, opens the possibility of considering the system as a highly scalable service-oriented solution for on-demand DTM generation or any other geospatial process. Said solution would be a highly useful and unique service for many users in the LiDAR field, and one which could get near to real-time processing with appropriate computational resources.
- 21 February 2020
- Published by MDPI AG in Remote Sensing
- Vol. 12 (4) , 719
Open AccessBig Data Geospatial Processing for Massive Aerial LiDAR Datasets
For years, Light Detection and Ranging (LiDAR) technology has been considered as a challenge when it comes to developing efficient software to handle the extremely large volumes of data this surveying method is able to collect. In contexts such as this, big data technologies have been providing powerful solutions for distributed storage and computing. In this work, a big data approach on geospatial processing for massive aerial LiDAR point clouds is presented. By using Cassandra and Spark, our proposal is intended to support the execution of any kind of heavy time-consuming process; nonetheless, as an initial case of study, we have focused on fast ground-only rasters obtention to generate digital terrain models (DTMs) from massive LiDAR datasets. Filtered clouds obtained from the isolated processing of adjacent zones may exhibit errors located on the boundaries of the zones in the form of misclassified points. Usually, this type of error is corrected through manual or semi-automatic procedures. In this work, we also present an automated strategy for correcting errors of this type, improving the quality of the classification process and the DTMs obtained while minimizing user intervention. The autonomous nature of all computing stages, along with the low processing times achieved, opens the possibility of considering the system as a highly scalable service-oriented solution for on-demand DTM generation or any other geospatial process. Said solution would be a highly useful and unique service for many users in the LiDAR field, and one which could get near to real-time processing with appropriate computational resources.
- Open Access
- 13 September 2019
- Published by Wiley in Ecology and Evolution
- Vol. 9 (19) , 10903-10915
Analysis of interval‐grouped data in weed science: The binnednp Rcpp package
Weed scientists are usually interested in the study of the distribution and density functions of the random variable that relates weed emergence with environmental indices like the hydrothermal time (HTT). However, in many situations, experimental data are presented in a grouped way and, therefore, the standard nonparametric kernel estimators cannot be computed. Kernel estimators for the density and distribution functions for interval‐grouped data, as well as bootstrap confidence bands for these functions, have been proposed and implemented in the binnednp package. Analysis with different treatments can also be performed using a bootstrap approach and a Cramér‐von Mises type distance. Several bandwidth selection procedures were also implemented. This package also allows to estimate different emergence indices that measure the shape of the data distribution. The values of these indices are useful for the selection of the soil depth at which HTT should be measured which, in turn, would maximize the predictive power of the proposed methods. This paper presents the functions of the package and provides an example using an emergence data set of Avena sterilis (wild oat). The binnednp package provides investigators with a unique set of tools allowing the weed science research community to analyze interval‐grouped data.
- 13 September 2019
- Published by Wiley in Ecology and Evolution
- Vol. 9 (19) , 10903-10915
Open AccessAnalysis of interval‐grouped data in weed science: The binnednp Rcpp package
Weed scientists are usually interested in the study of the distribution and density functions of the random variable that relates weed emergence with environmental indices like the hydrothermal time (HTT). However, in many situations, experimental data are presented in a grouped way and, therefore, the standard nonparametric kernel estimators cannot be computed. Kernel estimators for the density and distribution functions for interval‐grouped data, as well as bootstrap confidence bands for these functions, have been proposed and implemented in the binnednp package. Analysis with different treatments can also be performed using a bootstrap approach and a Cramér‐von Mises type distance. Several bandwidth selection procedures were also implemented. This package also allows to estimate different emergence indices that measure the shape of the data distribution. The values of these indices are useful for the selection of the soil depth at which HTT should be measured which, in turn, would maximize the predictive power of the proposed methods. This paper presents the functions of the package and provides an example using an emergence data set of Avena sterilis (wild oat). The binnednp package provides investigators with a unique set of tools allowing the weed science research community to analyze interval‐grouped data.
- Open Access
- 8 August 2019
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 45 (3) , 1-26
Tree Partitioning Reduction
Solving tridiagonal linear-equation systems is a fundamental computing kernel in a wide range of scientific and engineering applications, and its computation can be modeled with parallel algorithms. These parallel solvers are typically designed to compute problems whose data fit in a common shared-memory space where all the cores taking part in the computation have access. However, when the problem size is large, data cannot be entirely stored in the common shared-memory space, and a high number of high-latency communications are performed. One alternative is to partition the problem among different memory spaces. At this point, conventional parallel algorithms do not facilitate the partition of computation in independent tiles, since each reduction depends on equations that may be in different tiles. This article proposes an algorithm based on a tree reduction, called the Tree Partitioning Reduction (TPR) method, which partitions the problem into independent slices that can be partially computed in parallel within different common shared-memory spaces. The TPR method can be implemented for any parallel and distributed programming paradigm. Furthermore, in this work, TPR is efficiently implemented for CUDA GPUs to solve large size problems, providing highly competitive performance results with respect to existing packages, being, on average, 22.03× faster than CUSPARSE.
- 8 August 2019
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 45 (3) , 1-26
Open AccessTree Partitioning Reduction
Solving tridiagonal linear-equation systems is a fundamental computing kernel in a wide range of scientific and engineering applications, and its computation can be modeled with parallel algorithms. These parallel solvers are typically designed to compute problems whose data fit in a common shared-memory space where all the cores taking part in the computation have access. However, when the problem size is large, data cannot be entirely stored in the common shared-memory space, and a high number of high-latency communications are performed. One alternative is to partition the problem among different memory spaces. At this point, conventional parallel algorithms do not facilitate the partition of computation in independent tiles, since each reduction depends on equations that may be in different tiles. This article proposes an algorithm based on a tree reduction, called the Tree Partitioning Reduction (TPR) method, which partitions the problem into independent slices that can be partially computed in parallel within different common shared-memory spaces. The TPR method can be implemented for any parallel and distributed programming paradigm. Furthermore, in this work, TPR is efficiently implemented for CUDA GPUs to solve large size problems, providing highly competitive performance results with respect to existing packages, being, on average, 22.03× faster than CUSPARSE.
- 28 November 2018
- Published by Taylor & Francis in International Journal of Geographical Information Science
- Vol. 33 (3) , 593-617
Supporting multi-resolution out-of-core rendering of massive LiDAR point clouds through non-redundant data structures
In recent years, the evolution and improvement of LiDAR (Light Detection and Ranging) hardware has increased the quality and quantity of the gathered data, making the storage, processing and management thereof particularly challenging. In this work we present a novel, multi-resolution, out-of-core technique, used for web-based visualization and implemented through a non-redundant, data point organization method, which we call Hierarchically Layered Tiles (HLT), and a tree-like structure called Tile Grid Partitioning Tree (TGPT). The design of these elements is mainly focused on attaining very low levels of memory consumption, disk storage usage and network traffic on both, client and server-side, while delivering high-performance interactive visualization of massive LiDAR point clouds (up to 28 billion points) on multiplatform environments (mobile devices or desktop computers). HLT and TGPT were incorporated and tested in ViLMA (Visualization for LiDAR data using a Multi-resolution Approach), our own web-based visualization software specially designed to work with massive LiDAR point clouds.
- 28 November 2018
- Published by Taylor & Francis in International Journal of Geographical Information Science
- Vol. 33 (3) , 593-617
Supporting multi-resolution out-of-core rendering of massive LiDAR point clouds through non-redundant data structures
In recent years, the evolution and improvement of LiDAR (Light Detection and Ranging) hardware has increased the quality and quantity of the gathered data, making the storage, processing and management thereof particularly challenging. In this work we present a novel, multi-resolution, out-of-core technique, used for web-based visualization and implemented through a non-redundant, data point organization method, which we call Hierarchically Layered Tiles (HLT), and a tree-like structure called Tile Grid Partitioning Tree (TGPT). The design of these elements is mainly focused on attaining very low levels of memory consumption, disk storage usage and network traffic on both, client and server-side, while delivering high-performance interactive visualization of massive LiDAR point clouds (up to 28 billion points) on multiplatform environments (mobile devices or desktop computers). HLT and TGPT were incorporated and tested in ViLMA (Visualization for LiDAR data using a Multi-resolution Approach), our own web-based visualization software specially designed to work with massive LiDAR point clouds.