A Fast Algorithm for Finding Maximal Empty Rectangles for Dynamic FPGA Placement

Authors:
Manish Handa;Ranga Vemuri
Affiliations:
-;-
Venue:
Proceedings of the conference on Design, automation and test in Europe - Volume 1
Year:
2004

Citing 3
Cited 2

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

Module placement for fault-tolerant microfluidics-based biochips

Proceedings of the 41st annual Design Automation Conference
Reconfiguration and Communication-Aware Task Scheduling for High-Performance Reconfigurable Computing

ACM Transactions on Reconfigurable Technology and Systems (TRETS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a fast algorithm for finding empty area on the FPGA surface with some rectangular tasks placed on it. We use a staircase datastructure to report the empty area in the form of a list of maximal empty rectangles. We model the FPGA surface using an innovative encoding scheme that improves runtime and reduces memory requirement of our algorithm.Worst-case time complexity of our algorithm is O(xy) where x is number of columns,y is number of rows and x.y is the total number of cells on the FPGA.