Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Erick Carvajal Barboza

dblp:241/4279 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
2since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3 · 2 first-author · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Electronic design automation · 60% Performance modeling and evaluation · 40%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation
benchmarking
0.512021
Automatic Microprocessor Performance Bug Detection · HPCA 2021
Performance modeling and evaluation › performance diagnosis
performance bug detection
0.512021
Automatic Microprocessor Performance Bug Detection · HPCA 2021
Electronic design automation
design optimization
0.412019
Machine Learning-Based Pre-Routing Timing Prediction with Reduced Pessimism · DAC 2019
Electronic design automation
physical design
0.412019
Machine Learning-Based Pre-Routing Timing Prediction with Reduced Pessimism · DAC 2019
Electronic design automation › timing prediction
pre-routing timing prediction
0.412019
Machine Learning-Based Pre-Routing Timing Prediction with Reduced Pessimism · DAC 2019
Electronic design automation
timing prediction
0.412019
Machine Learning-Based Pre-Routing Timing Prediction with Reduced Pessimism · DAC 2019

Methods — techniques the papers use, named apart from their topics

machine learning-based bug detection · 0.5machine learning · 0.4
YearPublicationVenuePosition
2024 Aiding Microprocessor Performance Validation with Machine Learning
abstract
Microprocessor validation is a complex task that consumes substantial engineering time. Degradation of the system performance that does not affect its functional correctness, is particularly difficult to address given the lack of a golden reference for performance. This work introduces an automated methodology based on machine learning to assist in localizing performance faults, aiming to speed up the validation process. Our results show that, for the injected performance issues, whose average IPC impact is$> 1{\%}$, our technique is able to help localize the exact microarchitectural unit where the degradation occurs$\sim$75% of the time while achieving a top-3 unit accuracy (out of 11 possible locations) of$> 97{\%}$. The proposed setup requires a few seconds to perform a localization inference, leading to a reduced validation time.
Erick Carvajal Barboza, Mahesh Ketkar, Paul Gratz, Jiang Hu 0001
ISPASS1
2021 Automatic Microprocessor Performance Bug Detection
abstract
Processor design validation and debug is a difficult and complex task, which consumes the lion's share of the design process. Design bugs that affect processor performance rather than its functionality are especially difficult to catch, particularly in new microarchitectures. This is because, unlike functional bugs, the correct processor performance of new microarchitectures on complex, long-running benchmarks is typically not deterministically known. Thus, when performance benchmarking new microarchitectures, performance teams may assume that the design is correct when the performance of the new microarchitecture exceeds that of the previous generation, despite significant performance regressions existing in the design. In this work we present a two-stage, machine learning-based methodology that is able to detect the existence of performance bugs in microprocessors. Our results show that our best technique detects 91.5% of microprocessor core performance bugs whose average IPC impact across the studied applications is greater than 1% versus a bug-free design with zero false positives. When evaluated on memory system bugs, our technique achieves 100% detection with zero false positives. Moreover, the detection is automatic, requiring very little performance engineer time.
Erick Carvajal Barboza, Sara Jacob, Mahesh Ketkar, Michael Kishinevsky, Paul Gratz, Jiang Hu 0001
HPCA1
2020 FIST: A Feature-Importance Sampling and Tree-Based Method for Automatic Design Flow Parameter Tuning
abstract
Design flow parameters are of utmost importance to chip design quality and require a painfully long time to evaluate their effects. In reality, flow parameter tuning is usually performed manually based on designers' experience in an ad hoc manner. In this work, we introduce a machine learning-based automatic parameter tuning methodology that aims to find the best design quality with a limited number of trials. Instead of merely plugging in machine learning engines, we develop clustering and approximate sampling techniques for improving tuning efficiency. The feature extraction in this method can reuse knowledge from prior designs. Furthermore, we leverage a state-of-the-art XGBoost model and propose a novel dynamic tree technique to overcome overfitting. Experimental results on benchmark circuits show that our approach achieves 25% improvement in design quality or 37% reduction in sampling cost compared to random forest method, which is the kernel of a highly cited previous work. Our approach is further validated on two industrial designs. By sampling less than 0.02% of possible parameter sets, it reduces area by 1.83% and 1.43% compared to the best solutions hand-tuned by experienced designers.
Zhiyao Xie, Guanqi Fang, Yu-Hung Huang, Haoxing Ren, Yanqing Zhang 0002, Brucek Khailany, Shao-Yun Fang, Jiang Hu 0001, Yiran Chen 0001, Erick Carvajal Barboza
ASP-DAC10
2019 Machine Learning-Based Pre-Routing Timing Prediction with Reduced Pessimism
abstract
Optimizations at placement stage need to be guided by timing estimation prior to routing. To handle timing uncertainty due to the lack of routing information, people tend to make very pessimistic predictions such that performance specification can be ensured in the worst case. Such pessimism causes over-design that wastes chip resources or design effort. In this work, a machine learning-based pre-routing timing prediction approach is introduced. Experimental results show that it can reach accuracy near post-routing sign-off analysis. Compared to a commercial pre-routing timing estimation tool, it reduces false positive rate by about 2/3 in reporting timing violations.
Erick Carvajal Barboza, Nishchal Shukla, Yiran Chen 0001, Jiang Hu 0001
DAC1