Abstract
An operating system for reconfigurable computing is responsible for dynamically placing relocatable pre-routed cores onto an FPGA at run-time. We describe an exact algorithm proposed for use in this type of OS that pre-packs cores into rectangles for subsequent placement. The algorithm not only generates feasible packings but selects those that have a minimum distance metric to optimise inter-core communication distance within the pre-packed rectangle. The algorithm works in conjunction with other software components of the OS that are responsible for partitioning large applications into manageable “space slices” and allocating area to the pre-packed rectangles from the remaining free area of the FPGA. All of these algorithms are capable of operating in a dynamic environment where applications are queued to execute on the FPGA, and then removed when completed with full area reclaim. Thus, they inherently support partial reconfiguration, dynamic reconfiguration, and multi-user operations on a reconfigurable platform.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Wigley, G., Kearney, D.: The Management of Applications for Reconfigurable Computing using an Operating System. In: Seventh Asia-Pacific Computer Systems Architecture Conference, Melbourne, Australia (2002)
Bazargan, K., Kastner, R., Sarrafzadeh, M.: Fast Template Placement for Reconfigurable Computing Systems. IEEE Design & Test of Computers 17, 68–83 (2000)
Fekete, S.P., Schepers, J.: On More-Dimensional Packing III: Exact Algorithms, Angewandte Mathematik und Informatik Universität zu Köln, 97.290 (2000)
Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, Inc., New York (1980)
Booth, K.S., Leuker, G.S.: Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity using PQ-tree Algorithms. Journal of Computer and Systems Science 13, 335–379 (1976)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sharma, A., George, M.A., Kearney, D. (2003). Packing with Boundary Constraints for a Reconfigurable Operating System. In: Omondi, A., Sedukhin, S. (eds) Advances in Computer Systems Architecture. ACSAC 2003. Lecture Notes in Computer Science, vol 2823. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39864-6_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-39864-6_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20122-9
Online ISBN: 978-3-540-39864-6
eBook Packages: Springer Book Archive