可重构系统中高效的二维任务放置策略

Efficient 2D task placement scheme in FPGA reconfigurable system

在二维可重构系统中,高效的任务放置策略对系统整体性能起着非常重要的作用。提出了一种新的平均任务分配时间复杂度为(b(Nt-b/4))的二维任务放置策略,它优于现有的时间复杂度为(bNt)或者(Nt2)的放置算法。对该算法进一步改进,并与现有放置算法在分配时间和等待延迟方面进行了比较分析。

An efficient 2D task placement scheme is very important to achieve high performance in reconfigurable computing system. A new efficient 2D task placement scheme with a time complexity O （b （Nt-b/4）） of the task allocation, which is better than existing O （bNt） or O （N,2） placement scheme. And further more, the scheme is improved to get better performance and then some other schemes in terms of allocation time and waiting delay are compared.