Abstract
As a coprocessor, field-programmable gate array (FPGA) is the hardware computing processor accelerating the computing capacity of computers. To efficiently manage the hardware free resources for the placing of tasks on FPGA and take full advantage of the partially reconfigurable units, good utilization of chip resources is an important and necessary work. In this paper, a new method is proposed to find the complete set of maximal free resource rectangles based on the cross point of edge lines of running tasks on FPGA area, and the prove process is provided to make sure the correctness of this method.
Similar content being viewed by others
References
ElGhazawi T, ElAraby E, Huang M Q, Kris G, Kindratenko V, Buell D. The promise of highperformance reconfigurable computing [J]. Computer, 2008, 41(2): 69–76.
Orlowski M. A new algorithm for the largest empty rectangle problem [J]. Algorithmica, 1990, 5(1): 65–73.
Edmonds J, Gryz J, Liang D, Miller R J. Mining for empty spaces in large data sets [J]. Theoretical Computer Science, 2003, 296(3): 435–452.
Handa M, Vemuri R. An efficient algorithm for finding empty space for online fpga placement [C]// Proceedings of the 41st Annual Conference on Design Automation, San Diego, USA. 2004: 960–965.
Tomono M, Nakanishi M, Yamashita S, Nakajima N, Watanabe K. A new approach to online fpga placement [C]// Proceedings of the 40th Annual Conference on Information Sciences and Systems, Princeton, USA. 2006: 145–150.
Bazargan K, Kastner R, Sarrafzadeh M. Fast template placement for reconfigurable computing systems [J]. IEEE Design and Test of Computers, 2000, 17(1): 68–83.
Walder H, Steiger C, Platzner M. Fast online task placement on FPGAs: Free space partitioning and 2D hashing [C]// Proceedings of International Parallel and Distributed Processing Symposium, Nice, France. 2003: 178b.
Ahmadinia A, Bobda C, Bednara M, Teich J. A new approach for on-line placement on reconfigurable devices [C]// Proceedings of International Parallel and Distributed Processing Symposium, Santa, USA. 2004: 134–140.
Cui J, Deng Q, He X, Gu Z. An efficient algorithm for online management of 2d area of partially reconfigurable FPGAS [C]// Proceedings of the Conference on Design, Automation and Test in Europe, Nice, France. 2007: 129–134.
Lu Y, Marconi T, Gaydadjiev G, Bertels K. An efficient algorithm for free resources management on the FPGA [C]// Proceedings of the Conference on Design, Automation and Test in Europe, Munich, Germany. 2008: 1095–1098.
Author information
Authors and Affiliations
Corresponding author
Additional information
Project supported by the Shanghai Leading Academic Discipline Project (Grant No.J50103), the Natural Science Foundation of Jiangxi Province (Grant No.2010GZS0031), and the Science Technology Project of Jiangxi Province (Grant No.2010BGB00604)
About this article
Cite this article
Chai, Yh., Shen, Wf., Xu, Wm. et al. Searching for complete set of free resource rectangles on FPGA area based on CPTR. J. Shanghai Univ.(Engl. Ed.) 15, 391–396 (2011). https://doi.org/10.1007/s11741-011-0757-2
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11741-011-0757-2