Ruchir Puri

Ruchir Puri

Auto-generated profile, based on publicly available information

Ruchir Puri

IBM Research, Yorktown, NY, USA

Research Focus & Metrics

Academic Career Length

33Years (1994-Present)

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

Representative Publications

View All Publications
18 April 2008 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Open access
MCMinsik Cho
Minsik Cho
HXHua Xiang
Hua Xiang
RPRuchir Puri
Ruchir Puri
DPDavid Z. Pan
David Z. Pan
In this paper, we propose track routing and optimization for yield (TROY), the first track router for the optimization of yield loss due to random defects. As the probability of failure (POF), which is an integral of the critical area and the defect size distribution, strongly depends on wire ordering, sizing, and spacing, track routing can play a key role in effective wire planning for yield optimization. However, a straightforward formulation of yield-driven track routing can be shown to be integer nonlinear programming, which is a nondeterministic polynomial-time complete problem. TROY overcomes the computational complexity by combining two effective techniques, i.e., the minimum Hamiltonian path (MHP) from graph theory and the second-order cone programming (SOCP) from mathematical optimization. First, TROY performs wire ordering to minimize the critical area for short defects by finding an MHP. Then, TROY carries out optimal wire sizing/spacing through SOCP optimization based on the given wire order. Since the SOCP can be optimally solved in near linear time, TROY efficiently achieves globally optimal wire sizing/spacing for the minimal POF.

1 January 2015 in IBM Journal of Research and Development
Verified
Journal Article
Closed access
PDF file
VZV. Zyuban
V. Zyuban
JFJ. Friedrich
J. Friedrich
DDD. M. Dreps
D. M. Dreps
JPJ. Pille
J. Pille
DPD. W. Plass
D. W. Plass
SPS. D. Posluszny
S. D. Posluszny
The IBM POWER8 processor is a 649-mm ^{2} , 4.2-billion transistor, high-frequency microprocessor fabricated in the IBM 22-nm silicon on insulator (SOI) technology wit...

11 May 2016 in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Verified
Journal Article
Closed access
RKRobert Karam
Robert Karam
RPRuchir Puri
Ruchir Puri
SBSwarup Bhunia
Swarup Bhunia
Text mining is a growing field of applications, which enables the analysis of large text data sets using statistical methods. In recent years, exponential increase in the size of these data sets has strained existing systems, requiring more computing power, server hardware, networking interconnects, and power consumption. For practical reasons, this trend cannot continue in the future. Instead, we propose a reconfigurable hardware accelerator designed for text analytics systems, which can simultaneously improve performance and reduce power consumption. Situated near the last level of memory, it mitigates the need for high-bandwidth processor-to-memory connections, instead capitalizing on close data proximity, massively parallel operation, and analytic-inspired functional units to maximize energy efficiency, while remaining flexible to easily map common text analytic kernels. A field-programmable gate array-based emulation framework demonstrates the functional correctness of the system, and a full eight-core accelerator is synthesized for power, area, and delay estimates. The accelerator can achieve two to three orders of magnitude improvement in energy efficiency versus CPU and general-purpose graphics processing unit (GPU) for various text mining kernels. As a case study, we demonstrate how indexing performance of Lucene, a popular text search and analytics platform, can be improved by an average of 70% over CPU and GPU while significantly reducing data transfer energy and latency.


13 November 2002
Verified
Conference Paper
Closed access
KJK.A. Jenkins
K.A. Jenkins
RPR. Puri
R. Puri
CCCheng Li Chuang
Cheng Li Chuang
FPF.L. Pesavento
F.L. Pesavento

20 July 2004
Verified
Conference Paper
Closed access
RPR. Puri
R. Puri