Abstract
Recursion is a powerful method that is used to describe many algorithms in computer science. Processing of recursion is traditionally done using a stack, which can act as a bottleneck for parallelising and pipelining different stages of recursion. In this paper we propose a method for mapping recursive algorithms, without the use of a stack structure, into hardware by pipelining the stages of recursion. The use of runtime reconfigurable hardware to minimise the amount of required hardware resources, and the related issues to be resolved, are addressed.
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.
Similar content being viewed by others
References
Bentley, J.L., Shamos, M.I.: Divide-and-conquer in multidimensional space. In: Proceedings of the eighth annual ACM symposium on Theory of computing, pp. 220–230. ACM Press, New York (1976)
Handle-C language reference manual, http://www.celoxica.com/
Maruyama, T., Hoshino, T.: A C to HDL Compiler for Pipeline Processing on FPGAs. In: Proceedings of the 2000 IEEE Symposium on Field-Programmable Custom Computing Machines, p. 101. IEEE Computer Society, Los Alamitos (2000)
Bondalapati, K., Prasanna, V.K.: Loop pipelining and optimization for run time reconfiguration. In: Reconfigurable Architectures Workshop (2000)
ElGindy, H., Ferizis, G.: Mapping basic recursive structures to runtime reconfigurable hardware. Technical Report 419, School of Computer Science and Engineering, University of NSW (2004)
Orenstein, J., Merret, T., Devroye, L.: Linear sorting with O(log N) processors. BIT 23, 170–180 (1983)
Strassen, V.: Gaussian elimination is not optimal. Numerische Mathematik 13, 354–356 (1969)
Arsac, J., Kodrato, Y.: Some techniques for recursion removal from recursive functions, pp. 295–322 (1982)
Liu, Y.A., Stoller, S.D.: From Recursion to Iteration: What are the Optimizations? In: Partial Evaluation and Semantic-Based Program Manipulation, pp. 73–82 (2000)
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
ElGindy, H., Ferizis, G. (2004). Mapping Basic Recursive Structures to Runtime Reconfigurable Hardware. In: Becker, J., Platzner, M., Vernalde, S. (eds) Field Programmable Logic and Application. FPL 2004. Lecture Notes in Computer Science, vol 3203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30117-2_97
Download citation
DOI: https://doi.org/10.1007/978-3-540-30117-2_97
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22989-6
Online ISBN: 978-3-540-30117-2
eBook Packages: Springer Book Archive