|
Authors: | Herbert Walder, Christoph Steiger, Marco Platzner |
Group: | Computer Engineering |
Type: | Inproceedings |
Title: | Fast Online Task Placement on FGPAs: Free Space Partitioning and 2D-Hashing |
Year: | 2003 |
Month: | April |
Pub-Key: | WP03b |
Book Titel: | Proceedings of the 10th Reconfigurable Architectures Workshop (RAW03) |
Pages: | 178 |
Keywords: | REC |
Publisher: | IEEE Computer Society |
Abstract: | 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 resources, which leads to concepts of reconfigurable operating systems. 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 partitioning algorithms and a hash matrix as a data structure to maintain the free space. Given n as the number of placed tasks, Bazargan et al. [1] pre- sented a placer that finds a feasible location in O(n) 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%. |
Resources: | [BibTeX] [Paper as PDF] |