Hardware assisted two dimensional ultra fast online placement

摘要

Time taken to find placement location for a dynamic task is an overhead on the application execution time in a partially reconfigurable system. Inherent parallelism of the reconfigurable hardware can be explored in such cases to speed up the placement process. In this paper, we propose use of the reconfigurable hardware resources of the target platform for speed-up of online placement algorithm. We present three different architectures for two-dimensional online placement. Each architecture makes different trade-offs between area usage, memory requirement and execution time. These architectures are capable of achieving very fast placement while using a very small number of hardware resources.