M. Rinard and P. Diniz. Semantic foundations of commutativity analysis. Technical Report TRCS96-09, Dept. of Computer Science, University of California at Santa Barbara, May 1996.  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Data Flow Analysis of Recursive Structures - Cohen, Collard, Griebl (1996) (2 citations) (Correct)
....grid can be seen as: G = ha; b ji Another proposal to express quite general graphs in an elegant way is due to Klarlund and Schwartzbah [6] However, none of these works tackle data flow analysis. In this sense, our work is more remiscent from the work of Hendren et al. 7] Rinard and Diniz [14] proposed an analysis that detects commuting (so, parallel) computations in C programs that manipulate recursive data structures. Even though they handle more general structures than we do, their analysis is local (i.e. does not take global properties of the structure into account) and is based ....
M. C. Rinard and P. C. Diniz. Semantic foundations of commutativity analysis. In L. Boug'e et al., editor, Euro-Par'96. Parallel Processing, volume 1123 of LNCS, pages 414--423, Lyon, France, August 1996. Springer-Verlag.
Semantic Foundations of Commutativity Analysis - Rinard, Diniz (1996) (1 citation) Self-citation (Rinard Diniz) (Correct)
No context found.
M. Rinard and P. Diniz. Semantic foundations of commutativity analysis. Technical Report TRCS96-09, Dept. of Computer Science, University of California at Santa Barbara, May 1996.
Http://www.cs.ucsb.edu/¸fmartin,pedrog - Dr Og Self-citation (Rinard Diniz) (Correct)
....with identical memories. Conversely, if a parallel computation terminates, then the serial computation also terminates with an identical memory. 5 Analysis We have developed a formal semantics that, given a program, defines the receiver effect and invoked operation functions for that program [6]. We have also developed a static analysis algorithm that analyzes pairs of methods to determine if they meet the commutativity testing conditions in Section 3. The foundation of this analysis algorithm is symbolic execution [4] Symbolic execution simply executes the methods, computing with ....
....equality. If the expressions denote the same value, the operations commute. We have proved a correspondence between the static analysis algorithm and the formal semantics, and used the correspondence to prove that the algorithms used in the compiler correctly identify parallelizable computations [6]. 6 Experimental Results We have implemented a prototype parallelizing compiler that uses commutativity analysis as its basic analysis technique. The compiler also uses several other analysis techniques to extend the model of computation significantly beyond the basic model of computation ....
M. Rinard and P. Diniz. Semantic foundations of commutativity analysis. Technical Report TRCS96-09, Dept. of Computer Science, University of California at Santa Barbara, May 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC