Task Rearrangement on Partially Reconfigurable FPGAs with Restricted Buffer (original) (raw)
2000, Lecture Notes in Computer Science
Partially recon gurable FPGAs can be shared among multiple independent tasks. When partial recon guration is possible at runtime the FPGA controller can decide on-line were to place new tasks on the FPGA. Since on{line allocation su ers from fragmentation, tasks can end up waiting despite there being su cient, albeit non{contiguous resources available to service them. Rearranging a subset of the tasks executing on the FPGA often allows the next pending task to be processed sooner. In this paper we study the problem of placing and rearranging tasks that are supplied by input streams which have constant data rates. When such tasks are rearranged, the arriving input data have to be bu ered while the execution is suspended. We describe and evaluate a genetic algorithm for identifying and scheduling feasible rearrangements when moving tasks are reloaded from o {chip and bu er size is limited.
Sign up for access to the world's latest research.
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.