Abstract
Recent generations of FPGAs allow run-time partial reconfiguration. To increase the efficacy of reconfigurable computing, multitasking on FPGAs is proposed. One of the challenging problems in multitasking systems is online template placement. In this paper, we describe how existing algorithms work, and propose a new free space manager which is one main part of the placement algorithm. The decision where to place a new module depends on its finishing time mobility. Therefore the proposed algorithm is a combination of scheduling and placement. The simulation results show a better performance against existing methods.
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
Bazargan, K., Kastner, R., Sarrafzadeh, M.: Fast Template Placement for Reconfigurable Computing Systems. IEEE Design and Test of Computers 17, 68–83 (2000)
Ahmadinia, A., Teich, J.: Speeding up Online Placement for XILINX FPGAs by Reducing Configuration Overhead. To appear in Proceedings of 12th IFIP VLSI-SOC (December 2003)
Walder, H., Steiger, C., Platzner, M.: Fast Online Task Placement on FPGAs: Free Space Partitioning and 2-D Hashing. In: Proceedings of the 17th Inter-national Parallel and Distributed Processing Symposium (IPDPS) / Reconfigurable Architectures Workshop (RAW), April 2003, IEEE-CS Press, New York (2003)
Wigley, G., Kearney, D.: Research Issues in Operating Systems for Reconfigurable Computing. In: Proceedings of the 2nd International Conference on Engineering of Reconfigurable Systems and Architectures (ERSA), June 2002, CSREA Press, Las Vegas (2002)
Diessel, O., ElGindy, H.: On scheduling dynamic FPGA reconfigurations. In: Hawick, K.A., James, H.A. (eds.) Proceedings of the Fifth Australasian Conference on Parallel and Real-Time Systems (PART 1998), Singapore, pp. 191–200. Springer, Heidelberg (1998)
Fekete, S., Köhler, E., Teich, J.: Optimal FPGA Module Placement with Temporal Precedence Constraints. In: Proc. of Design Automation and Test in Europe, pp. 658–665. IEEE-CS Press, Munich (2001)
Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: a survey. In: Hochbaum, D. (ed.) Approximation algorithms for NP-hard problems, pp. 46–93. PWS Publishing, Boston (1996)
Coffman Jr., E.G., Shor, P.W.: Packings in Two Dimensions: Asymptotic AverageCase Analysis of Algorithms. Algorithmica 9(3), 253–277 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ahmadinia, A., Bobda, C., Teich, J. (2004). A Dynamic Scheduling and Placement Algorithm for Reconfigurable Hardware. In: Müller-Schloer, C., Ungerer, T., Bauer, B. (eds) Organic and Pervasive Computing – ARCS 2004. ARCS 2004. Lecture Notes in Computer Science, vol 2981. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24714-2_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-24714-2_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21238-6
Online ISBN: 978-3-540-24714-2
eBook Packages: Springer Book Archive