Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Gregory M. Schaeffer.
design automation conference | 2008
Peter Feldmann; Soroush Abbaspour; Debjit Sinha; Gregory M. Schaeffer; Revanta Banerji; Hemlata Gupta
This paper introduces an accurate and efficient electrical analysis of logic gates modeled as Multiple Voltage Threshold Models (MVTM) loaded by the associated interconnect. MVTMs formalize a class of gate models which include the existing industry standards, such as CCS and ECSM driver models as special cases. The analysis technique relies on primary MVTM characterization data and does not require explicit instantiation of controlled current source models. Therefore, the method is more accurate, efficient, and general than traditional transient analysis. The theoretical results are validated by detailed simulations and use within full chip timing analysis.
international conference on computer aided design | 2008
Debjit Sinha; Gregory M. Schaeffer; Soroush Abbaspour; Alex Rubin; Frank Borkam
In this paper, we consider the problem of selecting a set of aggressor nets that maximize crosstalk induced noise or delay pushout on a coupled victim net, under given logical constraints. We formulate the problem mathematically, and propose efficient Lagrangian Relaxation and network flow based approaches that guarantee an optimal solution. We also formulate and solve this problem while considering the noise susceptibility of the victimpsilas receiving gate. Experimental results show that the proposed approaches are run-time efficient by factors of up to 800times in comparison to an exhaustive search approach, and reduce timing pessimism by up to 36%.
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems | 2009
Debjit Sinha; Alex Rubin; Chandu Visweswariah; Frank Borkam; Gregory M. Schaeffer; Soroush Abbaspour
In this paper, we consider the problem of identifying a feasible set of aggressor nets that would induce maximum crosstalk noise or delay pushout on a coupled victim net, under given logical constraints. We present a novel mathematical formulation of this problem and propose a Lagrangian relaxation-based approach for solving it efficiently and optimally. Experimental results show that the proposed approach is run-time efficient by a factor of up to 800 times in comparison to an exhaustive search approach and reduces timing pessimism by up to 36%. We also formulate and solve this problem while considering the noise susceptibility of the victims receiving gate.
Archive | 2005
Eric A. Foreman; Peter A. Habitz; Gregory M. Schaeffer
Archive | 2007
Debjit Sinha; Soroush Abbaspour; Ayesha Akhter; Gregory M. Schaeffer; David J. Widiger
Archive | 2007
Soroush Abbaspour; Gregory M. Schaeffer; Chandramouli Visweswariah
Archive | 2006
Gregory M. Schaeffer; Alexander J. Suess; David J. Hathaway
Archive | 2008
Nathan C. Buck; Brian M. Dreibelbis; John P. Dubuque; Eric A. Foreman; Peter A. Habitz; David J. Hathaway; Gregory M. Schaeffer; Chandramouli Visweswariah
Archive | 2009
Nathan C. Buck; John P. Dubuque; Eric A. Foreman; Peter A. Habitz; Kerim Kalafala; Gregory M. Schaeffer; Chandramouli Visweswariah
Archive | 2005
Chandramouli V. Kashyap; Gregory M. Schaeffer; David J. Widiger