Searching for complete set of free resource rectangles on FPGA area based on CPTR

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.