Optimal Free-Space Management and Routing-Conscious Dynamic Placement for Reconfigurable Devices
Ahmadinia, A.
Bobda, C.
Fekete, S.P.
Teich, J.
van der Veen, J.C.
Sch. of Eng. & Electron., Edinburgh Univ.;
This paper appears in: Computers, IEEE Transactions on
Publication Date: May 2007
Volume: 56,
Issue: 5
On page(s): 673-680
ISSN: 0018-9340
INSPEC Accession Number: 9435153
Digital Object Identifier: 10.1109/TC.2007.1028
Current Version Published: 2007-04-02
Abstract
We describe algorithmic results on 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 maintenance of free and occupied space of a set of n rectangular modules in time O(n log n); previous approaches needed a time of O(n2) for correct results and O(n) for heuristic results. We also show a matching lower bound of Omega (n log n), so our approach is optimal. 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 with Theta(n log n). Both resulting algorithms are practically easy to implement and show convincing experimental behavior
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
