A fast algorithm for finding maximal empty rectangles for dynamic FPGA placement

Proceedings - Design, Automation and Test in Europe Conference and Exhibition

Volumn 1, Issue , 2004, Pages 744-745

  Handa, Manish ^a   Vemuri, Ranga ^a  

^a University of Cincinnati   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA CELLS; DEFRAGMENTATION; MAXIMAL EMPTY RECTANGLES (MER); STAIRCASE; ENCODING SCHEMES; FAST ALGORITHMS; MEMORY REQUIREMENTS; RUNTIMES; TIME COMPLEXITY;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA REDUCTION; DATA STRUCTURES; HEURISTIC METHODS; MATRIX ALGEBRA; ONLINE SYSTEMS; SIGNAL ENCODING;

FIELD PROGRAMMABLE GATE ARRAYS; EXHIBITIONS;

EID: 3042513607     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DATE.2004.1268958     Document Type: Conference Paper

References (3)

1. K. Bazargan, R. Kastner, and M. Sarrafzadeh. Fast Template Placement for Reconfigurable Computing Systems. In IEEE Design and Test - Special Issue on Reconfigurable Computing, volume 17(1), pages 68-83, Jan.-Mar. 2000.
2. J. Edmonds, J. Gryz, D. Liang, and R. J. Miller. Mining for Empty Spaces in Large Data Sets. Theoretical Comput. Sci., 3(296):435-452, 2003.
3. H. Walder, C. Steiger, and M. Platzner. Fast Online Task Placement on FPGAs: Free Space Partitioning and 2D-Hashing. In International Parallel and Distributed Processing Symposium (IPDPS'03), page 178, April 2003.