S
Siddhartha Nath
Researcher at University of California, San Diego
Publications - 34
Citations - 856
Siddhartha Nath is an academic researcher from University of California, San Diego. The author has contributed to research in topics: Signoff & Computer science. The author has an hindex of 14, co-authored 27 publications receiving 680 citations. Previous affiliations of Siddhartha Nath include Synopsys.
Papers
More filters
Journal ArticleDOI
The GreenDroid Mobile Application Processor: An Architecture for Silicon's Dark Future
Nathan Goulding-Hotta,Jack Sampson,Ganesh Venkatesh,Saturnino Garcia,Joe Auricchio,Peng Huang,Manish Arora,Siddhartha Nath,Vikram Bhatt,J Babb,Steven Swanson,Michael Taylor +11 more
TL;DR: The Greendroid mobile application processor demonstrates an approach that uses dark silicon to execute general-purpose smart phone applications with less energy than today's most energy efficient designs.
Journal ArticleDOI
ORION3.0: A Comprehensive NoC Router Estimation Tool
TL;DR: This work presents ORION3.0, an open-source tool whose parametric and nonparametric modeling methodologies fundamentally differ from ORION2.0 logic template-based approaches in that the estimation models are derived from actual physical implementation data.
Proceedings ArticleDOI
ITRS 2.0: Toward a re-framing of the Semiconductor Technology Roadmap
TL;DR: The current ITRS roadmapping process is extended with studies of key requirements from a system- level perspective, based on multiple generations of smartphones and microservers, and the new system-level framing of the roadmap is referred to as I TRS 2.0.
Journal ArticleDOI
Redefining the Role of the CPU in the Era of CPU-GPU Integration
TL;DR: This article demonstrates that the coming era of CPU and GPU integration requires the CPU to rethink the CPU's design and architecture, and shows that the code the CPU will run, once appropriate computations are mapped to the GPU, has significantly different characteristics than the original code.
Proceedings ArticleDOI
BEOL stack-aware routability prediction from placement using data mining techniques
TL;DR: This work develops machine learning-based models that predict whether a placement solution is routable without conducting trial or early global routing, and uses these models to accurately predict iso-performance Pareto frontiers of utilization, aspect ratio and number of layers in the back-end-of-line (BEOL) stack.