Parameterized Polyhedra and Their Vertices

International Journal of Parallel Programming

Volumn 25, Issue 6, 1997, Pages 525-549

  Loechner, Vincent ^a   Wilde, Doran K ^b  

^a UNIVERSITÉ DE STRASBOURG   (France)

^b Department of Electrical and Computer Engineering   (United States)

Author keywords

Face lattice; Parametric analysis; Polyhedra; Polyhedron; Symbolic analysis; Systems of affine recurrence equations

Indexed keywords

C (PROGRAMMING LANGUAGE); COMPUTATIONAL METHODS; PARALLEL PROCESSING SYSTEMS;

PARAMETERIZED AFFINE RECURRENCE EQUATIONS (PARE); PARAMETERIZED POLYHEDRA; PARAMETRIC ANALYSIS;

PARALLEL ALGORITHMS;

EID: 0031381304     PISSN: 08857458     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1025117523902     Document Type: Article

References (19)

1. C. Mongenet, Ph. Clauss, and G. R. A. Perrin, Geometrical Coding to Compile Affine Recurrence Equations on Regular Arrays, Fifth Parallel Processing Symp., IPPS'91, Anaheim, California (1991).
2. S. Rajopadhye, Synthesizing Systolic Arrays with Control Signals from Recurrence Equations, Distributed Computing, 3:88-105 (1989).
3. V. Van Dongen and P. Quinton, The Mapping of Linear Recurrence Equations on Regular Arrays, Journal of VLSI Signal Processing, 1:95-113 (1989).
4. V. Loechner and Ph. Clauss, Parametric Analysis of Polyhedral Iteration Spaces, International Conference ASAP'96, Chicago, Illinois, pp. 415-424 (August 1996).
5. V. Loechner and C. Mongenet, OPERA: A Toolbox for Loop Parallelization, First Int. Workshop on Software Engineering for Parallel and Distributed Systems, PDSE'96, Berlin (March 1996).
6. Günter Ziegler, Lectures on Polytopes, Graduate Texts in Mathematics, No. 152, Springer-Verlag, New York (1995).
7. A. Schrijver, Theory of Linear and Integer Programming, John Wiley and Sons, New York (1986).
8. D. Avis and D. Bremner, How Good are Convex Hull Algorithms? 11th Ann. ACM Symp. on Computational Geometry, Vancouver, B. C., pp. 20-26 (June 1995).
9. D. K. Wilde, A Library for Doing Polyhedral Operations, Master's Thesis, Oregon State University, Corvallis, Oregon (December 1993). Also published in IRISA Technical Report PI 785, Rennes, France (1993).
10. D. K. Wilde, A Library for Doing Polyhedral Operations, Master's Thesis, Oregon State University, Corvallis, Oregon (December 1993). Also published in IRISA Technical Report PI 785, Rennes, France (1993).
11. T. S. Motzkin, H. L. Raiffa, G. Thompson, and R. M. Thrall, The Double Description Method (1953). Republished in Theodore S. Motzkin: Selected Papers, Birkhauser, Boston (1983).
12. F. Fernández and P. Quinton, Extension of Chernikova's Algorithm for Solving General Mixed Linear Programming Problems, Technical Report 437, IRISA, Rennes (1988).
13. H. Le Verge, A Note on Chernikova's Algorithm, Technical Report 635, IRISA, Rennes (1992).
14. A. J. Goldman, Resolution and Separation Theorems for Polyhedral Convex Sets. In H. W. Kuhn and A. W. Tucker (Eds.), Linear Inequalities and Related Systems, Princeton University, New Jersey (1956).
15. K. Fukuda and V. Rosta, Combinatorial Face Enumeration in Convex Polytopes, Computational Geometry, 4:191-198 (1994).
16. Paul Feautrier, Some Efficient Solutions to the Affine Scheduling Problem. Part I. One-dimensional time, IJPP 21(5):313-348 (1992).
17. Paul Feautrier, Some Efficient Solutions to the Affine Scheduling Problem. Part II. Multidimensional Time, IJPP 21(6):389-420 (1992).
18. P. Feautrier, Parametric Integer Programming, RAIRO Recherche Opérationelle, 22(3): 243-268 (1988).
19. V. Loechner and C. Mongenet, Solutions to the Communication Minimization Problem for Affine Recurrence Equations, Euro-Par'97, Passau (August 1997).