Abstract: The management of reconfigurable resource is an important task for operating system of reconfigurable system. This paper presented UPFS algorithm for FPGA based on graph theory. The main idea of UPFS is the free space of FPGA mapped to undigraph, and then calculated the biggest loop and chain using adjacency matrix and direction vector inclination in undigraph concept, at last we found a set of the biggest rectangular satisfied the conditions. The simulation results show that, compared with existent algorithms, UPFS is feasible management strategy, which can reduce the waste of system resource and decrease the time of hardware distribution.

Key words: Management of reconfigurable resource, Graph theory, Set of the biggest rectangular