Abstract
Specification of signal processing applications in terms of executable process networks is indispensable when these applications are to be mapped on parallel running processing units. The specifications are typically not given as process networks but as imperative programs. Translating imperative programs to process networks is thus necessary. This can be done, be it that some restrictions on the imperative programs have to be imposed: they have to be affine nested loop programs.
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
B. Kienhuis et al.: A Methodology to Design Programmable Embedded Systems. In Lecture Notes in Computer Science, this Volume.
V. Zivkovic, P. Lieverse: An Overview of Methodologies and Tools in the Field of System-level Design. In Lecture Notes in Computer Science, this Volume.
S. Edwards et al.: Design of Embedded Systems: Formal Models, Validation, and Synthesis. In Proceedings of the IEEE, pp. 366–390, Mar. 1997.
P. Lieverse et al.: A methodology for architecture exploration of heterogeneous signal processing systems. In Journal of VLSI Signal Processing, Vol. 29, No. 3, pp. 197–207, Nov. 2001.
B. Kienhuis: MatParser, An Array Dataflow Analysis Compiler. Technical Report UCB/ERL M00/9, 2000.
P. Held, B. Kienhuis: Div, Floor, Ceil, Mod and Step Functions in Nested Loop Programs and Linearly Bounded Lattices. In Algorithms and Parallel Vlsi Architectures III, M. Moonen and F. Catthoor (eds.), pp. 271–282, Kluwer, 1995.
F. Feautrier: Compiling for massively parallel architectures: A perspective. In Algorithms and Parallel VLSI Architectures III, M. Moonen and F. Catthoor (eds.), pp. 259–270, Kluwer, 1995.
E. Rijpkema: Deriving Process Networks from Nested Loop Algorithms. In Parallel Processing Letters, Vol. 10, Nos. 2 & 3, pp. 165–176, 2000.
W. Barnier, J. Chan: Discrete Mathematics with Applications. West Publishing Company, 1989.
B. Kienhuis, E. Deprettere: Modeling Stream-Based Applications using the SBF model of computation. In Proc. IEEE Workshop on Signal Processing Systems, SIPS, pp. 385–394, Sep. 2001.
E. Ehrhart: Sur les polyèdres rationnels homothétiques à n dimsions. In ”C.R. Acad. Sci. Paris, Vol. 254, pp. 616–618, 1962.
Ph. Clauss, V. Loechner: Parametric Analysis of Polyhedral Iteration Spaces. In Proc. IEEE Int. Conf. on Application Specific Array Processors, ASAP, pp. 415–424, Chicago, 1996.
E. Rijpkema: Modeling Task Level Parallelism in Piecewise Regular Programs. PhD Dissertation, Leiden University, Leiden, The Netherlands, 2002.
G. Booch et al.: The Unified Modeling Language User Guide. Addison-Wesley, 1999.
D. Wilde: A Library for Doing Polyhedral Operations. IRISA technical report PI 785, Rennes, France, 1993.
T. Stefanov et al.: System Level Design with Spade: an M-JPEG Case study. In Proceedings Int. Conf. on Computer Aided Design, pp. 384–388, San Jose, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Deprettere, E.F., Rijpkema, E., Kienhuis, B. (2002). Translating Imperative Affine Nested Loop Programs into Process Networks. In: Deprettere, E.F., Teich, J., Vassiliadis, S. (eds) Embedded Processor Design Challenges. SAMOS 2001. Lecture Notes in Computer Science, vol 2268. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45874-3_6
Download citation
DOI: https://doi.org/10.1007/3-540-45874-3_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43322-4
Online ISBN: 978-3-540-45874-6
eBook Packages: Springer Book Archive