Task placement heuristic based on 3D-adjacency and look-ahead in reconfigurable systems

Authors:
Jesús Tabero;Julio Septién;Hortensia Mecha;Daniel Mozos
Affiliations:
Instituto Nacional de Técnica Aeroespacial, Madrid, Spain;Universidad Complutense de Madrid, Madrid, Spain;Universidad Complutense de Madrid, Madrid, Spain;Universidad Complutense de Madrid, Madrid, Spain
Venue:
ASP-DAC '06 Proceedings of the 2006 Asia and South Pacific Design Automation Conference
Year:
2006

Citing 4
Cited 2

Reconfigurable computing: a survey of systems and software

ACM Computing Surveys (CSUR)
Fast Template Placement for Reconfigurable Computing Systems

IEEE Design & Test
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
An efficient algorithm for finding empty space for online FPGA placement

Proceedings of the 41st annual Design Automation Conference

Allocation heuristics and defragmentation measures for reconfigurable systems management

Integration, the VLSI Journal
Efficient algorithms for 2D area management and online task placement on runtime reconfigurable FPGAs

Microprocessors & Microsystems

Quantified Score

Hi-index	0.00

Visualization

Abstract

To get efficient HW management in 2D Reconfigurable Systems, heuristics are needed to select the best place to locate each arriving task. We propose a technique that locates the task next to the borders of the free area for as many cycles as possible, trying to minimize the area fragmentation. Moreover, we combine it with a look-ahead heuristic that allows delaying the scheduling of a task to the next event, increasing the solution search space.