Maximal strips data structure to represent free space on partially reconfigurable FPGAs
Document Type
Conference Proceeding
Publication Date
9-10-2008
Abstract
Partially reconfigurable devices allow the execution of multiple tasks simultaneously on the same chip. To schedule a set of tasks in a small amount of time, the scheduling algorithm will need to represent the free space efficiently. A data structure to represent free space should allow the scheduler to identify free space in which to place a new task and admit efficient updates after placing or removing a task. In this paper, we review some existing data structures and analyze their time complexity. We propose a new structure using maximal horizontal and vertical strips to represent the free space. These strips start and stop at task boundaries. Simulation and time analysis showed that this method has better time complexity than many other free space data structures and at the same time has a very reasonable rejection ratio on real-time tasks compared to other methods. ©2008 IEEE.
Publication Source (Journal or Book title)
IPDPS Miami 2008 - Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium, Program and CD-ROM
Recommended Citation
Elbidweihy, M., & Trahan, J. (2008). Maximal strips data structure to represent free space on partially reconfigurable FPGAs. IPDPS Miami 2008 - Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium, Program and CD-ROM https://doi.org/10.1109/IPDPS.2008.4536135