Marco Antonio Zanata Alves
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
Marco Antonio Zanata Alves has a total of 48 co-authors. Here are the top co-authors by number of shared publications:
- Paulo Cesar Santos
Institute of Informatics, Federal University of Rio Grande do Sul, Porto Alegre, Brazil
7 shared publications - Luigi Carro
Informatics Institute - Federal University of Rio Grande do Sul - Porto Alegre
6 shared publications - Eduardo Cunha de Almeida
Federal University of Parana
5 shared publications - Sairo Raoní dos Santos
Universidade Federal Rural do Semi-Árido
4 shared publications - Rodrigo Machniewicz Sokulski
Federal University of Paran,Department of Informatics,Curitiba,Brazil
3 shared publications - Simone Dominico
Federal University of Parana
3 shared publications
Latest Publications
- Open Access
- 18 May 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 4 (3) , 1-22
Discovery of Denial Constraints with Hardware Acceleration
Denial constraints (DCs) formalize integrity rules that keep data consistent across profiling and cleaning tasks. However, discovering DCs remains computationally expensive due to the exponential size of the predicate search space and the cost of maintaining large intermediate data structures. Existing software-based DC discovery algorithms rely on evidence set materialization, candidate enumeration, and minimality checks, resulting in superlinear runtime growth and unpredictable performance, which limits their scalability in practice. We present DCArray, an FPGA-based accelerator that performs DC discovery directly in hardware pipelines. DCArray encodes DC predicates as boolean patterns and evaluates them using highly parallel logical units, each operating within a single clock cycle. Boolean patterns are encoded in a hardware-friendly prefix-tree design, eliminating the need for intermediate evidence sets and reducing memory overhead and data movement. DCArray implements minimality checks at the circuit level, achieving predictable runtime independent of dataset distribution. Across real and synthetic datasets, DCArray achieves speedups of up to 1560x over DCFinder and up to 10x over ECP on 1M tuples, while efficiently utilizing HBM/PCIe. At the 10M-tuple scale, end-to-end performance is primarily limited by sustained host-device I/O bandwidth, making DCArray a practical alternative for production data-quality pipelines.
- 18 May 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 4 (3) , 1-22
Open AccessDiscovery of Denial Constraints with Hardware Acceleration
Denial constraints (DCs) formalize integrity rules that keep data consistent across profiling and cleaning tasks. However, discovering DCs remains computationally expensive due to the exponential size of the predicate search space and the cost of maintaining large intermediate data structures. Existing software-based DC discovery algorithms rely on evidence set materialization, candidate enumeration, and minimality checks, resulting in superlinear runtime growth and unpredictable performance, which limits their scalability in practice. We present DCArray, an FPGA-based accelerator that performs DC discovery directly in hardware pipelines. DCArray encodes DC predicates as boolean patterns and evaluates them using highly parallel logical units, each operating within a single clock cycle. Boolean patterns are encoded in a hardware-friendly prefix-tree design, eliminating the need for intermediate evidence sets and reducing memory overhead and data movement. DCArray implements minimality checks at the circuit level, achieving predictable runtime independent of dataset distribution. Across real and synthetic datasets, DCArray achieves speedups of up to 1560x over DCFinder and up to 10x over ECP on 1M tuples, while efficiently utilizing HBM/PCIe. At the 10M-tuple scale, end-to-end performance is primarily limited by sustained host-device I/O bandwidth, making DCArray a practical alternative for production data-quality pipelines.
- Open Access
- 30 May 2024
- Published by MDPI AG in Remote Sensing
- Vol. 16 (11) , 1971
Quantitative Precipitation Estimation Using Weather Radar Data and Machine Learning Algorithms for the Southern Region of Brazil
In addressing the challenges of quantitative precipitation estimation (QPE) using weather radar, the importance of enhancing the rainfall estimates for applications such as flash flood forecasting and hydropower generation management is recognized. This study employed dual-polarization weather radar data to refine the traditional Z–R relationship, which often needs higher accuracy in areas with complex meteorological phenomena. Utilizing tree-based machine learning algorithms, such as random forest and gradient boosting, this research analyzed polarimetric variables to capture the intricate patterns within the Z–R relationship. The results highlight machine learning’s potential to improve the precision of precipitation estimation, especially under challenging weather conditions. Integrating meteorological insights with advanced machine learning techniques is a remarkable achievement toward a more precise and adaptable precipitation estimation method.
- 30 May 2024
- Published by MDPI AG in Remote Sensing
- Vol. 16 (11) , 1971
Open AccessQuantitative Precipitation Estimation Using Weather Radar Data and Machine Learning Algorithms for the Southern Region of Brazil
In addressing the challenges of quantitative precipitation estimation (QPE) using weather radar, the importance of enhancing the rainfall estimates for applications such as flash flood forecasting and hydropower generation management is recognized. This study employed dual-polarization weather radar data to refine the traditional Z–R relationship, which often needs higher accuracy in areas with complex meteorological phenomena. Utilizing tree-based machine learning algorithms, such as random forest and gradient boosting, this research analyzed polarimetric variables to capture the intricate patterns within the Z–R relationship. The results highlight machine learning’s potential to improve the precision of precipitation estimation, especially under challenging weather conditions. Integrating meteorological insights with advanced machine learning techniques is a remarkable achievement toward a more precise and adaptable precipitation estimation method.
- Open Access
- 26 September 2023
- Published by Sociedade Brasileira de Computação
- p. 1-8
Evaluating Strategies to Predict Student Dropout of a Bachelor's Degree in Computer Science
The Brazilian Higher Education Census has revealed that the dropout rate among higher education students in Brazil exceeds 50% starting from the fifth year. This high rate results in several problems related to the wastage of resources invested by both the society and the students. Therefore, universities need to develop strategies to prevent student dropout and minimize these problems. However, predicting student dropout involves detecting patterns and predicting them over a large amount of data collected yearly from thousands of students. Given the scale and volume of data involved in dropout prediction, machine learning emerges as a powerful technique to automate the identification of these students. The objective of this paper is to identify students who are prone to dropping out based on the academic history of Bachelor’s Degree in Computer Science students at an unpaid public university in Brazil. We engineered four datasets based on the semester in which the students are enrolled. These datasets are designed to simulate the academic scenario and individual characteristics of the students available up to the prediction moment. Besides, we propose three feature models to identify the best scenario. Our method could identify the students most likely to drop out and the main features that contributed to the respective decision. Using only the information from the disciplines taken by the students proved to be the best feature model. When using these features with Gradient-Boosting, the F1-Score performance ranged between 69% and 85%, depending on the dataset.
- 26 September 2023
- Published by Sociedade Brasileira de Computação
- p. 1-8
Open AccessEvaluating Strategies to Predict Student Dropout of a Bachelor's Degree in Computer Science
The Brazilian Higher Education Census has revealed that the dropout rate among higher education students in Brazil exceeds 50% starting from the fifth year. This high rate results in several problems related to the wastage of resources invested by both the society and the students. Therefore, universities need to develop strategies to prevent student dropout and minimize these problems. However, predicting student dropout involves detecting patterns and predicting them over a large amount of data collected yearly from thousands of students. Given the scale and volume of data involved in dropout prediction, machine learning emerges as a powerful technique to automate the identification of these students. The objective of this paper is to identify students who are prone to dropping out based on the academic history of Bachelor’s Degree in Computer Science students at an unpaid public university in Brazil. We engineered four datasets based on the semester in which the students are enrolled. These datasets are designed to simulate the academic scenario and individual characteristics of the students available up to the prediction moment. Besides, we propose three feature models to identify the best scenario. Our method could identify the students most likely to drop out and the main features that contributed to the respective decision. Using only the information from the disciplines taken by the students proved to be the best feature model. When using these features with Gradient-Boosting, the F1-Score performance ranged between 69% and 85%, depending on the dataset.
- 18 August 2023
- Published by Springer Nature
- p. 213-227
NoGar: A Non-cooperative Game for Thread Pinning in Array Databases
- 18 August 2023
- Published by Springer Nature
- p. 213-227
NoGar: A Non-cooperative Game for Thread Pinning in Array Databases
- Open Access
- 25 July 2023
- Published by Springer Nature in Research Square
A Simple AVX to PIM Vectorizer (SAPIVe)
The growing data demands in modern applications aggravated persistent problems in computer architecture, such as the Memory Wall. Processing-In-Memory(PIM) devices emerged as an alternative to mitigate these problems, approaching processing and storage units to reduce data traffic between processors and memory. Literature and industry proposed different PIM designs and a prominent approach aims to expose memory bandwidth by placing large Single Instruction-Multiple Data (SIMD) or vector units in memory. One method to use these new processing units is runtime binary translators. Simple AVX to PIM Vectorizer(SAPIVe) provides transparency to the users and specific software independence by adopting a hardware-based binary translator to convert the application’s vector instructions to PIM instructions. In this work, the authors expand SAPIVe evaluations, explanations, and discussions, seeking to deepen the description of the mechanism and improve the understanding of its behavior and performance.
- 25 July 2023
- Published by Springer Nature in Research Square
Open AccessA Simple AVX to PIM Vectorizer (SAPIVe)
The growing data demands in modern applications aggravated persistent problems in computer architecture, such as the Memory Wall. Processing-In-Memory(PIM) devices emerged as an alternative to mitigate these problems, approaching processing and storage units to reduce data traffic between processors and memory. Literature and industry proposed different PIM designs and a prominent approach aims to expose memory bandwidth by placing large Single Instruction-Multiple Data (SIMD) or vector units in memory. One method to use these new processing units is runtime binary translators. Simple AVX to PIM Vectorizer(SAPIVe) provides transparency to the users and specific software independence by adopting a hardware-based binary translator to convert the application’s vector instructions to PIM instructions. In this work, the authors expand SAPIVe evaluations, explanations, and discussions, seeking to deepen the description of the mechanism and improve the understanding of its behavior and performance.
- 21 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
SAPIVe: Simple AVX to PIM Vectorizer
Larger vector extensions are one of the commonly used techniques to meet the growing demands from computational systems. These extensions, capable of operating over multiple data elements with a single instruction, exert a lot of pressure on the memory hierarchy, increasing the impact of growing problems such as Memory-Wall and von Neumann bottleneck. An alternative to work around these problems would be adding processing elements close to the memory, known as Processing-In-Memory (PIM). As with processor vector extensions, the most efficient PIM techniques use in-memory vector processing units. There are several ways to convert a code into in-memory vector processing, such as binary hardware translation, which may not depend on programmers or adapted software and can be carried out transparently to its users. However, in the context of in-memory processing, this conversion technique presents some challenges related to the PIM instructions format and the structure of the loops present in each application. Thus, this article proposes and evaluates Simple AVX to PIM Vectorizer (SAPIVe), a hardware binary translation mechanism from processor vector instructions into in-memory vector instructions, which, in addition to processing more data, also performs loads, operations, and stores at once. Our results show that our mechanism can accelerate kernels up to 5 times with possible performance losses prevented using loop predictors.
- 21 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
SAPIVe: Simple AVX to PIM Vectorizer
Larger vector extensions are one of the commonly used techniques to meet the growing demands from computational systems. These extensions, capable of operating over multiple data elements with a single instruction, exert a lot of pressure on the memory hierarchy, increasing the impact of growing problems such as Memory-Wall and von Neumann bottleneck. An alternative to work around these problems would be adding processing elements close to the memory, known as Processing-In-Memory (PIM). As with processor vector extensions, the most efficient PIM techniques use in-memory vector processing units. There are several ways to convert a code into in-memory vector processing, such as binary hardware translation, which may not depend on programmers or adapted software and can be carried out transparently to its users. However, in the context of in-memory processing, this conversion technique presents some challenges related to the PIM instructions format and the structure of the loops present in each application. Thus, this article proposes and evaluates Simple AVX to PIM Vectorizer (SAPIVe), a hardware binary translation mechanism from processor vector instructions into in-memory vector instructions, which, in addition to processing more data, also performs loads, operations, and stores at once. Our results show that our mechanism can accelerate kernels up to 5 times with possible performance losses prevented using loop predictors.
- 12 October 2022
- Published by Elsevier in Integration
- Vol. 88, 185-195
Plug N’ PIM: An integration strategy for Processing-in-Memory accelerators
- 12 October 2022
- Published by Elsevier in Integration
- Vol. 88, 185-195
Plug N’ PIM: An integration strategy for Processing-in-Memory accelerators
- 30 April 2022
- Published by Elsevier in Journal of Systems Architecture
- Vol. 128, 102528
Sim 2 PIM: A complete simulation framework for Processing-in-Memory
- 30 April 2022
- Published by Elsevier in Journal of Systems Architecture
- Vol. 128, 102528
Sim 2 PIM: A complete simulation framework for Processing-in-Memory
- Open Access
- 18 April 2022
- Published by Sociedade Brasileira de Computação
- p. 99-100
Proposta de conversão automática em hardware de instruções para execução em memória
Uma das possíveis soluções para problemas como o Memory wall e o Gargalo de von Neumann consiste na adição de unidades de processamento próximas à memória, técnica denominada Processing-In-Memory (PIM). Este documento apresenta nossa proposta de trabalho, uma extensão de hardware para a conversão dinâmica de instruções para o processamento vetorial em memória. Uma das possíveis soluções para problemas como o Memory wall e o Gargalo de von Neumann consiste na adição de unidades de processamento próximas à memória, técnica denominada Processing-In-Memory (PIM). Este documento apresenta nossa proposta de trabalho, uma extensão de hardware para a conversão dinâmica de instruções para o processamento vetorial em memória.
- 18 April 2022
- Published by Sociedade Brasileira de Computação
- p. 99-100
Open AccessProposta de conversão automática em hardware de instruções para execução em memória
Uma das possíveis soluções para problemas como o Memory wall e o Gargalo de von Neumann consiste na adição de unidades de processamento próximas à memória, técnica denominada Processing-In-Memory (PIM). Este documento apresenta nossa proposta de trabalho, uma extensão de hardware para a conversão dinâmica de instruções para o processamento vetorial em memória. Uma das possíveis soluções para problemas como o Memory wall e o Gargalo de von Neumann consiste na adição de unidades de processamento próximas à memória, técnica denominada Processing-In-Memory (PIM). Este documento apresenta nossa proposta de trabalho, uma extensão de hardware para a conversão dinâmica de instruções para o processamento vetorial em memória.
- Open Access
- 18 April 2022
- Published by Sociedade Brasileira de Computação
- p. 109-110
Impacto da Largura do Vetor de Instruções SIMD em Arquiteturas de Processamento Próximo à Memória
Instruções Single Instruction Multiple Data (SIMD) processam múltiplos elementos de dados por vez e podem ser usadas para explorar o paralelismo no acesso aos dados oferecido pelas tecnologias de memória principal. Neste trabalho, discute-se como a largura do vetor usado nessas instruções impacta o desempenho em arquiteturas de processamento próximo à memória. Instruções Single Instruction Multiple Data (SIMD) processam múltiplos elementos de dados por vez e podem ser usadas para explorar o paralelismo no acesso aos dados oferecido pelas tecnologias de memória principal. Neste trabalho, discute-se como a largura do vetor usado nessas instruções impacta o desempenho em arquiteturas de processamento próximo à memória.
- 18 April 2022
- Published by Sociedade Brasileira de Computação
- p. 109-110
Open AccessImpacto da Largura do Vetor de Instruções SIMD em Arquiteturas de Processamento Próximo à Memória
Instruções Single Instruction Multiple Data (SIMD) processam múltiplos elementos de dados por vez e podem ser usadas para explorar o paralelismo no acesso aos dados oferecido pelas tecnologias de memória principal. Neste trabalho, discute-se como a largura do vetor usado nessas instruções impacta o desempenho em arquiteturas de processamento próximo à memória. Instruções Single Instruction Multiple Data (SIMD) processam múltiplos elementos de dados por vez e podem ser usadas para explorar o paralelismo no acesso aos dados oferecido pelas tecnologias de memória principal. Neste trabalho, discute-se como a largura do vetor usado nessas instruções impacta o desempenho em arquiteturas de processamento próximo à memória.