Frequent Statement and De-reference Elimination for Distributed Programs

El-Zawawy, Mohamed A.

doi:10.1007/978-3-642-39646-5_7

Cited by 3 publications

(5 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The set of types of our ready type system has the form: points - to - types × P ( Stmt + ∪ gAddrs ), where Stmt + is the set of nontrivial statements ( Figure 2 ), gAddrs is the set of global addresses. This set is defined precisely in the appendix of [ 6 ], and points-to-types is a set of points-to-types (typically have the form of maps from the union of variables and global addresses to the power set of global addresses [ 4 , 7 ]). …”

Section: Ready Statement and Memory Access Analysis Of Wmentioning

confidence: 99%

“…We note that numbers, variables, and the allocating statement ( new ) do not affect the ready pretype. In line with semantic rules ( i op r ) and ( b op r ) [ 6 ], nontrivial arithmetic and Boolean statements and their nontrivial substatements are made ready . The direct assignment rule (∶= r ) expresses that after executing the assignment the substatements of r.h.s.…”

Section: Ready Statement and Memory Access Analysis Of Wmentioning

confidence: 99%

“…Suppose that ( s , h ) is a state defined on the set of locations Loc ([ 6 , Definition 4]). Suppose also that ( s ∗ , h ∗ ) is a state defined on Loc ∪ Stmt - names .…”

Section: Frequent Statement and Dereference Elimination Of mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…This paper is an extended and revised version of [ 6 ], which treats imperative distributed programs. The work of [ 6 ] was generalized in Section 5 of the current paper to cover object-oriented distributed programs. The soundness theorems of the current paper are stated using memory model and operational semantics in the appendix of [ 6 ].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Frequent Statement and Dereference Elimination for Imperative and Object-Oriented Distributed Programs

El-Zawawy

2014

The Scientific World Journal

Self Cite

View full text Add to dashboard Cite

This paper introduces new approaches for the analysis of frequent statement and dereference elimination for imperative and object-oriented distributed programs running on parallel machines equipped with hierarchical memories. The paper uses languages whose address spaces are globally partitioned. Distributed programs allow defining data layout and threads writing to and reading from other thread memories. Three type systems (for imperative distributed programs) are the tools of the proposed techniques. The first type system defines for every program point a set of calculated (ready) statements and memory accesses. The second type system uses an enriched version of types of the first type system and determines which of the ready statements and memory accesses are used later in the program. The third type system uses the information gather so far to eliminate unnecessary statement computations and memory accesses (the analysis of frequent statement and dereference elimination). Extensions to these type systems are also presented to cover object-oriented distributed programs. Two advantages of our work over related work are the following. The hierarchical style of concurrent parallel computers is similar to the memory model used in this paper. In our approach, each analysis result is assigned a type derivation (serves as a correctness proof).

show abstract

Section: Ready Statement and Memory Access Analysis Of Wmentioning

confidence: 99%

Section: Ready Statement and Memory Access Analysis Of Wmentioning

confidence: 99%

“…Suppose that ( s , h ) is a state defined on the set of locations Loc ([ 6 , Definition 4]). Suppose also that ( s ∗ , h ∗ ) is a state defined on Loc ∪ Stmt - names .…”

Section: Frequent Statement and Dereference Elimination Of mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%