Optimizing register binding in FPGAs using simulated annealing
When variables are assigned to registers or memories in FPGAs, multiplexers are needed for correct operation of the design. These multiplexers are needed at the input registers or memories if different functional units are writing to the same storage unit. Since in FPGAs the area covered by multiple...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | conferenceObject |
| منشور في: |
2017
|
| الوصول للمادة أونلاين: | http://hdl.handle.net/10725/5805 http://dx.doi.org/10.1109/RECONFIG.2005.27 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php http://ieeexplore.ieee.org/abstract/document/1592498/ |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| _version_ | 1864513477864849409 |
|---|---|
| author | Ouaiss, I. |
| author_facet | Ouaiss, I. |
| author_role | author |
| dc.creator.none.fl_str_mv | Ouaiss, I. |
| dc.date.none.fl_str_mv | 2017-06-21T09:53:44Z 2017-06-21T09:53:44Z 2017-06-21 |
| dc.identifier.none.fl_str_mv | 0-7695-2456-7 http://hdl.handle.net/10725/5805 http://dx.doi.org/10.1109/RECONFIG.2005.27 Avakian, A., & Ouaiss, I. (2005, September). Optimizing register binding in FPGAs using simulated annealing. In Reconfigurable Computing and FPGAs, 2005. ReConFig 2005. International Conference on (pp. 8-pp). IEEE. http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php http://ieeexplore.ieee.org/abstract/document/1592498/ |
| dc.language.none.fl_str_mv | en |
| dc.publisher.none.fl_str_mv | IEEE |
| dc.rights.*.fl_str_mv | info:eu-repo/semantics/openAccess |
| dc.title.none.fl_str_mv | Optimizing register binding in FPGAs using simulated annealing |
| dc.type.none.fl_str_mv | Conference Paper / Proceeding info:eu-repo/semantics/publishedVersion info:eu-repo/semantics/conferenceObject |
| description | When variables are assigned to registers or memories in FPGAs, multiplexers are needed for correct operation of the design. These multiplexers are needed at the input registers or memories if different functional units are writing to the same storage unit. Since in FPGAs the area covered by multiplexers is significantly large compared with the area of the overall design, reducing the area of the multiplexers can reduce the overall area occupied by a design. Reducing the area of a design is essential to efficiently utilize the logic area of the FPGAs. This paper proposes a solution that applies simulated annealing after binding variables to storage elements. This solution optimizes the assignment of variables onto registers when standard techniques such as clique partitioning are used; and onto on-chip memory banks when two different memory binding techniques are used. The savings obtained in terms of multiplexer area reaches 27% with an average of 16%; moreover, the overall logic area savings reaches 17% with an average of 7% |
| eu_rights_str_mv | openAccess |
| format | conferenceObject |
| id | LAURepo_4b27de782f4eafeea8ce35795a45c35e |
| identifier_str_mv | 0-7695-2456-7 Avakian, A., & Ouaiss, I. (2005, September). Optimizing register binding in FPGAs using simulated annealing. In Reconfigurable Computing and FPGAs, 2005. ReConFig 2005. International Conference on (pp. 8-pp). IEEE. |
| language_invalid_str_mv | en |
| network_acronym_str | LAURepo |
| network_name_str | Lebanese American University repository |
| oai_identifier_str | oai:laur.lau.edu.lb:10725/5805 |
| publishDate | 2017 |
| publisher.none.fl_str_mv | IEEE |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| spelling | Optimizing register binding in FPGAs using simulated annealingOuaiss, I.When variables are assigned to registers or memories in FPGAs, multiplexers are needed for correct operation of the design. These multiplexers are needed at the input registers or memories if different functional units are writing to the same storage unit. Since in FPGAs the area covered by multiplexers is significantly large compared with the area of the overall design, reducing the area of the multiplexers can reduce the overall area occupied by a design. Reducing the area of a design is essential to efficiently utilize the logic area of the FPGAs. This paper proposes a solution that applies simulated annealing after binding variables to storage elements. This solution optimizes the assignment of variables onto registers when standard techniques such as clique partitioning are used; and onto on-chip memory banks when two different memory binding techniques are used. The savings obtained in terms of multiplexer area reaches 27% with an average of 16%; moreover, the overall logic area savings reaches 17% with an average of 7%N/AIEEE2017-06-21T09:53:44Z2017-06-21T09:53:44Z2017-06-21Conference Paper / Proceedinginfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObject0-7695-2456-7http://hdl.handle.net/10725/5805http://dx.doi.org/10.1109/RECONFIG.2005.27Avakian, A., & Ouaiss, I. (2005, September). Optimizing register binding in FPGAs using simulated annealing. In Reconfigurable Computing and FPGAs, 2005. ReConFig 2005. International Conference on (pp. 8-pp). IEEE.http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.phphttp://ieeexplore.ieee.org/abstract/document/1592498/eninfo:eu-repo/semantics/openAccessoai:laur.lau.edu.lb:10725/58052021-03-19T10:00:57Z |
| spellingShingle | Optimizing register binding in FPGAs using simulated annealing Ouaiss, I. |
| status_str | publishedVersion |
| title | Optimizing register binding in FPGAs using simulated annealing |
| title_full | Optimizing register binding in FPGAs using simulated annealing |
| title_fullStr | Optimizing register binding in FPGAs using simulated annealing |
| title_full_unstemmed | Optimizing register binding in FPGAs using simulated annealing |
| title_short | Optimizing register binding in FPGAs using simulated annealing |
| title_sort | Optimizing register binding in FPGAs using simulated annealing |
| url | http://hdl.handle.net/10725/5805 http://dx.doi.org/10.1109/RECONFIG.2005.27 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php http://ieeexplore.ieee.org/abstract/document/1592498/ |