An optimal contour algorithm for iso-oriented rectangles
Journal of Algorithms
Computational geometry: an introduction
Computational geometry: an introduction
An algorithmic approach to some problems in terrain navigation
Artificial Intelligence - Special issue on geometric reasoning
Theoretical Computer Science - Special issue on computing and combinatorics
On the continuous Weber and k-median problems (extended abstract)
Proceedings of the sixteenth annual symposium on Computational geometry
Multidimensional binary search trees used for associative searching
Communications of the ACM
The first real operating system for reconfigurable computers
ACSAC '01 Proceedings of the 6th Australasian conference on Computer systems architecture
Fast Template Placement for Reconfigurable Computing Systems
IEEE Design & Test
Linear time bounds for median computations
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Fast Online Task Placement on FPGAs: Free Space Partitioning and 2D-Hashing
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
On the Continuous Fermat-Weber Problem
Operations Research
An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles
IEEE Transactions on Computers
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Communication-aware processor allocation for supercomputers
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Internal and external bitstream relocation for partial dynamic reconfiguration
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Combining temporal partitioning and temporal placement techniques for communication cost improvement
Advances in Engineering Software
Formal approach for the development of intelligent industrial control components
International Journal of Computer Applications in Technology
ISBA: an independent set-based algorithm for automated partial reconfiguration module generation
Proceedings of the International Conference on Computer-Aided Design
VLSI floorplanning based on the integration of adaptive search models
Journal of Computer and Systems Sciences International
A low overhead abstract architecture for FPGA resource management
ACM SIGARCH Computer Architecture News - ACM SIGARCH Computer Architecture News/HEART '12
Clustering scheduling for hardware tasks in reconfigurable computing systems
Journal of Systems Architecture: the EUROMICRO Journal
Journal of Real-Time Image Processing
| Hi-index | 14.98 |
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(n^{2}) 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.