ACM Home Page
Please provide us with feedback. Feedback
A buffer planning algorithm based on dead space redistribution
Full text PdfPdf (84 KB)
Source Asia and South Pacific Design Automation Conference archive
Proceedings of the 2003 Asia and South Pacific Design Automation Conference table of contents
Kitakyushu, Japan
SESSION: Performance driven floorplan table of contents
Pages: 435 - 438  
Year of Publication: 2003
ISBN:0-7803-7660-9
Authors
Song Chen  Tsinghua University, Beijing, China
Xianlong Hong  Tsinghua University, Beijing, China
Sheqin Dong  Tsinghua University, Beijing, China
Yuchun Mal  Tsinghua University, Beijing, China
Yici Cai  Tsinghua University, Beijing, China
Chung-Kuan Cheng  University of California, San Diego
Jun Gu  University of HongKong
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
IPSJ : Information Processing Society of Japan
IEICE : Institute of Electronics, Information and Communication Engineers
: IEEE Circuits and Systems Society
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 4,   Citation Count: 4
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1119772.1119859
What is a DOI?

ABSTRACT

This paper studies the buffer planning problem for interconnect-centric floorplanning for nanometer technologies. The dead-spaces are the spaces within a placement that are not held by any circuit block. In this paper, we proposed a buffer planning algorithm based on dead space redistribution to make good use of dead-spaces for buffer insertion. Associated with circuit blocks under topological representations, the dead space can be redistributed by freely moving some circuit blocks within their rooms in the placement. The total area and the topology of the placement keep unchanged while doing the dead space redistribution. The number of nets satisfying the delay constraint can be increased by redistributing the dead space all over the placement, which has been demonstrated by the experimental results. The increment of the number of nets that satisfy delay constraints is 9% on an average.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
J. Cong, "Challenges and opportunities for design innovations in nanometer technologies," Frontiers in Semiconductor Research: A collection of SRC Working Papers, Semiconductor Research Corporation, http://www.src.org/prg_mgmt/frontier.dgw, 1997
 
4
5
6
 
7
Collaborative Benchmarking Laboratory, North Carolina State University, http://www.cbl.ncsu.edu/CBL Docs/lys92.html: LayoutSynth'92 Benchmark Information.
8
 
9
10
11
12
13
14
 
15
Semiconductor Industry Association, National Technology Roadmap for Semiconductors, 1997.

Collaborative Colleagues:
Song Chen: colleagues
Xianlong Hong: colleagues
Sheqin Dong: colleagues
Yuchun Mal: colleagues
Yici Cai: colleagues
Chung-Kuan Cheng: colleagues
Jun Gu: colleagues