Leonardo G. Faé
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Leonardo G. Faé has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Dalvan Griebler
Pontifical Catholic University of Rio Grande do Sul (PUCRS)
2 shared publications - Renato B. Hoffmann
PUCRS
2 shared publications - Fernando Magno Quintão Pereira
Federal University of Minas Gerais, Belo Horizonte, Brazil
1 shared publication - Xinliang David Li
Google, Mountain View, USA
1 shared publication
Latest Publications
- Open Access
- 1 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 317-330
Automatic Synthesis of Specialized Hash Functions
This paper introduces a technique for synthesizing hash functions specialized to particular byte formats. This code generation method leverages three prevalent patterns: (i) fixed-length keys, (ii) keys with common subsequences, and (iii) keys ranging on predetermined sequences of bytes. Code generation involves two algorithms: one identifies relevant regular expressions within key examples, and the other generates specialized hash functions based on these expressions. Comparative analysis demonstrates that the synthetic functions outperform the general-purpose hashes in the C++ Standard Template Library and the Google Abseil Library when keys are given in ascending, normal or uniform distribution. In applications where low-mixing hashes are acceptable, the synthetic functions achieve speedups ranging from 2% to 11% on full benchmarks, and speedups of almost 50x once only hashing speed is considered.
- 1 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 317-330
Open AccessAutomatic Synthesis of Specialized Hash Functions
This paper introduces a technique for synthesizing hash functions specialized to particular byte formats. This code generation method leverages three prevalent patterns: (i) fixed-length keys, (ii) keys with common subsequences, and (iii) keys ranging on predetermined sequences of bytes. Code generation involves two algorithms: one identifies relevant regular expressions within key examples, and the other generates specialized hash functions based on these expressions. Comparative analysis demonstrates that the synthetic functions outperform the general-purpose hashes in the C++ Standard Template Library and the Google Abseil Library when keys are given in ascending, normal or uniform distribution. In applications where low-mixing hashes are acceptable, the synthetic functions achieve speedups ranging from 2% to 11% on full benchmarks, and speedups of almost 50x once only hashing speed is considered.
- Open Access
- 25 September 2023
- Published by Association for Computing Machinery (ACM)
- p. 41-49
Source-to-Source Code Transformation on Rust for High-Level Stream Parallelism
Utilizing parallel systems to their full potential can be challenging for general-purpose developers. A solution to this problem is to create high-level abstractions using Domain-Specific Languages (DSL). We create a stream-processing DSL for Rust, a growing programming language focusing on performance and safety. To that end, we explore Rust’s macros as a high-level abstraction tool to support an existing DSL language named SPar and perform source-to-source code transformations in the abstract syntax tree. We aim to assess the Rust source-to-source code transformations toolset and its implications. We highlight that Rust macros are powerful tools for performing source-to-source code transformations for abstracting structured stream processing. In addition, execution time and programmability results are comparable to other solutions.
- 25 September 2023
- Published by Association for Computing Machinery (ACM)
- p. 41-49
Open AccessSource-to-Source Code Transformation on Rust for High-Level Stream Parallelism
Utilizing parallel systems to their full potential can be challenging for general-purpose developers. A solution to this problem is to create high-level abstractions using Domain-Specific Languages (DSL). We create a stream-processing DSL for Rust, a growing programming language focusing on performance and safety. To that end, we explore Rust’s macros as a high-level abstraction tool to support an existing DSL language named SPar and perform source-to-source code transformations in the abstract syntax tree. We aim to assess the Rust source-to-source code transformations toolset and its implications. We highlight that Rust macros are powerful tools for performing source-to-source code transformations for abstracting structured stream processing. In addition, execution time and programmability results are comparable to other solutions.