Alias analysis of pointers in Pascal and Fortran 90: Dependence analysis between pointer references
Abstract. Vectorization and parallelization of programs written in languages where pointers are used is now a subject of increasing interest. The presence of pointers in programs, however, poses new problems to dependence analysis in vectorizing and parallelizing compilers which had been designed t...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
1996 |
|---|
| Umfang: |
32 |
|---|
| Reproduktion: |
Springer Online Journal Archives 1860-2002 |
|---|---|
| Übergeordnetes Werk: |
in: Acta informatica - 1971, 33(1996) vom: Feb., Seite 99-130 |
| Übergeordnetes Werk: |
volume:33 ; year:1996 ; month:02 ; pages:99-130 ; extent:32 |
| Links: |
|---|
| Katalog-ID: |
NLEJ202573346 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | NLEJ202573346 | ||
| 003 | DE-627 | ||
| 005 | 20210706103152.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 070528s1996 xx |||||o 00| ||eng c | ||
| 035 | |a (DE-627)NLEJ202573346 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 245 | 1 | 0 | |a Alias analysis of pointers in Pascal and Fortran 90: Dependence analysis between pointer references |
| 264 | 1 | |c 1996 | |
| 300 | |a 32 | ||
| 336 | |a nicht spezifiziert |b zzz |2 rdacontent | ||
| 337 | |a nicht spezifiziert |b z |2 rdamedia | ||
| 338 | |a nicht spezifiziert |b zu |2 rdacarrier | ||
| 520 | |a Abstract. Vectorization and parallelization of programs written in languages where pointers are used is now a subject of increasing interest. The presence of pointers in programs, however, poses new problems to dependence analysis in vectorizing and parallelizing compilers which had been designed to target only at FORTRAN77 programs. In this paper, a new method to analyze dependencies between pointer references in Pascal is proposed, which can also be applied to Fortran 90. It is designed to handle programs with dynamic data structures, such as linear linked lists or trees, which are the most common use of pointers. The method divides into two stages. The first stage is a safe alias analysis which handles any kind of dynamic data structures. The second stage focuses on the specific data structures. It first detects linear linked lists, and then performs dependence analysis between pointer references to the same list. The paper also proposes ways to enhance the second stage. Tree structures are handled here. Loops which manipulate linked lists can now be considered for vectorization by the proposed analysis. Techniques to vectorize such loops are presented in this paper. Some of the proposed algorithms are implemented in V-Pascal, the automatic vectorizing Pascal compiler of our laboratory. The effectiveness of the vectorization of list operations is proved by an experiment on HITAC S-820/80. | ||
| 533 | |f Springer Online Journal Archives 1860-2002 | ||
| 700 | 1 | |a Matsumoto, Aki |4 oth | |
| 700 | 1 | |a Han, D. S. |4 oth | |
| 700 | 1 | |a Tsuda, Takao |4 oth | |
| 773 | 0 | 8 | |i in |t Acta informatica |d 1971 |g 33(1996) vom: Feb., Seite 99-130 |w (DE-627)NLEJ188994068 |w (DE-600)1389024-4 |x 1432-0525 |7 nnns |
| 773 | 1 | 8 | |g volume:33 |g year:1996 |g month:02 |g pages:99-130 |g extent:32 |
| 856 | 4 | 0 | |u http://dx.doi.org/10.1007/s002360050037 |
| 912 | |a GBV_USEFLAG_U | ||
| 912 | |a ZDB-1-SOJ | ||
| 912 | |a GBV_NL_ARTICLE | ||
| 951 | |a AR | ||
| 952 | |d 33 |j 1996 |c 2 |h 99-130 |g 32 | ||
| matchkey_str |
article:14320525:1996----::laaayiopitripsaadota9dpnecaayib |
|---|---|
| hierarchy_sort_str |
1996 |
| publishDate |
1996 |
| allfields |
(DE-627)NLEJ202573346 DE-627 ger DE-627 rakwb eng Alias analysis of pointers in Pascal and Fortran 90: Dependence analysis between pointer references 1996 32 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Abstract. Vectorization and parallelization of programs written in languages where pointers are used is now a subject of increasing interest. The presence of pointers in programs, however, poses new problems to dependence analysis in vectorizing and parallelizing compilers which had been designed to target only at FORTRAN77 programs. In this paper, a new method to analyze dependencies between pointer references in Pascal is proposed, which can also be applied to Fortran 90. It is designed to handle programs with dynamic data structures, such as linear linked lists or trees, which are the most common use of pointers. The method divides into two stages. The first stage is a safe alias analysis which handles any kind of dynamic data structures. The second stage focuses on the specific data structures. It first detects linear linked lists, and then performs dependence analysis between pointer references to the same list. The paper also proposes ways to enhance the second stage. Tree structures are handled here. Loops which manipulate linked lists can now be considered for vectorization by the proposed analysis. Techniques to vectorize such loops are presented in this paper. Some of the proposed algorithms are implemented in V-Pascal, the automatic vectorizing Pascal compiler of our laboratory. The effectiveness of the vectorization of list operations is proved by an experiment on HITAC S-820/80. Springer Online Journal Archives 1860-2002 Matsumoto, Aki oth Han, D. S. oth Tsuda, Takao oth in Acta informatica 1971 33(1996) vom: Feb., Seite 99-130 (DE-627)NLEJ188994068 (DE-600)1389024-4 1432-0525 nnns volume:33 year:1996 month:02 pages:99-130 extent:32 http://dx.doi.org/10.1007/s002360050037 GBV_USEFLAG_U ZDB-1-SOJ GBV_NL_ARTICLE AR 33 1996 2 99-130 32 |
| spelling |
(DE-627)NLEJ202573346 DE-627 ger DE-627 rakwb eng Alias analysis of pointers in Pascal and Fortran 90: Dependence analysis between pointer references 1996 32 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Abstract. Vectorization and parallelization of programs written in languages where pointers are used is now a subject of increasing interest. The presence of pointers in programs, however, poses new problems to dependence analysis in vectorizing and parallelizing compilers which had been designed to target only at FORTRAN77 programs. In this paper, a new method to analyze dependencies between pointer references in Pascal is proposed, which can also be applied to Fortran 90. It is designed to handle programs with dynamic data structures, such as linear linked lists or trees, which are the most common use of pointers. The method divides into two stages. The first stage is a safe alias analysis which handles any kind of dynamic data structures. The second stage focuses on the specific data structures. It first detects linear linked lists, and then performs dependence analysis between pointer references to the same list. The paper also proposes ways to enhance the second stage. Tree structures are handled here. Loops which manipulate linked lists can now be considered for vectorization by the proposed analysis. Techniques to vectorize such loops are presented in this paper. Some of the proposed algorithms are implemented in V-Pascal, the automatic vectorizing Pascal compiler of our laboratory. The effectiveness of the vectorization of list operations is proved by an experiment on HITAC S-820/80. Springer Online Journal Archives 1860-2002 Matsumoto, Aki oth Han, D. S. oth Tsuda, Takao oth in Acta informatica 1971 33(1996) vom: Feb., Seite 99-130 (DE-627)NLEJ188994068 (DE-600)1389024-4 1432-0525 nnns volume:33 year:1996 month:02 pages:99-130 extent:32 http://dx.doi.org/10.1007/s002360050037 GBV_USEFLAG_U ZDB-1-SOJ GBV_NL_ARTICLE AR 33 1996 2 99-130 32 |
| allfields_unstemmed |
(DE-627)NLEJ202573346 DE-627 ger DE-627 rakwb eng Alias analysis of pointers in Pascal and Fortran 90: Dependence analysis between pointer references 1996 32 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Abstract. Vectorization and parallelization of programs written in languages where pointers are used is now a subject of increasing interest. The presence of pointers in programs, however, poses new problems to dependence analysis in vectorizing and parallelizing compilers which had been designed to target only at FORTRAN77 programs. In this paper, a new method to analyze dependencies between pointer references in Pascal is proposed, which can also be applied to Fortran 90. It is designed to handle programs with dynamic data structures, such as linear linked lists or trees, which are the most common use of pointers. The method divides into two stages. The first stage is a safe alias analysis which handles any kind of dynamic data structures. The second stage focuses on the specific data structures. It first detects linear linked lists, and then performs dependence analysis between pointer references to the same list. The paper also proposes ways to enhance the second stage. Tree structures are handled here. Loops which manipulate linked lists can now be considered for vectorization by the proposed analysis. Techniques to vectorize such loops are presented in this paper. Some of the proposed algorithms are implemented in V-Pascal, the automatic vectorizing Pascal compiler of our laboratory. The effectiveness of the vectorization of list operations is proved by an experiment on HITAC S-820/80. Springer Online Journal Archives 1860-2002 Matsumoto, Aki oth Han, D. S. oth Tsuda, Takao oth in Acta informatica 1971 33(1996) vom: Feb., Seite 99-130 (DE-627)NLEJ188994068 (DE-600)1389024-4 1432-0525 nnns volume:33 year:1996 month:02 pages:99-130 extent:32 http://dx.doi.org/10.1007/s002360050037 GBV_USEFLAG_U ZDB-1-SOJ GBV_NL_ARTICLE AR 33 1996 2 99-130 32 |
| allfieldsGer |
(DE-627)NLEJ202573346 DE-627 ger DE-627 rakwb eng Alias analysis of pointers in Pascal and Fortran 90: Dependence analysis between pointer references 1996 32 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Abstract. Vectorization and parallelization of programs written in languages where pointers are used is now a subject of increasing interest. The presence of pointers in programs, however, poses new problems to dependence analysis in vectorizing and parallelizing compilers which had been designed to target only at FORTRAN77 programs. In this paper, a new method to analyze dependencies between pointer references in Pascal is proposed, which can also be applied to Fortran 90. It is designed to handle programs with dynamic data structures, such as linear linked lists or trees, which are the most common use of pointers. The method divides into two stages. The first stage is a safe alias analysis which handles any kind of dynamic data structures. The second stage focuses on the specific data structures. It first detects linear linked lists, and then performs dependence analysis between pointer references to the same list. The paper also proposes ways to enhance the second stage. Tree structures are handled here. Loops which manipulate linked lists can now be considered for vectorization by the proposed analysis. Techniques to vectorize such loops are presented in this paper. Some of the proposed algorithms are implemented in V-Pascal, the automatic vectorizing Pascal compiler of our laboratory. The effectiveness of the vectorization of list operations is proved by an experiment on HITAC S-820/80. Springer Online Journal Archives 1860-2002 Matsumoto, Aki oth Han, D. S. oth Tsuda, Takao oth in Acta informatica 1971 33(1996) vom: Feb., Seite 99-130 (DE-627)NLEJ188994068 (DE-600)1389024-4 1432-0525 nnns volume:33 year:1996 month:02 pages:99-130 extent:32 http://dx.doi.org/10.1007/s002360050037 GBV_USEFLAG_U ZDB-1-SOJ GBV_NL_ARTICLE AR 33 1996 2 99-130 32 |
| allfieldsSound |
(DE-627)NLEJ202573346 DE-627 ger DE-627 rakwb eng Alias analysis of pointers in Pascal and Fortran 90: Dependence analysis between pointer references 1996 32 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Abstract. Vectorization and parallelization of programs written in languages where pointers are used is now a subject of increasing interest. The presence of pointers in programs, however, poses new problems to dependence analysis in vectorizing and parallelizing compilers which had been designed to target only at FORTRAN77 programs. In this paper, a new method to analyze dependencies between pointer references in Pascal is proposed, which can also be applied to Fortran 90. It is designed to handle programs with dynamic data structures, such as linear linked lists or trees, which are the most common use of pointers. The method divides into two stages. The first stage is a safe alias analysis which handles any kind of dynamic data structures. The second stage focuses on the specific data structures. It first detects linear linked lists, and then performs dependence analysis between pointer references to the same list. The paper also proposes ways to enhance the second stage. Tree structures are handled here. Loops which manipulate linked lists can now be considered for vectorization by the proposed analysis. Techniques to vectorize such loops are presented in this paper. Some of the proposed algorithms are implemented in V-Pascal, the automatic vectorizing Pascal compiler of our laboratory. The effectiveness of the vectorization of list operations is proved by an experiment on HITAC S-820/80. Springer Online Journal Archives 1860-2002 Matsumoto, Aki oth Han, D. S. oth Tsuda, Takao oth in Acta informatica 1971 33(1996) vom: Feb., Seite 99-130 (DE-627)NLEJ188994068 (DE-600)1389024-4 1432-0525 nnns volume:33 year:1996 month:02 pages:99-130 extent:32 http://dx.doi.org/10.1007/s002360050037 GBV_USEFLAG_U ZDB-1-SOJ GBV_NL_ARTICLE AR 33 1996 2 99-130 32 |
| language |
English |
| source |
in Acta informatica 33(1996) vom: Feb., Seite 99-130 volume:33 year:1996 month:02 pages:99-130 extent:32 |
| sourceStr |
in Acta informatica 33(1996) vom: Feb., Seite 99-130 volume:33 year:1996 month:02 pages:99-130 extent:32 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| isfreeaccess_bool |
false |
| container_title |
Acta informatica |
| authorswithroles_txt_mv |
Matsumoto, Aki @@oth@@ Han, D. S. @@oth@@ Tsuda, Takao @@oth@@ |
| publishDateDaySort_date |
1996-02-01T00:00:00Z |
| hierarchy_top_id |
NLEJ188994068 |
| id |
NLEJ202573346 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">NLEJ202573346</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20210706103152.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">070528s1996 xx |||||o 00| ||eng c</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)NLEJ202573346</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Alias analysis of pointers in Pascal and Fortran 90: Dependence analysis between pointer references</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">32</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract. Vectorization and parallelization of programs written in languages where pointers are used is now a subject of increasing interest. The presence of pointers in programs, however, poses new problems to dependence analysis in vectorizing and parallelizing compilers which had been designed to target only at FORTRAN77 programs. In this paper, a new method to analyze dependencies between pointer references in Pascal is proposed, which can also be applied to Fortran 90. It is designed to handle programs with dynamic data structures, such as linear linked lists or trees, which are the most common use of pointers. The method divides into two stages. The first stage is a safe alias analysis which handles any kind of dynamic data structures. The second stage focuses on the specific data structures. It first detects linear linked lists, and then performs dependence analysis between pointer references to the same list. The paper also proposes ways to enhance the second stage. Tree structures are handled here. Loops which manipulate linked lists can now be considered for vectorization by the proposed analysis. Techniques to vectorize such loops are presented in this paper. Some of the proposed algorithms are implemented in V-Pascal, the automatic vectorizing Pascal compiler of our laboratory. The effectiveness of the vectorization of list operations is proved by an experiment on HITAC S-820/80.</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="f">Springer Online Journal Archives 1860-2002</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Matsumoto, Aki</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Han, D. S.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tsuda, Takao</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">in</subfield><subfield code="t">Acta informatica</subfield><subfield code="d">1971</subfield><subfield code="g">33(1996) vom: Feb., Seite 99-130</subfield><subfield code="w">(DE-627)NLEJ188994068</subfield><subfield code="w">(DE-600)1389024-4</subfield><subfield code="x">1432-0525</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:33</subfield><subfield code="g">year:1996</subfield><subfield code="g">month:02</subfield><subfield code="g">pages:99-130</subfield><subfield code="g">extent:32</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://dx.doi.org/10.1007/s002360050037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-SOJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_NL_ARTICLE</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">33</subfield><subfield code="j">1996</subfield><subfield code="c">2</subfield><subfield code="h">99-130</subfield><subfield code="g">32</subfield></datafield></record></collection>
|
| series2 |
Springer Online Journal Archives 1860-2002 |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)NLEJ188994068 |
| format |
electronic Article |
| delete_txt_mv |
keep |
| collection |
NL |
| remote_str |
true |
| illustrated |
Not Illustrated |
| issn |
1432-0525 |
| topic_title |
Alias analysis of pointers in Pascal and Fortran 90: Dependence analysis between pointer references |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
zu |
| author2_variant |
a m am d s h ds dsh t t tt |
| hierarchy_parent_title |
Acta informatica |
| hierarchy_parent_id |
NLEJ188994068 |
| hierarchy_top_title |
Acta informatica |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)NLEJ188994068 (DE-600)1389024-4 |
| title |
Alias analysis of pointers in Pascal and Fortran 90: Dependence analysis between pointer references |
| spellingShingle |
Alias analysis of pointers in Pascal and Fortran 90: Dependence analysis between pointer references |
| ctrlnum |
(DE-627)NLEJ202573346 |
| title_full |
Alias analysis of pointers in Pascal and Fortran 90: Dependence analysis between pointer references |
| journal |
Acta informatica |
| journalStr |
Acta informatica |
| lang_code |
eng |
| isOA_bool |
false |
| recordtype |
marc |
| publishDateSort |
1996 |
| contenttype_str_mv |
zzz |
| container_start_page |
99 |
| container_volume |
33 |
| physical |
32 |
| format_se |
Elektronische Aufsätze |
| title_sort |
alias analysis of pointers in pascal and fortran 90: dependence analysis between pointer references |
| title_auth |
Alias analysis of pointers in Pascal and Fortran 90: Dependence analysis between pointer references |
| abstract |
Abstract. Vectorization and parallelization of programs written in languages where pointers are used is now a subject of increasing interest. The presence of pointers in programs, however, poses new problems to dependence analysis in vectorizing and parallelizing compilers which had been designed to target only at FORTRAN77 programs. In this paper, a new method to analyze dependencies between pointer references in Pascal is proposed, which can also be applied to Fortran 90. It is designed to handle programs with dynamic data structures, such as linear linked lists or trees, which are the most common use of pointers. The method divides into two stages. The first stage is a safe alias analysis which handles any kind of dynamic data structures. The second stage focuses on the specific data structures. It first detects linear linked lists, and then performs dependence analysis between pointer references to the same list. The paper also proposes ways to enhance the second stage. Tree structures are handled here. Loops which manipulate linked lists can now be considered for vectorization by the proposed analysis. Techniques to vectorize such loops are presented in this paper. Some of the proposed algorithms are implemented in V-Pascal, the automatic vectorizing Pascal compiler of our laboratory. The effectiveness of the vectorization of list operations is proved by an experiment on HITAC S-820/80. |
| abstractGer |
Abstract. Vectorization and parallelization of programs written in languages where pointers are used is now a subject of increasing interest. The presence of pointers in programs, however, poses new problems to dependence analysis in vectorizing and parallelizing compilers which had been designed to target only at FORTRAN77 programs. In this paper, a new method to analyze dependencies between pointer references in Pascal is proposed, which can also be applied to Fortran 90. It is designed to handle programs with dynamic data structures, such as linear linked lists or trees, which are the most common use of pointers. The method divides into two stages. The first stage is a safe alias analysis which handles any kind of dynamic data structures. The second stage focuses on the specific data structures. It first detects linear linked lists, and then performs dependence analysis between pointer references to the same list. The paper also proposes ways to enhance the second stage. Tree structures are handled here. Loops which manipulate linked lists can now be considered for vectorization by the proposed analysis. Techniques to vectorize such loops are presented in this paper. Some of the proposed algorithms are implemented in V-Pascal, the automatic vectorizing Pascal compiler of our laboratory. The effectiveness of the vectorization of list operations is proved by an experiment on HITAC S-820/80. |
| abstract_unstemmed |
Abstract. Vectorization and parallelization of programs written in languages where pointers are used is now a subject of increasing interest. The presence of pointers in programs, however, poses new problems to dependence analysis in vectorizing and parallelizing compilers which had been designed to target only at FORTRAN77 programs. In this paper, a new method to analyze dependencies between pointer references in Pascal is proposed, which can also be applied to Fortran 90. It is designed to handle programs with dynamic data structures, such as linear linked lists or trees, which are the most common use of pointers. The method divides into two stages. The first stage is a safe alias analysis which handles any kind of dynamic data structures. The second stage focuses on the specific data structures. It first detects linear linked lists, and then performs dependence analysis between pointer references to the same list. The paper also proposes ways to enhance the second stage. Tree structures are handled here. Loops which manipulate linked lists can now be considered for vectorization by the proposed analysis. Techniques to vectorize such loops are presented in this paper. Some of the proposed algorithms are implemented in V-Pascal, the automatic vectorizing Pascal compiler of our laboratory. The effectiveness of the vectorization of list operations is proved by an experiment on HITAC S-820/80. |
| collection_details |
GBV_USEFLAG_U ZDB-1-SOJ GBV_NL_ARTICLE |
| title_short |
Alias analysis of pointers in Pascal and Fortran 90: Dependence analysis between pointer references |
| url |
http://dx.doi.org/10.1007/s002360050037 |
| remote_bool |
true |
| author2 |
Matsumoto, Aki Han, D. S. Tsuda, Takao |
| author2Str |
Matsumoto, Aki Han, D. S. Tsuda, Takao |
| ppnlink |
NLEJ188994068 |
| mediatype_str_mv |
z |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth oth oth |
| up_date |
2024-07-06T08:17:13.893Z |
| _version_ |
1803816884129234944 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">NLEJ202573346</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20210706103152.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">070528s1996 xx |||||o 00| ||eng c</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)NLEJ202573346</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Alias analysis of pointers in Pascal and Fortran 90: Dependence analysis between pointer references</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">32</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract. Vectorization and parallelization of programs written in languages where pointers are used is now a subject of increasing interest. The presence of pointers in programs, however, poses new problems to dependence analysis in vectorizing and parallelizing compilers which had been designed to target only at FORTRAN77 programs. In this paper, a new method to analyze dependencies between pointer references in Pascal is proposed, which can also be applied to Fortran 90. It is designed to handle programs with dynamic data structures, such as linear linked lists or trees, which are the most common use of pointers. The method divides into two stages. The first stage is a safe alias analysis which handles any kind of dynamic data structures. The second stage focuses on the specific data structures. It first detects linear linked lists, and then performs dependence analysis between pointer references to the same list. The paper also proposes ways to enhance the second stage. Tree structures are handled here. Loops which manipulate linked lists can now be considered for vectorization by the proposed analysis. Techniques to vectorize such loops are presented in this paper. Some of the proposed algorithms are implemented in V-Pascal, the automatic vectorizing Pascal compiler of our laboratory. The effectiveness of the vectorization of list operations is proved by an experiment on HITAC S-820/80.</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="f">Springer Online Journal Archives 1860-2002</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Matsumoto, Aki</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Han, D. S.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tsuda, Takao</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">in</subfield><subfield code="t">Acta informatica</subfield><subfield code="d">1971</subfield><subfield code="g">33(1996) vom: Feb., Seite 99-130</subfield><subfield code="w">(DE-627)NLEJ188994068</subfield><subfield code="w">(DE-600)1389024-4</subfield><subfield code="x">1432-0525</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:33</subfield><subfield code="g">year:1996</subfield><subfield code="g">month:02</subfield><subfield code="g">pages:99-130</subfield><subfield code="g">extent:32</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://dx.doi.org/10.1007/s002360050037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-SOJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_NL_ARTICLE</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">33</subfield><subfield code="j">1996</subfield><subfield code="c">2</subfield><subfield code="h">99-130</subfield><subfield code="g">32</subfield></datafield></record></collection>
|
| score |
7.401515 |