Michael Canesche

Michael Canesche

Auto-generated profile, based on publicly available information

Michael Canesche

Computer Science Department Universidade Federal de Minas Gerais Belo Horizonte Brazil

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
21 September 2020 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
MCMichael Canesche
Michael Canesche
MMMarcelo Menezes
Marcelo Menezes
WCWesterley Carvalho
Westerley Carvalho
FTFrank Sill Torres
Frank Sill Torres
PJPeter Jamieson
Peter Jamieson
RFRicardo Ferreira
Ricardo Ferreira
Coarse Grain Reconfigurable Architectures (CGRAs) are an emerging hybrid computational architecture that has the parallel customization benefits of low-level logic devices such as FPGAs and ASICs, while the relative coarseness of these architectures makes CGRAs easier to design for, which is more similar to the traditional processor. In the process of mapping designs to CGRAs, flexible, fast, and adaptive Placement and Routing (P&R) is fundamental in order to implement efficient run-time reconfigurable frameworks. It is well-known that P&R is an NP-complete problem, and thus, solutions rely on heuristics to achieve quality results with acceptable execution times. CGRA P&R has different constraints compared to traditional VLSI P&R, e.g. path latency balancing and modulo scheduling of loops. In this work, we propose a graph-based P&R approach that uses graph traversals to map designs to CGRAs. Additionally, we parallelize our approach with a graph-based greedy heuristic that executes on a GPU. We compare our proposed P&R approach with the CGRA-ME framework, which implements Simulated Annealing and Integer Linear Programming placement algorithms. Our results show that this new approach can generate optimal mappings and improve the execution run-time up to several orders of magnitude. Furthermore, considering spatial mapping at the millisecond scale, our GPU approach is one order of magnitude faster compared to the state-of-the-art tool VPR.

29 February 2024 in Computer Applications in Engineering Education
Verified
Journal Article
Closed access
RFRicardo Ferreira
Ricardo Ferreira
MCMichael Canesche
Michael Canesche
PJPeter Jamieson
Peter Jamieson
ONOmar P. Vilela Neto
Omar P. Vilela Neto
JNJose Augusto M. Nacif
Jose Augusto M. Nacif

2 February 2024 in Internet of Things
Verified
Journal Article
Closed access
RFRicardo Ferreira
Ricardo Ferreira
CSCarlos Sabino
Carlos Sabino
MCMichael Canesche
Michael Canesche
ONOmar Paranaiba V. Neto
Omar Paranaiba V. Neto
JNJose Augusto M. Nacif
Jose Augusto M. Nacif

7 October 2019 in ACM Transactions on Embedded Computing Systems
Verified
Journal Article
Open access
PDF file
LSLucas Bragança Da Silva
Lucas Bragança Da Silva
RFRicardo Ferreira
Ricardo Ferreira
MCMichael Canesche
Michael Canesche
MMMarcelo M. Menezes
Marcelo M. Menezes
MVMaria D. Vieira
Maria D. Vieira
JNJose Augusto M. Nacif
Jose Augusto M. Nacif
In this work, we propose a framework called REconfigurable Accelerator DeploY (READY), the first framework to support polynomial runtime mapping of dataflow applications in high-performance CPU-FPGA platforms. READY introduces an efficient mapping with fine-grained multithreading onto an overlay architecture that hides the latency of a global interconnection network. In addition to our overlay architecture, we show how this system helps solve some of the challenges for FPGA cloud computing adoption in high-performance computing. The framework encapsulates dataflow descriptions by using a target independent, high-level API, and a dataflow model that allows for explicit spatial and temporal parallelism. READY directly maps the dataflow kernels onto the accelerator. Our tool is flexible and extensible and provides the infrastructure to explore different accelerator designs. We validate READY on the Intel Harp platform, and our experimental results show an average 2x execution runtime improvement when compared to an 8-thread multi-core processor.

26 June 2023 in ACM Transactions on Programming Languages and Systems
Verified
Journal Article
Open access
LSLuigi Soares
Luigi Soares
MCMichael Canesche
Michael Canesche
FPFernando Magno Quintão Pereira
Fernando Magno Quintão Pereira
Partial control-flow linearization is a code transformation conceived to maximize work performed in vectorized programs. In this article, we find a new service for it. We show that partial control-flow linearization protects programs against timing attacks. This transformation is sound: Given an instance of its public inputs, the partially linearized program always runs the same sequence of instructions, regardless of secret inputs. Incidentally, if the original program is publicly safe, then accesses to the data cache will be data oblivious in the transformed code. The transformation is optimal: Every branch that depends on some secret data is linearized; no branch that depends on only public data is linearized. Therefore, the transformation preserves loops that depend exclusively on public information. If every branch that leaves a loop depends on secret data, then the transformed program will not terminate. Our transformation extends previous work in non-trivial ways. It handles C constructs such as “goto,” “break,” “switch,” and “continue,” which are absent in the FaCT domain-specific language (2018). Like Constantine (2021), our transformation ensures operation invariance but without requiring profiling information. Additionally, in contrast to SC-Eliminator (2018) and Lif (2021), it handles programs containing loops whose trip count is not known at compilation time.

6 May 2023
Verified
Conference Paper
Open access
PDF file
RFRicardo Ferreira
Ricardo Ferreira
MCMichael Canesche
Michael Canesche
JPJerônimo Penha
Jerônimo Penha
Este minicurso teórico-prático tem como objetivo a introdução ao uso do Google Colab como uma ferramenta de ensino à distância e/ou atividades práticas síncronas ou assíncronas em aula presencial ou remotas na Educação em Computação. Tradicionalmente, o Google Colab vem sendo usado no ensino de inteligência artificial e aprendizado de máquina. O minicurso irá apresentar aos participantes vários exemplos, ideias e metodologias para uso em qualquer disciplina. Mostrando como usar outras linguagens além de Python, como inserir outras ferramentas de ensino, criação de comandos mágicos para simplificar o uso, interfaces interativas, interação com smartphones com o uso da biblioteca Gradio. Os exemplos utilizados no minicurso ilustrarão o ensino de arquitetura de computadores, programação de alto desempenho com GPU, linguagens formais e autômatos, grafos, linguagens de programação e programação de computadores.