A novel fast online placement algorithm on 2D partially reconfigurable devices

In this paper, we propose a new strategy for online placement algorithm on 2D partially reconfigurable devices, termed the quad-corner (QC). The main differences between our algorithm and related art are quad-corner spreading capability and dynamical searching sequences. Moreover, existing algorithms do not evaluate their algorithms with real hardware tasks; we do experimentations with real hardware tasks on a real FPGA. Our proposal achieves better placement quality and fast online placement compared to existing approaches. Experiments with real workloads (e.g. MDCT, matrix multiplication, Hamming code, sorting, FIR, ADPCM, etc) on Virtex-4 show that the QC not only has 78% less penalty and 93% less wasted area than the existing algorithms on average but also has lower runtime overhead.