ACM Home Page
Please provide us with feedback. Feedback
Correctness properties in a shared-memory parallel language
Full text PdfPdf (395 KB)
Source Journal of the ACM (JACM) archive
Volume 49 ,  Issue 6  (November 2002) table of contents
Pages: 785 - 827  
Year of Publication: 2002
ISSN:0004-5411
Author
Gilbert Caplain  CERMICS, Marne-La-Vallée, France
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 45,   Citation Count: 0
Additional Information:

abstract   references   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/602220.602224
What is a DOI?

ABSTRACT

We study a property of correctness of programs written in a shared-memory parallel language. This property is a semantic equivalence between the parallel program and its sequential version, that we define. We consider some standard parallel imperative language. Within this language, this correctness property follows from the preservation of data dependences by the control flow and the synchronizations. Our result makes use of the semantics of the sequential version only. Hence, through our result, checking the correctness of some parallel program boils down to verifying properties of some sequential program.


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.

 
1
Aho, A., Sethi, R., and Ullman, J. D. 1986. Compilers. Addison-Wesley, Reading Mass.
2
 
3
Caplain, G. 1998. Propriétés de correction séquentielle dans un langage parallèle à mémoire partagée. Ph.D. dissertation. Ecole Nationale des Ponts et Chaussées, Sept. http://cermics.enpc.fr/theses/.
 
4
Caplain, G. 1999. Checking sequential correctness in shared-memory parallel programs. In Proceedings of the 8th International Colloquium on Numerical Analysis and Computer Science with Applications (Plovdiv, Bulgaria, Aug.). Published in: Int. J. Diff. Eq. Appl. 1A, 4, 2000.
 
5
Caplain, G., Lalement, R., and Salset, T. 1993. Semantic analysis of a control-parallel extension of Fortran. Tech. Rep. 93-18. CERMICS.
 
6
 
7
CILK Group. 2002. The Cilk Project Web page. http://supertech.lcs.mit.edu/cilk/home/intro.html.
8
9
 
10
 
11
Feautrier, P. 1991. Dataflow analysis of array and scalar references. Int. J. Paral. Prog. 20, 1 (Feb.), 23--53.
 
12
13
14
15
 
16
Lamport, L. 1979. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans. Comput. C--28, 690--691.
 
17
 
18
 
19
OpenMP. 1997. A proposed industry standard API for shared memory programming. Technical report, October. http://www.openmp.org/.
 
20
Pancake, C. 1992. Parallel Processing Model for High Level Programming Languages. ANSI. March (Proposed Standard).
21
 
22
Raynal, M. 1991. About logical clocks for distributed systems. Publication interne IRISA no607, October.
23
 
24
Salset, T. 1997. Correction séquentielle de programmes parallèles dans le modèle asynchrone et mémoire partagée. Ph.D. dissertation. Ecole Nationale des Ponts et Chaussées, July. http://cermics. enpc.fr/theses/.
 
25
 
26
 
27
X3H5. 1992. FORTRAN 77 Binding of X3H5 Model for Parallel Programming Constructs. ANSI, New York, Sept. (draft version).
28