Abstract
In this paper, we present a domain specific optimization framework based on a concurrent model-based approach for handling the complete problem of mapping a DSP application on a parallel architecture. The implementation is based on Constraint Programming and the model is described in details. Our concurrent resolution approach undertaking linear and non linear constraints takes advantage of the special features of signal processing applications. Finally, our mapping tool developped with the ECLAIR solver is evaluated and compared to a classical approach.
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
C. Ancourt, D. Barthou, C. Guettier, F. Irigoin, B. Jeannet, J. Jourdan, and J. Mattioli. Automatic mapping of signal processing applications onto parallel computers. In Proc. ASAP 97, Zurich, july 1997.
J.M. Anderson and M.S. Lam. Global optimizations for parallelism and locality on scalable parallel machines. In SIGPLAN Conf. on Programming Language Design and Implementation, pages 112–125, Albuquerque, NM, June 1993. ACM Press.
M. Barreteau, J. Mattioli, T. Granpierre, Y. Sorel C. Lavarenne and, P. Bonnot, P. Kajifasz, F. Irigoin, C. Ancourt, and B. Dion. Prompt: A mapping environnment for telecom applications on System-On-a-Chip. In Compilers, Architecture, and synthesis for embedded systems, pages 41–48, november 2000.
A. J. Bernstein. Analysis of programs for parallel processing. IEEE Trans. on El. Computers, EC-15, 1966.
S. S. Bhattacharyya, S. Sriram, and E. A. Lee. Latency-Constrained Resynchronisation For Multiprocessor DSP Implementation. In Proceedings of ASAP’96, 1996.
E. Bixby, K. Kennedy, and U. Kremer. Automatic Data Layout Using 0-1 Integer Programming. In Proc. of the International Conference on Parallel Architectures and Compilation Techniques, August 1994.
Y. Caseau, F. Josset, F. Laburthe, B. Rottembourg, S. de Givry, J. Jourdan, J. Mattioli, and P. Savéant. Eclair at a glance. Tsi / 99-876, Thomson-CSF/LCR, 1999.
Yves Caseau, François-Xavier Josset, and François Laburthe. Claire: Combining Sets, Search and Rules to better express algorithms. In Proc. of ICLP’99, pages 245–259, Las Cruces, New Mexico, USA, November 29, December 4 1999.
Yves Caseau and François Laburthe. Introduction to the Claire programming language-Version 2.4.0. Ecole Normale Supérieure-DMI, http://www.ens.fr/~caseau/claire.html, 1996–1999.
A. Darte. On the complexity of loop fusion. Parallel Coomputing, 26(9):1175–1193, August 2000.
A. Darte, C. Diderich, M. Gengler, and F. Vivien. Scheduling the computations of a loop nest with respect to a given mapping. In Eighth International Workshop on Compilers for Parallel Computers, CPC2000, pages 135–150, january 2000.
A. Demeure, B. Marchand, J. Jourdan, J. Mattioli, F. Irigoin, C. Ancourt, and all. Placement automatique optimisé d’applications de traitement du signal. Technical report, Rappport Final DRET 913060009, 1996.
M. Dion. Alignement et distribution en parallélisation automatique. Thèse informatique, ENS,LYON, 1996. 136 P.
P. Feautrier. Some efficient solutions to the affine scheduling problem, part ii: mutidimensional time. International Journal of Parallel Programming, 21(6):389–420, december 1992.
P. Feautrier. Toward Automatic Distribution. Parallel Processing Letters, 4(3):233–244, 1994.
Ch. Guettier. Optimisation globale et placement d’applications de traitement de signal sur architectures parallèles utilisant la programmation logique avec contraintes. PhD thesis, Ecole des Mines de Paris, 1997.
C. Han, K.-J. Lin, and C.-J. Hou. Distance Constrained Scheduling and its Applications to Real-Time Systems. IEEE Transactions On Computers, 45(7):814–825, Jul 1996.
W. Harvey. Computing two-dimensional integer hulls. Society for Industrial and Applied Mathematics, 28(6):2285–2299, 1999.
J. Jourdan. Concurrence et coopération de modèles multiples dans les langages de contraintes CLP et CC: Vers une méthodologie de programmation par modélisation. PhD thesis, Université Denis Diderot, Paris VII, février 1995.
J. Jourdan. Concurrent constraint multiple models in clp and cc languages: Toward a programming methodology by modelling. In Proc. INFORMS conference, New Orleans, USA, October 1995.
U. Kremer. NP-completeness of Dynamic Remapping. In Workshop on Compilers for Parallel Computers, Delft, pages 135–141, December 1993.
E. A. Lee and D. G. Messerschmitt. Synchronous Dataflow. In Proceedings of the IEEE, September 1987.
Lockheed Martin. GEDAE Users’ Manual / GEDAE Training Course Lectures.
B. Meister. Localit’e des données dans les opérations stencil. In Treizième Rencontres Francophones du Parallèlisme des Architectures et des Systémes, Compilation et Parallélisation automatique, pages 37–42, avril 2001.
P. Murthy, S. S. Bhattacharyya, and E. A. Lee. Minimising Memory Requirements for Chain-Structured Synchronous Dataflow Programs. In Proceedings of the International Conference on Acoustics, Speecha nd Signal Processing, April 1994., 1996.
N. Museux. De la sur-approximation des dépendances. Technical Report E/227/CRI, ENSMP/CRI, 2000.
N. Museux, F. Irigoin, M. Barreteau, and J. Mattioli. Parallélisation automatique d’applications de traittement du signal sur machines parallèles. In Treizième Rencontres Francophones du Parallélisme des Architectures et des Systèmes, Compilation et Parallélisation automatique, pages 55–60, avril 2001.
P. Saveant. Constraint reduction at the type level. In Proceedings of TRICS: Techniques foR Implementing Constraint programming Systems, a post-conference workshop of CP 2000, Singapore, 2000.
L. Schäfers and C. Scheidler. trapper: A graphical programming environment for embedded mimd computers. In IOS Press, editor, 1993 World Transputer Congress, Transputer Applications and Systems’93, pages 1023–1034, 1993.
M. Schmitt and J. Mattioli. Strong and weak convex hulls in non-Euclidean metric: Theory and Application. Pattern recognition letters, 15:943–947, 1994.
Gilbert C. Sih and Edward A. Lee. Declustering: A New Multiprocessor Scheduling Technique. IEEE Transaction on Parallel and Distributed Systems, 4(6):625–637, June 1993.
Y. Sorel and C. Lavarenne. http://www-rocq.inria.fr/Syndex/pub.htm.
J. Subhlok and G. Vondran. Optimal latency-troughput tradeoffs for data parallel pipelines. In Proc. SPAA’96, Padua, Italy, 1996.
E. A. Lee team. http://ptolemy.eecs.berkeley.edu/papers.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mattioli, J., Museux, N., Jourdan, J., Savéant, P., de Givry, S. (2001). A Constraint Optimization Framework for Mapping a Digital Signal Processing Application onto a Parallel Architecture. In: Walsh, T. (eds) Principles and Practice of Constraint Programming — CP 2001. CP 2001. Lecture Notes in Computer Science, vol 2239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45578-7_57
Download citation
DOI: https://doi.org/10.1007/3-540-45578-7_57
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42863-3
Online ISBN: 978-3-540-45578-3
eBook Packages: Springer Book Archive