Adaptive Free Space Management of Online Placement for Reconfigurable Systems
Trong‐Yen Lee, Che-Cheng Hu, Chia‐Chun Tsai · 2010
Abstract—The FPGA can be reconfigured both dynamically and partially. Such reconfigurable FPGA allows several tasks to be executed, placed and removed at the runtime. Therefore, the hardware resources management in FPGA on the online placement becomes very important. Most techniques for finding empty space are based on rectangle. In this paper, we propose an adaptive free space management for finding candidate space with rectangular or nonrectangular to place newly arriving tasks. The adaptive free space management uses two procedures to find all feasible candidate space for arriving tasks, namely C-Look and CSAF. Experiment results show that the proposed method reduces 76.49 % in rejection rate, 68.12 % in total task execution time, and 76.32 % in total task waiting time. Index Terms—FPGA, free space management, candidate space. I.