#### Filter Results:

- Full text PDF available (99)

#### Publication Year

1992

2017

- This year (1)
- Last 5 years (20)
- Last 10 years (56)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Charles J. Alpert, Andrew B. Kahng
- Integration
- 1995

This survey describes research directions in netlist partitioning during the past two decades in terms of both problem formulations and solution approaches. We discuss the traditional min-cut and ratio cut bipartitioning formulations along with multi-way extensions and newer problem formulations, e.g., constraint-driven partitioning (for FPGAs) and… (More)

- Charles J. Alpert
- ISPD
- 1998

From 1985-1993, the MCNC regularly introduced and maintained circuit benchmarks for use by the Design Automation community. However, during the last five years, no new circuits have been introduced that can be used for developing fundamental physical design applications, such as partitioning and placement. The largest circuit in the existing set of… (More)

- Charles J. Alpert, So-Zen Yao
- 32nd Design Automation Conference
- 1995

A spectral partitioning method uses the eigenvectors of a graph's adjacency or Laplacian matrix to construct a geometric representation (e.g., a linear ordering) which is then heuristically partitioned. We map each graph vertex to a vector in d-dimensional space, where d is the number of eigenvectors, such that these vectors constitute an instance of the… (More)

- Charles J. Alpert, Anirudh Devgan
- DAC
- 1997

Buffer insertion seeks to place buffers on the wires of a signal netto minimize delay. Van Ginneken [Buffer Placement in Distributed RC-tree Networks for Minimal Elmore Delay] proposed an optimal dynamicprogramming solution (with extensions proposed by [7] [8][9] [12]) such that at most one buffer can be placed on a singlewire. This constraint can hurt… (More)

- Charles J. Alpert, Dennis J.-H. Huang, Andrew B. Kahng
- IEEE Trans. on CAD of Integrated Circuits and…
- 1997

Recent work has illustrated the promise ofmultilevel approaches for partitioning large circuits. Multilevel partitioningrecursively clusters the instance until its size is smallerthan a given threshold, then unclusters the instance while applyinga partitioning refinement algorithm. Our multilevel partitioner usesa new technique to control the number of… (More)

Without the MCNC and ISPD98 benchmarks, it would arguably not have been possible for the academic community to make consistent advances in physical design over the last decade. While still being used extensively in placement and floorplanning research, those benchmarks can no longer be considered representative of today's (and tomorrow's) physical design… (More)

The last few years have seen significant advances in the quality of placement algorithms. This is in part due to the availability of large, challenging testcases by way of the ISPD-2005 [17] and ISPD-2006 [16] placement contests. These contests primarily evaluated the placers based on the half-perimeter wire length metric. Although wire length is an… (More)

- Frank Liu, Chandramouli V. Kashyap, Charles J. Alpert
- IEEE Transactions on Computer-Aided Design of…
- 2002

Physical design optimizations such as placement, interconnect synthesis, oorplanning, and routing require fast and accurate analysis of RC networks. Because of its simple close form and fast evaluation, the Elmore delay metric has been widely adopted. The recently proposed delay metrics PRIMO and H-gamma match the rst three circuit moments to the… (More)

- Natarajan Viswanathan, Gi-Joon Nam, Charles J. Alpert, Paul G. Villarrubia, Haoxing Ren, Chris C. N. Chu
- 2007 44th ACM/IEEE Design Automation Conference
- 2007

This paper describes a simple and effective quadratic placement algorithm called <i>RQL.</i> We show that a good quadratic placement, followed by local wirelength-driven spreading can produce excellent results on large-scale industrial ASIC designs. As opposed to the current top performing academic placers [4, 7, 11], <i>RQL</i> does not embed a… (More)

We propose a new multilevel framework for large-scale placement called MAPLE that respects utilization constraints, handles movable macros and guides the transition between global and detailed placement. In this framework, optimization is adaptive to current placement conditions through a new density metric. As a baseline, we leverage a recently developed… (More)