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.
This research was supported by Spanish Ministerio de Ciencia y Tecnología, through the research grant TEC2005-04752/MIC.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Compton, K., Hauck, S.: Reconfigurable Computing: A Survey of Systems and Software. ACM Computing Surveys, 171–210 (2002)
Budiu, M.: Application-Specific Hardware: Computing Without CPUs. In: Fourth CMU Symposium on Computer Systems, pp. 1–10 (2001)
Diessel, O.: Opportunities for Operating Systems Research in Reconfigurable Computing. Technical report ACRC-99-018 (1999)
Diessel, O.: On Dynamic Task Scheduling for FPGA-based Systems. International Journal of Foundations of Computer Science, IJFCS 2001, 645–669 (2001)
Handa, M., Vemuri, R.: An efficient algorithm for finding empty space for online FPGA placement. DAC, 960–965 (2004)
Merino, P., López, J., Jerome, M.: A hardware operating system for dynamically reconfiguration of FPGAs. In: Hartenstein, R.W., Keevallik, A. (eds.) FPL 1998. LNCS, vol. 1482, pp. 431–435. Springer, Heidelberg (1998)
Walder, H., Platzner, M.: Online scheduling for block-partitioned reconfigurable devices. In: DATE 2003, pp. 10290–10295 (2003)
Román, S., Septién, J., Mecha, H., Mozos, D., Tabero, J.: Partition-based algorithm for efficient 2D HW multitasking. In: EUROMICRO WIP, pp. 26–27 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Román, S., Septién, J., Mecha, H., Mozos, D. (2006). Constant Complexity Management of 2D HW Multitasking in Run-Time Reconfigurable FPGAs. In: Bertels, K., Cardoso, J.M.P., Vassiliadis, S. (eds) Reconfigurable Computing: Architectures and Applications. ARC 2006. Lecture Notes in Computer Science, vol 3985. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11802839_26
Download citation
DOI: https://doi.org/10.1007/11802839_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36708-6
Online ISBN: 978-3-540-36863-2
eBook Packages: Computer ScienceComputer Science (R0)