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 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. Di...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | The Scientific World Journal |
| Online Access: | http://dx.doi.org/10.1155/2014/839121 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849306896821911552 |
|---|---|
| author | Mohamed A. El-Zawawy |
| author_facet | Mohamed A. El-Zawawy |
| author_sort | Mohamed A. El-Zawawy |
| collection | DOAJ |
| description | 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). |
| format | Article |
| id | doaj-art-1deb7f32142c48e79e3f6e6443defe90 |
| institution | Kabale University |
| issn | 2356-6140 1537-744X |
| language | English |
| publishDate | 2014-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | The Scientific World Journal |
| spelling | doaj-art-1deb7f32142c48e79e3f6e6443defe902025-08-20T03:54:56ZengWileyThe Scientific World Journal2356-61401537-744X2014-01-01201410.1155/2014/839121839121Frequent Statement and Dereference Elimination for Imperative and Object-Oriented Distributed ProgramsMohamed A. El-Zawawy0College of Computer and Information Sciences, Al Imam Mohammad Ibn Saud Islamic University (IMSIU), Riyadh 11432, Saudi ArabiaThis 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).http://dx.doi.org/10.1155/2014/839121 |
| spellingShingle | Mohamed A. El-Zawawy Frequent Statement and Dereference Elimination for Imperative and Object-Oriented Distributed Programs The Scientific World Journal |
| title | Frequent Statement and Dereference Elimination for Imperative and Object-Oriented Distributed Programs |
| title_full | Frequent Statement and Dereference Elimination for Imperative and Object-Oriented Distributed Programs |
| title_fullStr | Frequent Statement and Dereference Elimination for Imperative and Object-Oriented Distributed Programs |
| title_full_unstemmed | Frequent Statement and Dereference Elimination for Imperative and Object-Oriented Distributed Programs |
| title_short | Frequent Statement and Dereference Elimination for Imperative and Object-Oriented Distributed Programs |
| title_sort | frequent statement and dereference elimination for imperative and object oriented distributed programs |
| url | http://dx.doi.org/10.1155/2014/839121 |
| work_keys_str_mv | AT mohamedaelzawawy frequentstatementanddereferenceeliminationforimperativeandobjectorienteddistributedprograms |