Scanning parameterized polyhedron using Fourier-Motzkin elimination

Concurrency Practice and Experience

Volumn 8, Issue 6, 1996, Pages 445-460

  Le Fur, Marc ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTATIONAL METHODS; CONSTRAINT THEORY; PROGRAM COMPILERS; RESPONSE TIME (COMPUTER SYSTEMS); VECTORS;

COMPUTATION TIME; EXECUTION TIME; FOURIER-MOTZKIN ELIMINATION; PARAMETERIZED POLYHEDRON; SUCCESSIVE PROJECTION METHOD;

ALGORITHMS;

EID: 12444284418     PISSN: 10403108     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1096-9128(199607)8:6<445::AID-CPE253>3.0.CO;2-G     Document Type: Article

References (16)

1. M. E. Wolf and M. S. Lam, 'A loop transformation theory and an algorithm to maximize parallelism', IEEE Transactions on Parallel and Distributed Systems, 2, (10) (1991).
2. C. Ancourt, Génération automatique de codes de transfert pour multiprocesseurs à mémoires locales, PhD thesis, Université de Paris VI, March 1991.
3. F. André, M. Le Fur, Y. Mahéo and J.-L. Pazat, 'The Pandore data-parallel compiler and its portable runtime', in High-Performance Computing and Networking, LNCS 919, Springer Verlag, Milan, Italy, May 1995.
4. S. M. Amarasinghe and M. Lam, 'Communication optimization and code generation for distributed memory machines', in ACM SIGPLAN'93 Conference on Programming Language Design and Implementation, June 1993.
5. C. Ancourt, F. Coelho, F. Irigoin and R. Keryell, 'A linear algebra framework for static HPF code distribution', in Fourth International Workshop on Compilers for Parallel Computers, Delft, The Netherlands, December 1993.
6. A. Schrijver, Theory of Linear and Integer Programming. Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley, 1986.
7. R. J. Duffin, On Fourier's analysis of linear inequality systems', Mathematical Programming Study, 1, 71-95 (1974).
8. C. Ancourt and F. Irigoin, 'Scanning polyhedra with DO loops', in Third ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, April 1991.
9. P. Feautrier, 'Semantical analysis and mathematical programming application to parallelization and vectorization', in M. Cosnard et al. (eds), Parallel and Distributed Algorithms, Elsevier Science Publishers B.V. (North Holland), 1989, pp. 309-320.
10. J.-F. Collard, P. Feautrier and T. Risset, Construction of DO Loops from Systems of Affine Constraints, Research Report 93-15, LIP, Lyon, France, May 1993.
11. H. Le Verge, V. Van Dongen and D. K. Wilde, Loop Nest Synthesis Using the Polyhedral Library, Research Report 2288, INRIA, France, May 1994.
12. H. Le Verge, A Note on Chernikova's Algorithm, Research Report 1662, INRIA, France, April 1992.
13. M.C. Cheng, 'General criteria for redundant and nonredundant linear inequalities', Journal of Optimization Theory and Applications, 53 (1), 37-42 (1987).
14. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization : Algorithms and Complexity, Prentice-Hall, 1982.
15. F. Irigoin, Partitionnement de boucles imbriquées. Une technique d'optimisation pour les programmes scientifiques. Ph.D. thesis, Université Pierre et Marie Curie, June 1987.
16. M.-V. Aponte, A. Lavaille, M. Mauny, A. Suarez and P. Weis, The CAML Reference Manual. Technical Report 121, INRIA, France, September 1990.