Fast algorithms for computing the largest empty rectangle
SCG '87 Proceedings of the third annual symposium on Computational geometry
Fast Template Placement for Reconfigurable Computing Systems
IEEE Design & Test
Mining for empty spaces in large data sets
Theoretical Computer Science - Database theory
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
Run-Time Management of Logic Resources on Reconfigurable Systems
DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Placement-Oriented Modeling of Partially Reconfigurable Architectures
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04
Task placement heuristic based on 3D-adjacency and look-ahead in reconfigurable systems
ASP-DAC '06 Proceedings of the 2006 Asia and South Pacific Design Automation Conference
ASP-DAC '06 Proceedings of the 2006 Asia and South Pacific Design Automation Conference
An efficient algorithm for online management of 2D area of partially reconfigurable FPGAs
Proceedings of the conference on Design, automation and test in Europe
Improving utilization of reconfigurable resources using two dimensional compaction
Proceedings of the conference on Design, automation and test in Europe
Improving utilization of reconfigurable resources using two-dimensional compaction
The Journal of Supercomputing
Allocation heuristics and defragmentation measures for reconfigurable systems management
Integration, the VLSI Journal
An efficient algorithm for free resources management on the FPGA
Proceedings of the conference on Design, automation and test in Europe
Intelligent merging online task placement algorithm for partial reconfigurable systems
Proceedings of the conference on Design, automation and test in Europe
Online Task Scheduling for the FPGA-Based Partially Reconfigurable Systems
ARC '09 Proceedings of the 5th International Workshop on Reconfigurable Computing: Architectures, Tools and Applications
Reconfigurable Computing: The Theory and Practice of FPGA-Based Computation
Reconfigurable Computing: The Theory and Practice of FPGA-Based Computation
Maximal strips data structure to represent free space on partially reconfigurable FPGAs
International Journal of Parallel, Emergent and Distributed Systems - Advances in Parallel and Distributed Computational Models
Microprocessors & Microsystems
Server-side coprocessor updating for mobile devices with FPGAs
Proceedings of the 18th annual ACM/SIGDA international symposium on Field programmable gate arrays
ACM Transactions on Reconfigurable Technology and Systems (TRETS)
2D defragmentation heuristics for hardware multitasking on reconfigurable devices
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
New three-level resource management enhancing quality of offline hardware task placement on FPGA
International Journal of Reconfigurable Computing
Reliability and availability in reconfigurable computing: a basis for a common solution
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
International Journal of Reconfigurable Computing - Special issue on selected papers from the international workshop on reconfigurable communication-centric systems on chips (ReCoSoC' 2010)
Architecture and operating system support for two-dimensional runtime partial reconfiguration
The Journal of Supercomputing
Module-Based Synthesis of Digital Microfluidic Biochips with Droplet-Aware Operation Execution
ACM Journal on Emerging Technologies in Computing Systems (JETC)
International Journal of Applied Evolutionary Computation
Clustering scheduling for hardware tasks in reconfigurable computing systems
Journal of Systems Architecture: the EUROMICRO Journal
| Hi-index | 0.00 |
A fast and efficient algorithm for finding empty area is necessary for online placement, task relocation and defragmentation on a partially reconfigurable FPGA. We present an algorithm that finds empty area as a list of overlapping maximal rectangles. Using an innovative representation of the FPGA, we are able to predict possible locations of the maximal empty rectangles. Worst-case time complexity of our algorithm is O(xy) where x is the number of columns, y is the number of rows and x.y is the total number of cells on the FPGA. Experiments show that, in practice, our algorithm needs to scan less than 15% of the FPGA cells to make a list of all maximal empty rectangles.