| How does partitioning matter for 3D floorplanning? |
| Full text |
Pdf
(220 KB)
|
| Source
|
Great Lakes Symposium on VLSI
archive
Proceedings of the 16th ACM Great Lakes symposium on VLSI
table of contents
Philadelphia, PA, USA
SESSION: Partitioning and floorplanning
table of contents
Pages: 73 - 78
Year of Publication: 2006
ISBN:1-59593-347-6
|
|
Authors
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 14, Downloads (12 Months): 77, Citation Count: 0
|
|
|
ABSTRACT
The recent hierarchical design framework[8] for 3D floorplan-ning suggests a better performance than previous flat design framework. Under this framework, the layer assignment of the blocks is accomplished by some partitioning algorithms which are assumed to be critical[8]. In this paper, we provide an empirical study on the impact of such partitioning algorithms on the total wire length. By generating various partitions and running our floorplanner based on these partitions, we obtain the statistic of the resultant wire length. We observe that when the design instance has a large number of blocks which are uniformly sized, different partitions with the same cut size lead to roughly the same wire length. By another experiment, we find out that the cut size of the partition has the major influence on the wire length. Therefore, we argue that cut size is a metric good enough for the wire length optimization of 3D floorplanning and suggest that future research focus on other problems such as thermal effect, signal delay, etc.
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
|
S. N. Adya and I. L. Markov. Fixed-outline floorplanning: Enabling hierarchical design. IEEE Trans. on VLSI Systems, 1(11):1120--1135, Dec. 2003.
|
| |
2
|
K. Bazargan, R. Kastner, and M. Sarrafzadeh. 3D floorplanning: Simulated annealing and greedy placement methods for reconfigurable computing systems. Journal of Design Automation for Embedded Systems(DAfES), Apr. 2000.
|
 |
3
|
|
| |
4
|
|
 |
5
|
Shamik Das , Andy Fan , Kuan-Neng Chen , Chuan Seng Tan , Nisha Checka , Rafael Reif, Technology, performance, and computer-aided design of three-dimensional integrated circuits, Proceedings of the 2004 international symposium on Physical design, April 18-21, 2004, Phoenix, Arizona, USA
[doi> 10.1145/981066.981091]
|
 |
6
|
|
| |
7
|
|
| |
8
|
Z. Li, X. Hong, Q. Zhou, Y. Cai, J. Bian, H. Yang, P. Saxena, and V. Pitchumani. A divide-and-conquer 2.5-D floorplanning algorithm based on statistical wirelength estimation. In Proc. ISCAS'05, pages 6230--6233. IEEE, 2005.
|
| |
9
|
P. H. Madden. Supersize VLSI, a recipe for disaster. In Electronic Design Process(EDP) 2005 Workshop. IEEE, 2005.
|
| |
10
|
|
| |
11
|
H. Murata, K. Fujiyoshi, S. Nakatake, and Y. Kajitani. VLSI module placement based on rectangle-packing by the sequence pair. IEEE Trans. on CAD, 15(12):1518--1524, Dec. 1996.
|
| |
12
|
P. H. Shiu, R. Ravichandran, S. Easwar, and S. K. Lim. Multi-layer floorplanning for reliable system-on-package. In Proc. ISCAS'04, pages V69--V72. IEEE, 2004.
|
 |
13
|
Xiaoping Tang , Ruiqi Tian , D. F. Wong, Fast evaluation of sequence pair in block placement by longest common subsequence computation, Proceedings of the conference on Design, automation and test in Europe, p.106-111, March 27-30, 2000, Paris, France
[doi> 10.1145/343647.343713]
|
| |
14
|
H. Yamazaki, K. Sakanushi, S. Nakatake, and Y. Kajitani. The 3D-packing by meta data structure and packing heuristics. IEICE Trans. Fundamentals, E83-A(4):639--645, Apr. 2000.
|
|