arXiv cs/04060352004-06cs.DScs.CG

可重构器件的最优自由空间管理和可感知动态布局

Optimal Free-Space Management and Routing-Conscious Dynamic Placement for Reconfigurable Devices

Ali Ahmadinia, Christophe Bobda, Sandor Fekete, Juergen Teich, Jan van der Veen

备注：: 18 pages, 8 figures, 1, table; previous 5-page extended abstract appears in "International Conference on Field-Programmable Logic and Applications", 2004. New version is final journal version, to appear in IEEE Transactions on Computers
DOI：: 10.1109/TC.2007.1028

摘要：

我们描述的算法结果的两个关键方面的计算硬件设备上的资源分配与部分可重构性。通过使用从计算几何领域的方法，我们推导出一种方法，允许正确的自由和占用空间的一组n个矩形模块在最佳时间θ（n log n）;以前的方法需要一个时间为O（n^2）的正确结果和O（n）的启发式结果。我们还表明，找到一个最佳可行的通信意识的位置（最大限度地减少新模块和现有的需求点之间的总加权曼哈顿距离）可以计算在θ（n log n）。这两种算法实际上很容易实现，并显示出令人信服的实验行为。

英文摘要：

We describe algorithmic results for two crucial aspects of allocating resources on computational hardware devices with partial reconfigurability. By using methods from the field of computational geometry, we derive a method that allows correct maintainance of free and occupied space of a set of n rectangular modules in optimal time Theta(n log n); previous approaches needed a time of O(n^2) for correct results and O(n) for heuristic results. We also show that finding an optimal feasible communication-conscious placement (which minimizes the total weighted Manhattan distance between the new module and existing demand points) can be computed in Theta(n log n). Both resulting algorithms are practically easy to implement and show convincing experimental behavior.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。