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

Mohankumar Guruswamy

dblp:98/4862 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 1997
—ORCID · none

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

Systems, architecture and hardware · 5 · 4 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
4 papers
Electronic design automation · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation
physical design
0.041997
CELLERITY: A Fully Automatic Layout Synthesis System for Standard Cell Libraries · DAC 1997
Echelon: a multilayer detailed area router · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1996
Channel ordering for VLSI layout with rectilinear modules · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1991
Electronic design automation › physical design › routing › multilayer routing
multilayer area routing
0.021996
Echelon: a multilayer detailed area router · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1996
A General Multi-Layer Area Router · DAC 1991
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 › routing
detailed routing
0.011996
Echelon: a multilayer detailed area router · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1996
Electronic design automation › physical design › routing
channel routing
0.011991
Channel ordering for VLSI layout with rectilinear modules · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1991
Electronic design automation › physical design › routing › multilayer routing
layer assignment
0.011991
A General Multi-Layer Area Router · DAC 1991
Electronic design automation › physical design
routing
0.011991
A General Multi-Layer Area Router · DAC 1991

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

template customization · 0.0design rule checking · 0.0non-uniform grid scheme · 0.0virtual grid construction · 0.0staircase channel algorithm · 0.0local and global modification · 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
DAC1
1996 Echelon: a multilayer detailed area router
abstract
We present a general multilayer area router for performing detailed routing in integrated circuits. This router is based on a novel grid construction scheme which considers the differing design rules of the routing layers and produces more wiring tracks than a uniform grid scheme. Our router is very general and flexible and is designed to handle all the physical constraints of a CMOS custom cell layout problem for an arbitrary number of routing layers. The router has been incorporated into the Custom Cell Synthesizer project at MCC. It has produced better results than uniform gridded routers and improved the capability of the system by providing routing flexibility and supporting features needed to handle a wide range of design styles in generating CMOS custom cells.
Mohankumar Guruswamy, Martin D. F. Wong
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
1991 A General Multi-Layer Area Router
abstract
This paper presents a general multi-layer area router based on a novel grid construction scheme. The grid construction scheme produces more wiring tracks than the normal uniform grid scheme and accounts for differing design rules of the layers involved. Initial routing performed on the varying capacity grid is followed by a layer assignment stage. Routing completion is ensured by iterating local and global modifications in the layer assignment stage. Our router has been incorporated into the Custom Cell Synthesis project at MCC and has shown improved results for cell synthesis problems when compared with the router Mighty which was used in earlier versions of the project. spacing rules. (The general area routers such as Mighty(SI and Codar(6) can be used only in this way). This results in low utilization of wiring resources in the lower layers which usually have smaller spacing rules than the layers above. This router overcomes the shortcomings of gridded routers by using a novel approach to forming a virtual grid based on the design rules of each layer used in routing. Placement and routing of transistors are normally followed by a compaction stage which spaces the wires, vias and devices according to design rules. The grid is modelled with the knowledge that the layout will go through a compaction stage before the mask is generated. We use a model in which the tracks in the lower layers are denser than the tracks in the upper
Mohankumar Guruswamy, Martin D. F. Wong
DAC1
1991 Channel ordering for VLSI layout with rectilinear modules
abstract
The authors present a channel-ordering algorithm for VLSI layout with rectilinear modules. Existing approaches for layout with rectangular modules using only straight and L-shaped channels are no longer applicable. In general, rectilinear channels are needed. An important class of channels, called staircase channels, is introduced. This algorithm produces a feasible channel ordering which minimizes the usage of nonstaircase channels and minimizes the number of corners in a channel.>
Martin D. F. Wong, Mohankumar Guruswamy
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.2
1988 Channel routing order for building-block layout with rectilinear modules
abstract
A feasible channel-ordering algorithm for building-block layout using rectilinear blocks is presented. Existing approaches for layout with rectangular modules using only straight and L-shaped channels are no longer applicable. A class of channels called monotone channels is introduced. A monotone channel is a generalization of an L-shaped channel that has the form of a staircase. Routing is achieved by expanding the channel in both the horizontal and vertical directions. The algorithm produces a feasible channel order which minimizes the number of nonmonotone channels and the maximum number of corners in a channel used.>
Mohankumar Guruswamy, Martin D. F. Wong
ICCAD1