ACM Home Page
Please provide us with feedback. Feedback
A unified semantic approach for the vectorization and parallelization of generalized reductions
Full text PdfPdf (776 KB)
Source International Conference on Supercomputing archive
Proceedings of the 3rd international conference on Supercomputing table of contents
Crete, Greece
Pages: 186 - 194  
Year of Publication: 1989
ISBN:0-89791-309-4
Authors
Pierre Jouvelot  CAI, Ecole des Mines de Paris, Fontaineblcau, LCS, Massachusetts Institute of Technology, Cambridge
Babak Dehbonei  Corporate Research Center, BULL, Louveciennes
Sponsors
Computer Tech Inst. : Computer Technology Institute
SIGARCH: ACM Special Interest Group on Computer Architecture
SIAM : Society for Industrial and Applied Mathematics
AICA : Assoc Italianai de Calcolo Automatico
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 15,   Citation Count: 11
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/318789.318810
What is a DOI?

ABSTRACT

Generalized reductions include some of the most well known programming idioms, for instance loop invariant variables, induction variables and reduction operations. We propose a unified framework that allows the detection of these paradigms and thus the efficient parallel implementation of programs that use these otherwise parallel-inhibiting constructs. Moreover, using a semantic-based symbolic evaluator, this technique is able to detect parallelizable constructs inside standard benchmarks that no other vectorizer or parallelizer can currently handle. An interesting by-product of our approach is that correctness proofs can be based on the sound and powerful abstract interpretation theory. This method has been implemented in the Velour vectorizer under current development at the Bull Research Center.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
ASU86
Aho, A. V., Sethi, R., and ~Ullman J. D. Compilers. Addison Wesley, 1986.
 
B75
Bledsoe, W. W. A New Method for Proving Certain Presburger Formulas. In ~th IJCAI, Tbilissi, September 1975.
 
B84
Barendregt, H. The Lambda-Calculus: Its Syntax and Semantics. North Holland, 1984.
 
C86
Chailloux, J. & al, Le_Lisp Version 15.2. INRIA Tech. Rep., May 1986.
CC77
CCKT86
 
CDL88
CH78
 
CR81
Clarke, A. L., and Richardson, D. J. Symbolic Evaluation Methods' Implementations and Applications. In Computer Program Testing, North- Holland, 1981.
 
DM88
Dehbonei, B., and Memmi, G. Velour: A New Vectorizing Compiler Prototype. in Proceedings of the ICS'88, Boston, May 1988, pp. 431-440.
 
E86
 
F88
Feautrier, P. Semantical Analysis and Mathematical Programming. In Int. Workshop on Parallel and Distributed Algorithms, Bonus, September 1988.
 
J86
 
K88
Keech, M.S. Test Loops for Fortran ~00 Vecto.rizer. FSUCC Tech. Rep. 2, April 88.
 
LT85
Lichnewsky, A., and Thomasset, F. Techniques de Base pour t'Ezploitaiion Aulomatique du Paralldlisme duns les Program,n. es. {NRIA Res. Rep. 460, 1985.
LT88
MR79
 
S77
TIF86

CITED BY  11

Collaborative Colleagues:
Pierre Jouvelot: colleagues
Babak Dehbonei: colleagues