Reconfigurable computing: a survey of systems and software
ACM Computing Surveys (CSUR)
Configuration relocation and defragmentation for run-time reconfigurable computing
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
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
Operating Systems for Reconfigurable Embedded Platforms: Online Scheduling of Real-Time Tasks
IEEE Transactions on Computers
Dynamic Interconnection of Reconfigurable Modules on Reconfigurable Devices
IEEE Design & Test
Placement and Routing in 3D Integrated Circuits
IEEE Design & Test
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
COMMA: A Communications Methodology for Dynamic Module Reconfiguration in FPGAs
FCCM '06 Proceedings of the 14th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
A new approach to "storage management" restrictions using the "data quality" concept
Proceedings of the 3rd Annual Haifa Experimental Systems Conference
| Hi-index | 0.00 |
A novel technique is proposed for the management of a 2D reconfigurable device in order to get true hardware multitasking. We use a Vertex List Set to keep track of the free area boundary. This structure contains the best candidate locations for the task, and several heuristics are proposed to select one of them, based in fragmentation and adjacency. A Look-Ahead heuristic that anticipates the next known event is also proposed. A metric is used to estimate the fragmentation status of the FPGA, based on the number of holes and their shape. Defragmentation measures are taken when needed.