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

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