A Geometric Semantics for Program Representation in the Polytope Model

  • Brian J. d’Auriol
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1863)


A new geometric framework for parallel program representation is proposed to address the difficulties of parallel programming. The focus of this work is the expression of collections of computations and the inter-, intra-relationships thereof. Both linguistic and non-linguistic carried geometric semantics are presented and characterized. A formal review of the basic Polytope Model is given.


Basis Vector Geometric Representation Loop Nest Program Representation Coordinate Reference System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    C. Lengauer, “Loop parallelization in the polytope model,” CONCUR’93, 1993, E. Best, (ed.), Lecture Notes in Computer Science 715, Springer-Verlag, pp. 398–416, 1993.Google Scholar
  2. 2.
    P. Feautrier, “Automatic parallelization in the polytope model,” in The Data Parallel Programming Model, G. Perrin and A. Darte, (eds.), Lecture Notes in Computer Science 1132, pp. 79–103, Springer-Verlag, 1996.Google Scholar
  3. 3.
    U. Banerjee, Dependence Analysis. 101 Philip Drive, Assinippi Park, Norwell, MA, USA, 02061: Kluwer Academic Publishers, 1997.zbMATHGoogle Scholar
  4. 4.
    B. J. d’Auriol, S. Saladin, and S. Humes, “Linguistic and non-linguistic semantics in the polytope model,” Tech. Rep. TR99-01, Akron, Ohio, 44325-4002, January 1999.Google Scholar
  5. 5.
    P. Feautrier, “Dataflow analysis of array and scalar reverences,” International Journal of Parallel Programming, Vol. 20, pp. 23–53, Feb. 1991.Google Scholar
  6. 6.
    B. J. d’Auriol, “Expressing parallel programs using geometric representation: Case studies,” Proc. of the IASTED International Conference Parallel and Distributed Computing and Systems (PDCS’99), Cambridge, MA, USA, Nov., 3–6, 1999, Nov. 1999. in press.Google Scholar
  7. 7.
    A. Schrijver, Theory of Linear and Integer Programming. Wiley-Interscience Series in Discrete mathematics and Optimization, New York: Johm Wiley & Sons, 1986. Reprinted 1998.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Brian J. d’Auriol
    • 1
  1. 1.Dept. of Computer ScienceThe Univ. of Texas at El PasoEl Paso

Personalised recommendations