An efficient algorithm for online placement in a reconfigurable system

Partially runtime reconfiguration is an efficient method for use in the limited resources in order to increase the performance of the system. In these systems, all the processes use the reconfigurable resources and place their hardware tasks at run time without affecting each other. One of the challenging problems in online task placement is fragmentation of reconfigurable resources. This paper focuses on fragmentation rate of task placement in a reconfigurable system. Several techniques for rectangular tasks are investigated and an algorithm that decreases the fragmentation of a FPGA is presented. The algorithm is able to locate a feasible location with improvement in the fragmentation. The algorithm also produces a lower rejection rate compared to other placement algorithms.