A Trade-off Oriented Placement Tool

Authors:
Huaiyu Xu;Maogang Wang;Bo-Kyung Choi;Majid Sarrafzadeh
Affiliations:
University of California, Los Angeles;Cadence Design Systems, San Jose, CA;University of California, Los Angeles;University of California, Los Angeles
Venue:
Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Year:
2003

Citing 7
Cited 3

Can recursive bisection alone produce routable placements?

Proceedings of the 37th Annual Design Automation Conference
Improved cut sequences for partitioning based placement

Proceedings of the 38th annual Design Automation Conference
Mongrel: hybrid techniques for standard cell placement

Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Dragon2000: standard-cell placement tool for large industry circuits

Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Congestion reduction during placement based on integer programming

Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Benchmarking for large-scale placement and beyond

Proceedings of the 2003 international symposium on Physical design
Optimality and scalability study of existing placement algorithms

ASP-DAC '03 Proceedings of the 2003 Asia and South Pacific Design Automation Conference

Multi-Million Gate FPGA Physical Design Challenges

Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Energy/area/delay trade-offs in the physical design of on-chip segmented bus architecture

Proceedings of the 2006 international workshop on System-level interconnect prediction
Energy/area/delay tradeoffs in the physical design of on-chip segmented bus architecture

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

High quality placement results are always produced at the cost ofsignificant runtimes. In this paper, we study the trade-offbetween the overall quality and the runtime for standard-cellplacement problems. We implemented and studied a class ofschemes to achieve the runtime vs. quality trade-off. Wedeveloped a new trade-off oriented placement tool (TOOP)which is controlled by decision trees. TOOP can adjust itselfbased on user's requests and netlist properties. Compared toCadence QPlace, even the fastest mode of TOOP (lowest quality)can produce placements with similar or better layout. TOOP alsoshows much stronger ability to produce routable placement whencompared to Capo.