Sairo Raoní dos Santos
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
Sairo Raoní dos Santos has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Marco Antonio Zanata Alves
Federal University of Paraná (UFPR)
4 shared publications - Paulo Cesar Santos
Institute of Informatics, Federal University of Rio Grande do Sul, Porto Alegre, Brazil
2 shared publications - Aline S. Cordeiro1 shared publication
- Francis Birck Moreira
UFPR
1 shared publication - Luigi Carro
Informatics Institute - Federal University of Rio Grande do Sul - Porto Alegre
1 shared publication Marco Antonio Zanata Alves
Federal University of Parana
1 shared publication
Latest Publications
- 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.
- Open Access
- 7 July 2022
- Published by Springer Nature in Research Square
Improved Computation of Database Operators via Vector Processing Near-Data
Data-centric applications are increasingly more common, causing issues brought on by the discrepancy between processorand memory technologies to be increasingly more apparent. Near-Data Processing (NDP) is an approach to mitigate this issue. It proposes moving some of the computation close to the memory, thus allowing for reduced data movement and aiding data-intensive workloads. Analytical database queries are very commonly used in NDP research due to their intrinsics usage of very large volumes of data. In this paper, we investigate the migration of most time-consuming database operators to VIMA, a novel 3D-stacked memory-based NDP architecture. We consider the selection, projection, and bloom join database query operators, commonly used by data analytics applications, comparing Vector-In-Memory Architecture (VIMA) to a high-performance x86 baseline. We pitch VIMA against both a single-thread baseline and a modern 16-thread x86 system to evaluate its performance. Against a single-thread baseline, our experiments show that VIMA is able to speed up execution by up to 5× for selection, 2.5× for projection, and 16× for join while consumingup to 99% less energy. When considering a multi-thread baseline, VIMA matches the execution time performance even at the largest dataset sizes considered. In comparison to existing state-of-the-art NDP platforms, we find that our approach achieves superior performance for these operators.
- 7 July 2022
- Published by Springer Nature in Research Square
Open AccessImproved Computation of Database Operators via Vector Processing Near-Data
Data-centric applications are increasingly more common, causing issues brought on by the discrepancy between processorand memory technologies to be increasingly more apparent. Near-Data Processing (NDP) is an approach to mitigate this issue. It proposes moving some of the computation close to the memory, thus allowing for reduced data movement and aiding data-intensive workloads. Analytical database queries are very commonly used in NDP research due to their intrinsics usage of very large volumes of data. In this paper, we investigate the migration of most time-consuming database operators to VIMA, a novel 3D-stacked memory-based NDP architecture. We consider the selection, projection, and bloom join database query operators, commonly used by data analytics applications, comparing Vector-In-Memory Architecture (VIMA) to a high-performance x86 baseline. We pitch VIMA against both a single-thread baseline and a modern 16-thread x86 system to evaluate its performance. Against a single-thread baseline, our experiments show that VIMA is able to speed up execution by up to 5× for selection, 2.5× for projection, and 16× for join while consumingup to 99% less energy. When considering a multi-thread baseline, VIMA matches the execution time performance even at the largest dataset sizes considered. In comparison to existing state-of-the-art NDP platforms, we find that our approach achieves superior performance for these operators.
- 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.
- 22 January 2022
- Published by Elsevier in Microprocessors and Microsystems
- Vol. 90
Efficient Machine Learning execution with Near-Data Processing
- 22 January 2022
- Published by Elsevier in Microprocessors and Microsystems
- Vol. 90
Efficient Machine Learning execution with Near-Data Processing