Journal of South China University of Technology(Natural Science) >
Graph Theory-Based Algorithm to Manage FPGA Resources
Received date: 2010-01-06
Revised date: 2010-06-28
Online published: 2010-11-25
Supported by
黑龙江省自然科学基金资助项目(B2007-07); 齐齐哈尔市工业攻关项目(GYGG—09009)
In order to avoid the redundancy and duplication when using the plane partition algorithm to find all maximal empty rectangles,an algorithm based on virtual undigraph marked as KAMER_VU is proposed to manage the reconfigurable empty hardware resources.Based on the FPGA of two-dimension region,the algorithm uses the mapping between the undigraph and the FPGA model and indirectly finds all maximal empty rectangles by looking for effective loop and pathway in the virtual undigraph,thus simplifying the partition of free region.Some simulations are then performed to make a comparison between the proposed algorithm and the existing SL algorithm.The results indicate that KAMER_VU effectively saves time for hardware distribution and increases the success probabi-lity of hardware allocation for task.
Zhang Hong-lie Zhang Guo-yin . Graph Theory-Based Algorithm to Manage FPGA Resources[J]. Journal of South China University of Technology(Natural Science), 2010 , 38(11) : 91 -95 . DOI: 10.3969/j.issn.1000-565X.2010.11.017
[1]null
/
| 〈 |
|
〉 |