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

Srilata Raman

dblp:73/6843 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 1997
—ORCID · unresolved

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

Systems, architecture and hardware · 3 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

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
1 paper
Electronic design automation · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › physical design › cell layout
cell layout generation
0.011997
CELLERITY: A Fully Automatic Layout Synthesis System for Standard Cell Libraries · DAC 1997
Electronic design automation
physical design
0.011997
CELLERITY: A Fully Automatic Layout Synthesis System for Standard Cell Libraries · DAC 1997

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

template customization · 0.0design rule checking · 0.0
YearPublicationVenuePosition
1997 CELLERITY: A Fully Automatic Layout Synthesis System for Standard Cell Libraries
abstract
This paper describes a fully automatic standard-cell layoutsynthesis system, CELLERITY. The system is flexible insupporting a wide variety of process technologies and a range oflibrary template styles. The tool is fully automatic and providesseveral options to the user to customize the layout template. Thetool considers performance and yield and generates dense,design-rule correct layouts. Experimental results indicate that thearea of CELLERITY-generated standard cells is competitive withmanually designed cells in a majority of circuits. In block-leveltests of industrial circuits, standard-cell blocks generated usingCELLERITY cells are about equal to the block area produced byusing a manually-designed library. Recently, an embeddedmicrocontroller in a state-of-the-art sub-micron processtechnology was fabricated using CELLERITY-generated standard cells.
Mohankumar Guruswamy, Robert L. Maziasz, Daniel Dulitz, Srilata Raman, Venkat Chiluvuri, Andrea Fernández 0001, Larry G. Jones
DAC4
1996 Performance-driven MCM partitioning through an adaptive genetic algorithm
abstract
We present a novel genetic algorithm-based partitioning scheme for multichip modules (MCM's) which integrates four performance constraints simultaneously: pin count, area, heat dissipation, and timing. We also present a similar partitioning algorithm based on evolutionary programming. Experimental studies demonstrate the superiority of these methods over deterministic Fiduccia-Mattheyes (FM) algorithm and simulated annealing (SA) technique. Our approach performs better than another genetic algorithm-based method recently reported. The adaptive change of crossover and mutation probabilities results in better convergence of the partitioning algorithm.
Srilata Raman, Lalit M. Patnaik
IEEE Trans. Very Large Scale Integr. Syst.1
1995 A genetic algorithm-based circuit partitioner for MCMs
Ananta K. Majhi, Lalit M. Patnaik, Srilata Raman
Microprocess. Microprogramming3
1991 Quality-time tradeoffs in simulated annealing for VLSI placement
abstract
A model is presented to characterize the relationship between the best solution (incumbent) found by an iterative algorithm (simulated annealing) and the time spent in achieving it. The target application has been chosen to be the placement of cells on a VLSI chip. The model is used to achieve a tradeoff between solution quality and time spent. This gives an idea of the time at which the iterative algorithm should be terminated when the marginal gain in solution quality is smaller than the marginal increase in cost (or time) spent. Nonlinear regression analysis is used to predict the decrease in time with respect to improvement in solution quality. Experimental results on benchmark circuits are presented to show the errors of run-time prediction compared to a static prediction.>
Srilata Raman, Benjamin W. Wah
COMPSAC1