Dynamic scheduling of tasks on partially reconfigurable FPGAs

Download files
Access & Terms of Use
open access
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.
Persistent link to this record
DOI
Additional Link
Author(s)
Diessel, Oliver
ElGindy, Hossam
Middendorf, M
Schmeck, H
Schmidt, B
Supervisor(s)
Creator(s)
Editor(s)
Translator(s)
Curator(s)
Designer(s)
Arranger(s)
Composer(s)
Recordist(s)
Conference Proceedings Editor(s)
Other Contributor(s)
Corporate/Industry Contributor(s)
Publication Year
2000
Resource Type
Journal Article
Degree Type
UNSW Faculty
Files
download cdt00diessel_0200002581.pdf 200.76 KB Adobe Portable Document Format
Related dataset(s)