Abstract
This paper presents a constant complexity and fast algorithm for the management of run-time reconfigurable resources by an operating system with extended hardware multitasking functionality. Our algorithm manages a two dimensional reconfigurable device by dividing the resource area into four partitions with different sizes. Each partition has an associated queue where the hardware manager places each arriving task depending on its size, shape, deadline requirements and the state of queues. It is possible to merge partitions for tasks not fitting any partition. The sizes of the partitions may be adapted to different circumstances. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Román, S., Septién, J., Mecha, H., & Mozos, D. (2006). Constant complexity management of 2D HW multitasking in run-time reconfigurable FPGAs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3985 LNCS, pp. 187–192). Springer Verlag. https://doi.org/10.1007/11802839_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
