Brunno Figueiroa Goldstein

Brunno Figueiroa Goldstein

Auto-generated profile, based on publicly available information

Brunno Figueiroa Goldstein

Universidade Federal do Rio de Janeiro

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
28 April 2021 in IEEE Journal on Emerging and Selected Topics in Circuits and Systems
Verified
Journal Article
Closed access
BGBrunno F. Goldstein
Brunno F. Goldstein
VPVinay C Patil
Vinay C Patil
VFVictor C. Ferreira
Victor C. Ferreira
ANAlexandre S. Nery
Alexandre S. Nery
FFFelipe M. G. Franca
Felipe M. G. Franca
SKSandip Kundu
Sandip Kundu
Training accurate deep learning (DL) models require large amounts of training data, significant work in labeling the data, considerable computing resources, and substantial domain expertise. In short, they are expensive to develop. Hence, protecting these models, which are valuable storehouses of intellectual properties (IP), against model stealing/cloning attacks is of paramount importance. Today's mobile processors feature Neural Processing Units (NPUs) to accelerate the execution of DL models. DL models executing on NPUs are vulnerable to hyperparameter extraction via side-channel attacks and model parameter theft via bus monitoring attacks. This paper presents a novel solution to defend against DL IP theft in NPUs during model distribution and deployment/execution via lightweight, keyed model obfuscation scheme. Unauthorized use of such models results in inaccurate classification. In addition, we present an ideal end-to-end deep learning trusted system composed of: 1) model distribution via hardware root-of-trust and public-key cryptography infrastructure (PKI) and 2) model execution via low-latency memory encryption. We demonstrate that our proposed obfuscation solution achieves IP protection objectives without requiring specialized training or sacrificing the model's accuracy. In addition, the proposed obfuscation mechanism preserves the output class distribution while degrading the model's accuracy for unauthorized parties, covering any evidence of a hacked model.

1 February 2020
Verified
Conference Paper
Closed access
BGBrunno F. Goldstein
Brunno F. Goldstein
SSSudarshan Srinivasan
Sudarshan Srinivasan
DDDipankar Das
Dipankar Das
KBKunal Banerjee
Kunal Banerjee
LSLeandro Santiago
Leandro Santiago
FFFelipe M. G. Franca
Felipe M. G. Franca
Neural networks are becoming deeper and more complex, making it harder to store and process such applications on systems with limited resources. Model pruning and data quantization are two effective ways to simplify the necessary hardware by compressing the network with relevant-only nodes and reducing the required data precision. Such optimizations, however, might come at a cost of reliability since critical nodes are now more exposed to faults and the network is more sensitive to small changes. In this work, we present an extensive empirical investigation of transient faults on compressed deep convolutional neural networks (CNNs). We evaluate the impact of a single bit flip over three CNN models with different sparsity configurations and integer-only quantizations. We show that pruning can increase the resilience of the system by 9x when compared to the dense model. Quantization can outperform the 32-bit floating-point baseline by adding 27.4x more resilience to the overall network and up to 108.7x when combined with pruning. This makes model compression an effective way to provide resilience to deep learning workloads during inference, mitigating the need for explicit error correction hardware.

1 October 2014
Verified
Conference Paper
Closed access
TATiago A.O. Alves
Tiago A.O. Alves
BGBrunno F. Goldstein
Brunno F. Goldstein
FFFelipe M.G. Franca
Felipe M.G. Franca
LMLeandro A.J. Marzulo
Leandro A.J. Marzulo
Current work on parallel programming models are trending towards the dataflow paradigm. Previous works on that topic have shown that dataflow programming is indeed a natural way to exploit parallelism in programs. However, there is still a gap in terms of ease of programming between high level languages adopted by the scientific community and the languages and tools available for dataflow programming. In this paper we present Sucuri: a minimalistic Python library that provides dataflow programming with reasonably simple syntax. To parallelize applications using our library, the programmer needs only to identify functions of his code that are good candidates for parallelization and instantiate a dataflow graph where each node is associated with one of such functions, and the edges between nodes describe data dependencies between functions. We then proceed to implement two benchmarks that represent important parallel programming patterns using our library and execute them on a cluster of multicores. Experimental results are promising, proving that our library can be an interesting first option for parallelization.

1 May 2019
Verified
Conference Paper
Closed access
VFVictor C. Ferreira
Victor C. Ferreira
ANAlexandre S. Nery
Alexandre S. Nery
LMLeandro A. J. Marzulo
Leandro A. J. Marzulo
LSLeandro Santiago
Leandro Santiago
DSDiego Souza
Diego Souza
VAVladimir Alves
Vladimir Alves
AI applications have recently driven the computer architecture industry towards novel and more efficient dedicated hardware accelerators and tools. Weightless Neural Networks (WNNs) is a class of Artificial Neural Networks (ANNs) often applied to pattern recognition problems. It uses a set of Random Access Memories (RAMs) as the main mechanism for training and classifying information regarding a given input pattern. Due to its memory-based architecture, it can be easily mapped onto hardware and also greatly accelerated by means of a dedicated Register Transfer-Level (RTL) architecture designed to enable multiple memory accesses in parallel. On the other hand, a straightforward WNN hardware implementation requires too much memory resources for both ASIC and FPGA variants. This work aims at designing and evaluating a Weightless Neural accelerator designed in High-Level Synthesis (HLS). Our WNN accelerator implements Hash Tables, instead of regular RAMs, to substantially reduce its memory requirements, so that it can be implemented in a fairly small-sized Xilinx FPGA. Performance, circuit-area and power consumption results show that our accelerator can efficiently learn and classify the MNIST dataset in about 8 times faster than the system's embedded ARM processor.

1 October 2016
Verified
Conference Paper
Closed access
RSRafael J.N. Silva
Rafael J.N. Silva
BGBrunno Goldstein
Brunno Goldstein
LSLeandro Santiago
Leandro Santiago
ASAlexandre C. Sena
Alexandre C. Sena
LMLeandro A.J. Marzulo
Leandro A.J. Marzulo
FFFelipe M.G. Franca
Felipe M.G. Franca
Sucuri is a minimalistic Python library that provides dataflow programming through a reasonably simple syntax. It allows transparent execution on computer clusters and natural exploitation of parallelism. In Sucuri, programmers instantiate a dataflow graph, where each node is assigned to a function and edges represent data dependencies between nodes. The original implementation of Sucuri adopts a centralized scheduler, which incurs high communication overheads, specially in clusters with a large number of machines. In this paper we modify Sucuri so that each machine in a cluster will have its own scheduler. Before execution, the dataflow graph is partitioned, so that nodes can be distributed among the machines of the cluster. In runtime, idle workers will grab tasks from a ready queue in their local scheduler. Experimental results confirm that the solution can reduce communication overheads, improving performance in larger clusters.

1 May 2019
Verified
Conference Paper
Closed access
LMLeandro Marzulo
Leandro Marzulo
CBCalebe Bianchini
Calebe Bianchini
LSLeandro Santiago
Leandro Santiago
VFVictor Ferreira
Victor Ferreira
BGBrunno Goldstein
Brunno Goldstein
FFFelipe Franca
Felipe Franca
Parallel and distributed programming is essential for exploiting the processing power of modern computing platforms. However, during the first years of a Computer Science course, students usually learn problem solving techniques, data structures and programming paradigms that are inherently sequential, hindering the transition to parallel architectures. Parallel Programming Marathons organized in Brazil are similar to other Programming Competitions around the world and have been used for teaching and stimulating undergraduate and graduate students into learning to "think in parallel" and to develop applications for different parallel architectures, including multicores, clusters and accelerators. This paper presents the structure of this Parallel Programming Marathon and an overview of how it supports regional and national contests. Also, this work presents use cases on Parallel and Distributed Computing course from two different Brazilian universities that use a challenge based learning approach and employ marathon problems as course assignments. This approach contributed to increase students' interest towards High Performance Computing.