ACM Home Page
Please provide us with feedback. Feedback
Multi-bend bus driven floorplanning
Full text PdfPdf (662 KB)
Source International Symposium on Physical Design archive
Proceedings of the 2005 international symposium on Physical design table of contents
San Francisco, California, USA
SESSION: Floorplanning table of contents
Pages: 113 - 120  
Year of Publication: 2005
ISBN:1-59593-021-3
Authors
Jill H. Y. Law  The Chinese University of Hong Kong
Evangeline F. Y. Young  The Chinese University of Hong Kong
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 17,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

In this paper, the problem of bus-driven floorplanning is addressed. Given a set of blocks and the bus specification (the width of each bus and the blocks that the bus need to go through), we will generate a floorplan solution such that all the buses go through its blocks, with the area of the floorplan and the total area of the buses minimized. The approach proposed is based on a Simulated Annealing framework. Using the sequence pair representation, we derived the necessary conditions for feasible buses, for which we allow 0-bend, one-bend, or two-bend. Then, we will check whether there are buses that cannot be placed at the same time. Finally, a solution will be generated giving the coordinates of the modules and the buses. Comparing with the results of the algorithm by Xiang et al., the dead space of the floorplan obtained is reduced. Besides, our algorithm can handle buses going through many blocks. For example, if the buses have to go through more than 10 blocks, is not able to generate any solution while our algorithm can still generate solutions of good quality.




Collaborative Colleagues:
Jill H. Y. Law: colleagues
Evangeline F. Y. Young: colleagues