Optimizing Memory Usage in the Polyhedral Model

ACM Transactions on Programming Languages and Systems

Volumn 22, Issue 5, 2000, Pages 773-815

  Quilleré, Fabien ^a   Rajopadhye, Sanjay ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

C.1.2 Processor Architectures : Multiprocessors array processors; D.3.4 Programming Languages : Processors compilation; Languages; Memory management; Optimization; SIMD processors

Indexed keywords

EID: 0038485313     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/365151.365152     Document Type: Article

References (38)

1. AHO, A. V., SETHI, R., AND ULLMAN, J. D. 1986. Compilers: Principles, Techniques, and Tools. Addison-Wesley, Reading, MA, USA.
2. ALLEN, J. R. AND KENNEDY, K. 1984. Automatic loop interchange. In Proceedings of the SIGPLAN '84 Symposium on Compiler Construction. ACM Press, ACM Press, New York, NY 10036, USA, 233-246.
3. ARVIND, NIKHIL, R. S., AND PINGALI, K. K. 1989. I-structures: Data structures for parallel computing. ACM Transactions on Programming Languages and Systems 11, 4 (October), 598-632.
4. BANERJEE, U. 1993. Loop Transformations for Restructuring Compilers: The Foundations. Norwell, Mass.: Kluwer Academic Publishers.
5. CHAMSKI, Z. 1993. Environnement logiciel de programmation d'un accélérateur de calcul parallèle. Ph.D. thesis, Université de Rennes 1.
6. DARTE, A. 1991. Regular partitioning for synthesizing fixed-size systolic arrays. Integration: The VLSI Journal 12, 293-304.
7. DE GREEF, E., CATTHOOR, F., AND DE MAN, H. 1996. Reducing storage size for static control programs mapped to parallel architectures. presented at Dagstuhl Seminar on Loop Parallelization.
8. DE GREEF, E., CATTHOOR, F., AND DE MAN, H. 1997. Memory size reduction through storage order optimization for embedded parallel multimedia applications. In Parallel Processing and Multimedia. Geneva, Switzerland.
9. FEAUTRIER, P. 1988. Parametric integer programming. Rairo Recherche Opérationnelle 22, 3 (Sept.), 243-268.
10. FEAUTRIER, P. 1991. Dataflow analysis of array and scalar references. International Journal of Parallel Programming 20, 1 (Feb), 23-53.
11. FEAUTRIER, P. 1992. Some efficient solutions to the affine scheduling problem, part I, one dimensional time, and part II, multidimensional time. International Journal of Parallel Programming 21, 5-6 (Oct.), 313-348, 389-420.
12. FEO, J., CANN, D., AND OLDEHOEFT, R. 1990. A report on the sisal language project. Journal of Parallel and Distributed Computing 10, 349-366.
13. GOLUB, G. H. AND VAN LOAN, C. F. 1983. Matrix computations. The Johns Hopkins University Press.
14. GRIEBL, M. AND LENGAUER, C. 1996. The loop parallelizer LooPo. In Proc. Sixth Workshop on Compilers for Parallel Computers, M. Gerndt, Ed. Konferenzen des Forschungszentrums Jülich, vol. 21. Forschungszentrum Jülich, 311-320.
15. HUDAK, P. AND BLOSS, A. 1985. The aggregate update problem in functional programming systems. In ACM Symposium on Principles of Programming Languages. ACM, New Orleans, LA, 300-314.
16. KARP, R., MILLER, R., AND WINOGRAD, S. 1967. The organization of computations for uniform recurrence equations. Journal of the Association for Computing Machinery 14, 3 (July), 563-590.
17. KELLER, R. M. AND SLEEP, M. R. 1986. Applicative caching. ACM Transactions on Programming Languages and Systems 8, 1 (January), 88-108.
18. KNOBE, K. AND DALLY, W. J. 1995. The subspace model: A theory of shapes for parallel systems. In 5th Workshop on Compilers for Parallel Computers. Malaga, Spain.
19. LE VERGE, H., MAURAS, C., AND QUINTON, P. 1991. The Alpha language and its use for the design of systolic arrays. Journal of VLSI Signal Processing 3, 3 (Sept.), 173-182.
20. LEFEBVRE, V. AND FEAUTRIER, P. 1997. Optimizing storage size for static control programs in automatic parallelizers. In Euro-Par'97, Lengauer, Griebl, and Gorlatch, Eds. Lecture Notes in Computer Science, vol. 1300. Springer-Verlag.
21. LI, J. AND CHEN, M. 1991. The data alignment phase in compiling programs for distributed-memorymachines. Journal of Parallel and Distributed Computing 13, 2 (Oct.), 213-221.
22. LOECHNER, V. AND MONGENET, C. 1995. A toolbox for affine recurrence equations parallelization. Lecture Notes in Computer Science 919, 263-??
23. MAURAS, C. 1989. Alpha : un langage équationnel pour la conception et la programmation d'architectures systoliques. Ph.D. thesis, Université de Rennes 1.
24. MAURAS, C., QUINTON, P., RAJOPADHYE, S., AND SAOUTER, Y. 1990. Scheduling affine parameter-ized recurrences by means of variable dependent timing functions. In International Conference on Application Specific Array Processing, S. Y. Kung and E. Swartzlander, Eds. IEEE Computer Society, Princeton, New Jersey, 100-110.
25. MAYDAN, D., AMARSINGHE, S. P., AND LAM, M. 1993. Array data flow analysis and its use in array privatization. In Principles of Programming Languages. ACM, 2-15.
26. QUILLERÉ, F., RAJOPADHYE, S., AND WILDE, D. 2000. Generation of efficient nested loops from polyhedra. International Journal of Parallel Programming 28, 5 (October), (in press).
27. QUINTON, P., RAJOPADHYE, S., AND WILDE, D. 1995a. Derivation of data parallel code from a functional program. In 9th International Parallel Processing Symposium. IEEE, Santa Barbara CA, 766-772.
28. QUINTON, P., RAJOPADHYE, S., AND WILDE, D. 1995b. Deriving imperative code from functional programs. In 7th Conference on Functional Programming Languages and Computer Architecture. ACM, La Jolla, CA, 36-44.
29. QUINTON, P. AND VAN DONGEN, V. 1989. The mapping of linear recurrence equations on regular arrays. Journal of VLSI Signal Processing 1, 2, 95-113.
30. RAJOPADHYE, S. AND FUJIMOTO, R. 1990. Synthesizing systolic arrays from recurrence equations. Parallel computing 14, 163-189.
31. RAJOPADHYE, S. AND WILDE, D. 1993. Allocating memory arrays for polyhedra. PI 749, IRISA. July.
32. SCHRIJVER, A. 1987. Theory of Linear and Integer Programming. John Wiley and Sons, New York.
33. STEWART, G. W. 1973. Introduction to matrix computations. Academic Press.
34. STROUT, M. M., CARTER, L., FERRANTE, J., AND SIMON, B. 1998. Schedule-independent storage mapping for loops. ACM Sigplan Notices 33, 11 (Nov.), 24-33.
35. WILDE, D. 1993. A library for doing polyhedral operations. PI 785, Irisa. dec.
36. WILDE, D. AND RAJOPADHYE, S. 1995. The naive execution of affine recurrence equations. In International Conference on Application-Specific Array Processors. IEEE, Strasbourg, France, 1-12.
37. WILDE, D. AND RAJOPADHYE, S. 1996. Memory reuse analysis in the polyhedral model. In Euro-Par'96, Bougé, Fraignaud, Mignotte, and Robert, Eds. Lecture Notes in Computer Science, vol. 1123. Springer-Verlag, 389-397.
38. WOLFE, M. J. 1996. High Performance Compilers for Parallel Computing. Addison-Wesley.