Kirvy Teo

dblp:158/8139 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2016
—ORCID · none

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

Systems, architecture and hardware · 4

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 · 95% Reconfigurable computing and FPGAs · 5%

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

TopicWeightPapersLastEvidence papers
Electronic design automation
design space exploration
0.522016
Case for Design-Specific Machine Learning in Timing Closure of FPGA Designs · FPGA 2016
InTime: A Machine Learning Approach for Efficient Selection of FPGA CAD Tool Parameters · FPGA 2015
Electronic design automation › physical design
timing optimization
0.322016
Case for Design-Specific Machine Learning in Timing Closure of FPGA Designs · FPGA 2016
InTime: A Machine Learning Approach for Efficient Selection of FPGA CAD Tool Parameters · FPGA 2015
Electronic design automation › machine learning for EDA
design tool parameter tuning
0.212016
Case for Design-Specific Machine Learning in Timing Closure of FPGA Designs · FPGA 2016
Electronic design automation › machine learning for EDA
machine learning-based tuning
0.212015
InTime: A Machine Learning Approach for Efficient Selection of FPGA CAD Tool Parameters · FPGA 2015
Reconfigurable computing and FPGAs
FPGA design flow
0.112015
InTime: A Machine Learning Approach for Efficient Selection of FPGA CAD Tool Parameters · FPGA 2015

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

machine learning · 0.5cloud computing · 0.2classifier models · 0.2statistical sampling · 0.2
YearPublicationVenuePosition
2016 Improving Classification Accuracy of a Machine Learning Approach for FPGA Timing Closure
abstract
We can use Cloud Computing and Machine Learning to help deliver timing closure of FPGA designs using InTime [2], [3]. This approach requires no modification to the input RTL and relies exclusively on manipulating the CAD tool parameters that drive the optimization heuristics. By running multiple combinations of the parameters in parallel, we learn from results and identify which parameters caused an improvement in the final results. By systematically building a classification model and training it with the results of the parallel CAD runs, we can build an accurate estimation flow for helping identify which parameters are more likely to improve the timing. In this paper, we consider strategies for improving the predictive accuracy of our classifier models to help guide the CAD run towards timing convergence. With ensemble learning we are able to increase average AUC score from 0.74 to 0.79, which could also translate into 2.7× savings in machine learning effort.
Que Yanghua, Nachiket Kapre, Harnhua Ng, Kirvy Teo
FCCM4
2016 Case for Design-Specific Machine Learning in Timing Closure of FPGA Designs
abstract
We can achieve reliable timing closure of FPGA designs using machine learning heuristics to generate input parameter settings for FPGA CAD tools. This is enabled by running multiple instances of CAD tool with different sets of these input parameters and logging of resulting timing slack values into a database. We incrementally build this database and run learning routines to develop suitable classifier models that correlate input parameter combinations to resulting slack. As each CAD run in independent, we can trivially parallelize our exploration. The classifier model developed using this approach can help predict whether a given combination of tool parameters will improve the timing score of that particular FPGA design. Through repeated trials and use of cheap cloud computing resources, we are able to reliably improve timing scores for a variety of industrial and academic FPGA designs. We show how to build design-specific classifier models that easily outperform generic models that are trained by combining results across all circuits in a benchmark.
Que Yanghua, Chinnakkannu Adaikkala Raj, Harnhua Ng, Kirvy Teo, Nachiket Kapre
FPGA4
2015 Driving Timing Convergence of FPGA Designs through Machine Learning and Cloud Computing
abstract
Machine learning and cloud computing techniques can help accelerate timing closure for FPGA designs without any modification to original RTL code. RTL is generally frozen closer to system delivery target to avoid injecting new unforeseen bugs or significantly affecting design characteristics. In these circumstances, developers trying to close timing are either at the mercy of random trials through placement seed exploration or through vendor-provided design space exploration tools that run a few compilation trials with changes to the CAD tool options (or parameters). Instead, we propose evaluating multiple CAD runs in parallel on the cloud, supported by a Bayesian learning and classification framework for generating multiple CAD parameter combinations most likFPGA CAD tool parametersely to help attain timing closure. We maintain a database of FPGA CAD tool parameters (input) along with associated variations in timing slack (output)to enable the learning process. A key engineering resource we use here is cheap and abundant parallelism made possible through cloud computing frameworks such as the Google Compute Engine. Across a range of open-source benchmarks, we show that learning helps improve total negative slack (TNS) scores by 10.5× (geomean) when compared to a single baseline run of Quart us 14.1 and by 7× (geomean) when compared to Alter a Quart us 14.1 Design Space Explorer (DSE).
Nachiket Kapre, Bibin Chandrashekaran, Harnhua Ng, Kirvy Teo
FCCM4
2015 InTime: A Machine Learning Approach for Efficient Selection of FPGA CAD Tool Parameters
abstract
FPGA CAD tool parameters controlling synthesis optimizations, place and route effort, mapping criteria along with user-supplied physical constraints can affect timing results of the circuit by as much as 70% without any change in original source code. A correct selection of these parameters across a diverse set of benchmarks with varying characteristics and design goals is challenging. The sheer number of parameters and option values that can be selected is large (thousands of combinations for modern CAD tools) with often conflicting interactions. In this paper, we present InTime, a machine-learning approach supported by a cloud-based (or cluster-based) compilation infrastructure for automating the selection of these parameters effectively to minimize timing costs. InTime builds a database of results from a series of preliminary runs based on canned configurations of CAD options. It then learns from these runs to predict the next series of CAD tool options to improve timing results. Towards the end, we rely on a limited degree of statistical sampling of certain options like placer and synthesis seeds to further tighten results. Using our approach, we show 70% reduction in final timing results across industrial benchmark problems for the Altera CAD flow. This is 30% better than vendor-supplied design space exploration tools that attempts a similar optimization using canned heuristics.
Nachiket Kapre, Harnhua Ng, Kirvy Teo, Jaco Naude
FPGA3