Leonardo G. Faé

Leonardo G. Faé

Auto-generated profile, based on publicly available information

Leonardo G. Faé

PUC-RS, Porto Alegre, Brazil

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 September 2023
Verified
Conference Paper
Open access
LFLeonardo G. Faé
Leonardo G. Faé
RHRenato B. Hoffman
Renato B. Hoffman
DGDalvan Griebler
Dalvan Griebler
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.

1 March 2025
Verified
Conference Paper
Open access
RHRenato B. Hoffmann
Renato B. Hoffmann
LFLeonardo G. Faé
Leonardo G. Faé
DGDalvan Griebler
Dalvan Griebler
XLXinliang David Li
Xinliang David Li
FPFernando Magno Quintão Pereira
Fernando Magno Quintão Pereira
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.