Abstract
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.
Keywords
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.
Partially supported by University of Akron, Grant No. FRG 1391
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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.
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.
U. Banerjee, Dependence Analysis. 101 Philip Drive, Assinippi Park, Norwell, MA, USA, 02061: Kluwer Academic Publishers, 1997.
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.
P. Feautrier, “Dataflow analysis of array and scalar reverences,” International Journal of Parallel Programming, Vol. 20, pp. 23–53, Feb. 1991.
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.
A. Schrijver, Theory of Linear and Integer Programming. Wiley-Interscience Series in Discrete mathematics and Optimization, New York: Johm Wiley & Sons, 1986. Reprinted 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
d’Auriol, B.J. (2000). A Geometric Semantics for Program Representation in the Polytope Model. In: Carter, L., Ferrante, J. (eds) Languages and Compilers for Parallel Computing. LCPC 1999. Lecture Notes in Computer Science, vol 1863. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44905-1_29
Download citation
DOI: https://doi.org/10.1007/3-540-44905-1_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67858-8
Online ISBN: 978-3-540-44905-8
eBook Packages: Springer Book Archive