Referenced Items are not available for this document.
Speed and placement quality are two very important attributes of a good online placement algorithm, because the time taken by the algorithm is considered as an overhead to the application overall execution time. To solve this problem, we propose three techniques: Merging Only if Needed (MON), Partial Merging (PM), and Direct Combine (DC). Our IM (intelligent merging) algorithm uses dynamically these three techniques to exploit their specific advantages. IM outperforms Bazargan's algorithm as it has placement quality within 0.89% but is 1.72 times faster.
Published in:
Design, Automation and Test in Europe, 2008. DATE '08
Date of Conference: 10-14 March 2008
- Page(s):
- 1346 - 1351
- E-ISBN :
- 978-3-9810801-4-8
- Print ISBN:
- 978-3-9810801-3-1
- INSPEC Accession Number:
- 10278143
- Conference Location :
- Munich
- Digital Object Identifier :
- 10.1109/DATE.2008.4484866
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
