Dynamic scheduling of tasks on partially reconfigurable FPGAs
Open Access
- 1 January 2000
- journal article
- Published by Institution of Engineering and Technology (IET) in IEE Proceedings - Computers and Digital Techniques
- Vol. 147 (3) , 181-188
Abstract
Field-programmable gate arrays (FPGAs) which allow partial reconfiguration at run time can be shared among multiple independent tasks. When the sequence of tasks to be performed is unpredictable, the FPGA controller needs to make allocation decisions online. Since online allocation suffers from fragmentation, tasks can end up waiting despite there being sufficient, albeit noncontiguous, resources available to service them. The time to complete tasks is consequently longer and the utilisation of the FPGA is lower than it could be. It is proposed that a subset of the tasks executing on the FPGA be rearranged when to do so allows the next pending task to be processed sooner. Methods are described and evaluated for overcoming the NP-hard problems of identifying feasible rearrangements and scheduling the rearrangements when moving tasks are reloaded from off-chip.Keywords
This publication has 10 references indexed in Scilit:
- Density enhancement of a neural network using FPGAs and run-time reconfiguration2002
- Partial FPGA rearrangement by local repacking (abstract)1998
- Run-time compaction of FPGA designs1997
- Programmable active memories: reconfigurable systems come of ageIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 1996
- Sequencing run-time reconfigured hardware with software1996
- Gene Pool Recombination in Genetic Algorithms1996
- A virtual hardware operating system for the Xilinx XC62001996
- Fast reconfigurable crossbar switching in FPGAsLecture Notes in Computer Science, 1996
- Video communications using rapidly reconfigurable hardwareIEEE Transactions on Circuits and Systems for Video Technology, 1995
- A 2.5 times optimal algorithm for packing in two dimensionsInformation Processing Letters, 1980