Sciweavers

Share
IPPS
2003
IEEE

Fast Online Task Placement on FPGAs: Free Space Partitioning and 2D-Hashing

9 years 9 months ago
Fast Online Task Placement on FPGAs: Free Space Partitioning and 2D-Hashing
Partial reconfiguration allows for mapping and executing several tasks on an FPGA during runtime. Multitasking on FPGAs raises a number of questions on the management of the reconfigurable resource which leads to the concept of a reconfigurable operating system. A major aspect of such an operating system is task placement. Online placement methods are required that achieve a high placement quality and lead to efficient implementations. This paper presents placement methods that rely on efficient algorithms for the partitioning of the reconfigurable resource and a hash matrix data structure to maintain the free space. Given Òas the number of currently placed tasks, previously known placers find a feasible location in Ç´Òµ time. Our approach is able to find a feasible location in constant time. Additionally, simulations show that our methods improve the placement quality by up to 70%.
Herbert Walder, Christoph Steiger, Marco Platzner
Added 04 Jul 2010
Updated 04 Jul 2010
Type Conference
Year 2003
Where IPPS
Authors Herbert Walder, Christoph Steiger, Marco Platzner
Comments (0)
books