Uniformization of affine dependence programs for parallel embedded system design

Proceedings of the International Conference on Parallel Processing

Volumn 2001-January, Issue , 2001, Pages 205-213

  Manjunathaiah, M ^a   Megson, G M ^b   Rajopadhye, S ^c   Risset, T ^c  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF READING   (United Kingdom)

^c CAMPUS DE BEAULIEU   (France)

Author keywords

Computer applications; Computer architecture; Difference equations; Embedded system; High performance computing; Prototypes; Routing; Silicon; Systolic arrays; Very large scale integration

Indexed keywords

COMPUTER APPLICATIONS; COMPUTER ARCHITECTURE; DIFFERENCE EQUATIONS; EMBEDDED SOFTWARE; HIGH LEVEL SYNTHESIS; PARALLEL PROCESSING SYSTEMS; SIGNAL PROCESSING; SILICON; SYSTOLIC ARRAYS; VLSI CIRCUITS;

AFFINE RECURRENCE EQUATIONS; AUTOMATIC SYSTEMS; HIGH PERFORMANCE COMPUTING; HIGHLY PARALLELS; PARALLEL EMBEDDED SYSTEMS; POLYHEDRAL REPRESENTATION; PROTOTYPES; ROUTING;

EMBEDDED SYSTEMS;

EID: 84951088843     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.2001.952064     Document Type: Conference Paper

References (26)

1. K. Danckaert. Loop Transformations for Data Transfer and Storage Reduction on Multiprocessor Systems. PhD thesis, Katholoeke Universiteit Leuven, 2001.
2. E. Deprettere, E. R. a nd P. Lieverse, and B. Kienhuis. Compaan: Deriving Process Networks from Matlab for Embedded Signal Processing Architectures. In 8th International Workshop on Hardware/Software Codesign (CODES'2000), San Diego, CA, May 2000.
3. V. V. Dongen and P. Quinton. Uniformization of linear recurrence equations: a step towards the automatic synthesis of systolic arrays. In K. B. et al. eds., editor, International Conference on Systolic Arrays, pages 473-482. IEEE Computer Society Press, 1988.
4. F. Dupont de Dinechin, P. Quinton, S. Rajopadhye, and T. Risset. First Steps in Alpha. Technical Report 1244, Irisa, 1999.
5. R. S. et al. High-Level Synthesis of Non Programmable Hardware Accelerators. In IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP 2000), Boston, July 2000.
6. P. Feautrier. Dataflow analysis of array and scalar references. Int. J. Parallel Programming, 20(1):23-51, 1991.
7. P. Feautrier. Some efficient solutions to the affine scheduling problem, part I, one dimensional time. Int. J. of Parallel Programming, 21(5):313-348, Oct. 1992.
8. J. Fortes and D. Moldovan. Data broadcasting in linear schedule array processors. In 11'th Annual Symp. on Computer Architecture, pages 224-231, 1984.
9. G.M. Megson and D. Comish. Systolic algorithm design environments (SADEs). In Transformational Approaches to Systolic Design, chapter 9. London : Chapman and Hall, 1994.
10. C. Lengauer. Loop parallelization in the polytope model. In E. Best, editor, CONCUR '93, Lecture Notes in Computer Science 715, pages 398-416. Springer-Verlag, 1993.
11. J. Li and M. Chen. The data alignent phase in compiling programs for distributed memory machines. Journal Parallel Distributed Computing, 13:213-221, 1991.
12. M. Manjunathaiah, S. Rajopadhye, and T. Risset. Uniformization tool for systolic array designs. Technical Report 1350, Irisa, Rennes, 2000.
13. G. Megson and L. Rapanotti. Uniformization techniques for reducible integral recurrence equations. In Algorithms and Parallel VLSI Architectures III, pages 283-296. Elsevier Science Publishers B.V., 1995.
14. C. Mongenet. Affine dependence classification for communications minimization. International Journal of Parallel Programming, 25(6):497-524, 1997.
15. P. Quinton. The systematic design of systolic arrays. In Automata networks in Computer Science, pages 229-260. Manchester University Press, 1987.
16. P. Quinton and V. V. Dongen. The mapping of linear recurrence equations on regular arrays. Journal of VLSI Signal Processing, 1:93-113, 1989.
17. P. Quinton, S. V. Rajopadhye, and T. Risset. On manipulating Z-polyhedra using a canonical representation. Parallel Processing Letters, 7(2):181-194, June 1997.
18. S. V. Rajopadhye, S. Purushothaman, and R. M. Fujimoto. On synthesizing systolic arrays from recurrence equations with linear dependencies. In Proceedings, Sixth Conference on Foundations of Software Technology and Theoretical Computer Science, pages 488-503, New Delhi, India, December 1986. Springer Verlag, LNCS 241.
19. L. Rapanotti. On the Synthesis of Integral and Dynamic Recurrences. PhD thesis, University of Newcastle upon Tyne, U.K., March 1996.
20. L. Rapanotti and G.M.Megson. Pre-processing in SADE : Stage III. Technical Report 471, The University of Newcastle upon Tyne, Computing Science, U.K., March 1994.
21. V. Roychowdhury. Derivation, Extensions and Parallel Implementation of Regular Iterative Algorithms. PhD thesis, Stanford University, Department of Electrical Engineering, Stanford, CA, December 1988.
22. A. Schrijver. Theory of Linear and Integer Programming. Wiley Interscience series in Discrete Mathematics and Optimisation, 1986.
23. W. Shang, E. Hodzic, and Z. Chen. On uniformization of affine dependences algorithms. IEEE Transactions on Computers, 45(7):827-840, June 1996.
24. D. Wilde and S. Rajopadhye. Memory reuse analysis in the polyhedral model. In EUROPAR 96: Parallel Processing Conference, pages 389-397, Lyon, France, August 1996. Springer Verlag.
25. Y. Wong and J. Delosme. Transformation of broadcasts to propagations in systolic algorithms. Journal of Parallel and Distributed Computing, 14(2):121-145, 1992.
26. Y. Yaacoby and P. R. Cappello. Converting affine recurrence equations to quasi-uniform recurrence equations. In AWOC 1988: Third International Workshop on Parallel Computation and VLSI Theory. Springer Verlag, June 1988.