Non-linear array data dependence test

Data dependence analysis is the most essential process while parallelizing a sequential program. Most current data dependence tests cannot handle array subscripts that are non-linear expressions. In this paper, we present a new parallelization algorithm, called non-linear array subscripts (NLA) test...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:The Journal of systems and software Ročník 57; číslo 2; s. 145 - 154
Hlavní autoři: Huang, Tsung-Chuan, Yang, Cheng-Ming
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Elsevier Inc 15.06.2001
Elsevier Sequoia S.A
Témata:
ISSN:0164-1212, 1873-1228
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract Data dependence analysis is the most essential process while parallelizing a sequential program. Most current data dependence tests cannot handle array subscripts that are non-linear expressions. In this paper, we present a new parallelization algorithm, called non-linear array subscripts (NLA) test, to deal with non-linear or complex array subscripts. In this scheme, the iterations subject to loop-carried dependence are scheduled into different wavefronts, while the iterations with no loop-carried dependence are assigned into the same wavefront. Based on the wavefront information, the original loop is then transformed into parallel code. Our experimental results on shared-memory parallel machines HP SPP2000 and ALR Quad6 prove the high effectiveness of the NLA test.
AbstractList Data dependence analysis is the most essential process while parallelizing a sequential program. Most current data dependence tests cannot handle array subscripts that are non-linear expressions. In this paper, we present a new parallelization algorithm, called non-linear array subscripts (NLA) test, to deal with non-linear or complex array subscripts. In this scheme, the iterations subject to loop-carried dependence are scheduled into different wavefronts, while the iterations with no loop-carried dependence are assigned into the same wavefront. Based on the wavefront information, the original loop is then transformed into parallel code. Our experimental results on shared-memory parallel machines HP SPP2000 and ALR Quad6 prove the high effectiveness of the NLA test.
Data dependence analysis is the most essential process while parallelizing a sequential program. Most current data dependence tests cannot handle array subscripts that are non-linear expressions. In this paper, we present a new parallelization algorithm, called non-linear array subscripts (NLA) test, to deal with non-linear or complex array subscripts. In this scheme, the iterations subject to loop-carried dependence are scheduled into different wavefronts, while the iterations with no loop-carried dependence are assigned into the same wavefront. Based on the wavefront information, the original loop is then transformed into parallel code. Our experimental results on shared-memory parallel machines HP SPP2000 and ALR Quad6 prove the high effectiveness of the NLA test. copyright 2001 Elsevier Science Inc.
Data dependence analysis is the most essential process while parallelizing a sequential program. Most current data dependence tests cannot handle array subscripts that are non-linear expressions. This paper presents a new parallelization algorithm, called non-linear array subscripts (NLA) test, to deal with non-linear or complex array subscripts. In this scheme, the iterations subject to loop-carried dependence are scheduled into different wavefronts, while the iterations with no loop-carried dependence are assigned into the same wavefront. Based on the wavefront information, the original loop is then transformed into parallel code. The experimental results on shared-memory parallel machines HP SPP2000 and ALR Quad6 prove the high effectiveness of the NLA test.
Author Huang, Tsung-Chuan
Yang, Cheng-Ming
Author_xml – sequence: 1
  givenname: Tsung-Chuan
  surname: Huang
  fullname: Huang, Tsung-Chuan
  email: tch@mail.nsysu.edu.tw
– sequence: 2
  givenname: Cheng-Ming
  surname: Yang
  fullname: Yang, Cheng-Ming
BookMark eNqFkEtLAzEQgINUsK3-BGERFD2sTmbT7PYkUnxB0YO9h9k8YMs2W5Ot0H9v2ooHL15mYPjm9Y3YwHfeMnbO4ZYDl3cfKYicI8drgBsAjiLHIzbkVVmkMlYDNvxFTtgoxiUAlAg4ZJdvnc_bxlsKGYVA28xQT5mxa-uN9dpmvY39KTt21EZ79pPHbPH0uJi95PP359fZwzzXBS_6nBy5uhaFNLWW6Gqpq1obAaUgNCAnToAhbsqCaihLTZzAwQRJTslK54oxuzqMXYfuc5P2qlUTtW1b8rbbRIWyKlCUIoEXf8Bltwk-naYQpxPBZTVN0OQA6dDFGKxT69CsKGwVB7UTp_bi1M6KAlB7cQpT3_2hz6ZPvxobVNTNToVpgtW9Ml3zz4RvAjl1fQ
CODEN JSSODM
Cites_doi 10.1007/BFb0032691
10.1145/135226.135233
10.1145/113445.113448
10.1016/S0164-1212(99)00132-6
10.1109/71.544354
10.1109/SUPERC.1994.344316
10.1109/71.86109
10.1109/71.159042
10.1177/109434208900300302
10.1109/71.737695
10.1109/71.752782
10.1109/71.80122
ContentType Journal Article
Copyright 2001 Elsevier Science Inc.
Copyright Elsevier Sequoia S.A. Jun 15, 2001
Copyright_xml – notice: 2001 Elsevier Science Inc.
– notice: Copyright Elsevier Sequoia S.A. Jun 15, 2001
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1016/S0164-1212(00)00124-2
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Computer and Information Systems Abstracts
Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1873-1228
EndPage 154
ExternalDocumentID 74901991
10_1016_S0164_1212_00_00124_2
S0164121200001242
Genre Feature
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1~.
1~5
29L
4.4
457
4G.
5GY
5VS
7-5
71M
8P~
9JN
9M8
AABNK
AACTN
AAEDT
AAEDW
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
AAYOK
ABBOA
ABEFU
ABFNM
ABFRF
ABFSI
ABJNI
ABMAC
ABTAH
ABXDB
ABYKQ
ACDAQ
ACGFO
ACGFS
ACGOD
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADHUB
ADJOM
ADMUD
AEBSH
AEFWE
AEKER
AENEX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AI.
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BKOMP
BLXMC
CS3
DU5
E.L
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-Q
G8K
GBLVA
GBOLZ
HLZ
HVGLF
HZ~
IHE
J1W
KOM
LG9
M41
MO0
MS~
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
PQQKQ
Q38
R2-
RIG
RNS
ROL
RPZ
RXW
SBC
SDF
SDG
SDP
SES
SEW
SPC
SPCBC
SSV
SSZ
T5K
TAE
TN5
TWZ
UHS
UNMZH
VH1
WUQ
XPP
ZMT
ZY4
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
7SC
8FD
AFXIZ
AGCQF
AGRNS
JQ2
L7M
L~C
L~D
SSH
ID FETCH-LOGICAL-c313t-afafbb436dbc62fb6c8bcd4074a2d065f40da1d73ab077ca1a0f052a69ae6ff3
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000169371000005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0164-1212
IngestDate Sun Sep 28 04:14:17 EDT 2025
Fri Jul 25 03:58:52 EDT 2025
Sat Nov 29 02:31:51 EST 2025
Fri Feb 23 02:34:14 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 2
Keywords Data dependence test
Parallelizing compiler
Non-linear array subscripts
Language English
License https://www.elsevier.com/tdm/userlicense/1.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c313t-afafbb436dbc62fb6c8bcd4074a2d065f40da1d73ab077ca1a0f052a69ae6ff3
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
PQID 229541689
PQPubID 45802
PageCount 10
ParticipantIDs proquest_miscellaneous_26832474
proquest_journals_229541689
crossref_primary_10_1016_S0164_1212_00_00124_2
elsevier_sciencedirect_doi_10_1016_S0164_1212_00_00124_2
PublicationCentury 2000
PublicationDate 2001-06-15
PublicationDateYYYYMMDD 2001-06-15
PublicationDate_xml – month: 06
  year: 2001
  text: 2001-06-15
  day: 15
PublicationDecade 2000
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle The Journal of systems and software
PublicationYear 2001
Publisher Elsevier Inc
Elsevier Sequoia S.A
Publisher_xml – name: Elsevier Inc
– name: Elsevier Sequoia S.A
References Pugh (BIB12) 1992; 35
Padua, D.A., 1996. Outline of a Roadmap for Compiler Technology. CSRD Rep. 1489, University of Illinois, Urbana-Champaign
Goff, G., Kennedy, K., Tseng, C.W., 1991. Practical dependence testing. In: Proceedings of the ACM SIGPLAN '91 Conference on Prog. Lang. Design Implement., pp. 15–29
Zima, Chapman (BIB16) 1991
Huang, Yang (BIB6) 2000; 52
Blume, Eigenmann (BIB4) 1998; 9
Berry (BIB2) 1989; 3
Wolfe, Tseng (BIB14) 1992; 3
Rauchwerger, Padua (BIB13) 1999; 10
Petersen, Padua (BIB11) 1996; 7
Kong, Klappholz, Psarriss (BIB8) 1991; 2
Wolfe (BIB15) 1996
Li, Yew, Zhu (BIB9) 1990; 1
Banerjee (BIB1) 1988
Blume, W., Eigenmann, R., 1994. The range test: a dependence test for symbolic, non-linear expressions. IEEE Supercomput. 528–537
Huang, T.C., Hsu, P.H., 1997. The SPNT test: a new technology for run-time speculative parallelization of loops. The 10th International Workshop on Languages and Compilers for Parallel Computing, pp. 177–191
Huang (10.1016/S0164-1212(00)00124-2_BIB6) 2000; 52
Wolfe (10.1016/S0164-1212(00)00124-2_BIB14) 1992; 3
Berry (10.1016/S0164-1212(00)00124-2_BIB2) 1989; 3
10.1016/S0164-1212(00)00124-2_BIB5
Petersen (10.1016/S0164-1212(00)00124-2_BIB11) 1996; 7
10.1016/S0164-1212(00)00124-2_BIB3
Rauchwerger (10.1016/S0164-1212(00)00124-2_BIB13) 1999; 10
Wolfe (10.1016/S0164-1212(00)00124-2_BIB15) 1996
Kong (10.1016/S0164-1212(00)00124-2_BIB8) 1991; 2
Zima (10.1016/S0164-1212(00)00124-2_BIB16) 1991
10.1016/S0164-1212(00)00124-2_BIB7
Pugh (10.1016/S0164-1212(00)00124-2_BIB12) 1992; 35
Banerjee (10.1016/S0164-1212(00)00124-2_BIB1) 1988
10.1016/S0164-1212(00)00124-2_BIB10
Blume (10.1016/S0164-1212(00)00124-2_BIB4) 1998; 9
Li (10.1016/S0164-1212(00)00124-2_BIB9) 1990; 1
References_xml – volume: 7
  start-page: 1121
  year: 1996
  end-page: 1132
  ident: BIB11
  article-title: Static and dynamic evaluation of data dependence analysis techniques
  publication-title: IEEE Trans. Parallel Distrib. Syst.
– volume: 10
  start-page: 160
  year: 1999
  end-page: 180
  ident: BIB13
  article-title: The LRPD test: speculative run-time parallelization of loops with privatization and reduction parallelization
  publication-title: IEEE Trans. Parallel Distrib. Syst.
– volume: 52
  start-page: 55
  year: 2000
  end-page: 65
  ident: BIB6
  article-title: Data dependence analysis for array references
  publication-title: J. Syst. Software
– reference: Padua, D.A., 1996. Outline of a Roadmap for Compiler Technology. CSRD Rep. 1489, University of Illinois, Urbana-Champaign
– year: 1988
  ident: BIB1
  publication-title: Dependence Analysis for Supercomputing
– year: 1991
  ident: BIB16
  publication-title: Supercompilers for Parallel and Vector Computers
– volume: 3
  start-page: 5
  year: 1989
  end-page: 40
  ident: BIB2
  article-title: The perfect club benchmarks: effective performance evaluation of supercomputers
  publication-title: Int. J. Supercomput. Appl.
– volume: 1
  start-page: 26
  year: 1990
  end-page: 34
  ident: BIB9
  article-title: An efficient data dependence analysis for parallelizing compilers
  publication-title: IEEE Trans. Parallel Distrib. Syst.
– volume: 9
  start-page: 1180
  year: 1998
  end-page: 1194
  ident: BIB4
  article-title: Nonlinear and symbolic data dependence testing
  publication-title: IEEE Trans. Parallel Distrib. Syst.
– year: 1996
  ident: BIB15
  publication-title: High Performance Compilers for Parallel Computing
– volume: 2
  start-page: 342
  year: 1991
  end-page: 349
  ident: BIB8
  article-title: The I test: an improved dependence test for automatic paralleization and vectorization
  publication-title: IEEE Trans. Parallel Distrib. Syst.
– reference: Huang, T.C., Hsu, P.H., 1997. The SPNT test: a new technology for run-time speculative parallelization of loops. The 10th International Workshop on Languages and Compilers for Parallel Computing, pp. 177–191
– volume: 3
  start-page: 591
  year: 1992
  end-page: 601
  ident: BIB14
  article-title: The power test for data dependence
  publication-title: IEEE Trans. Parallel Distrib. Syst.
– volume: 35
  start-page: 102
  year: 1992
  end-page: 114
  ident: BIB12
  article-title: A practical algorithm for extract array dependence analysis
  publication-title: Commun. ACM
– reference: Goff, G., Kennedy, K., Tseng, C.W., 1991. Practical dependence testing. In: Proceedings of the ACM SIGPLAN '91 Conference on Prog. Lang. Design Implement., pp. 15–29
– reference: Blume, W., Eigenmann, R., 1994. The range test: a dependence test for symbolic, non-linear expressions. IEEE Supercomput. 528–537
– year: 1991
  ident: 10.1016/S0164-1212(00)00124-2_BIB16
– year: 1988
  ident: 10.1016/S0164-1212(00)00124-2_BIB1
– year: 1996
  ident: 10.1016/S0164-1212(00)00124-2_BIB15
– ident: 10.1016/S0164-1212(00)00124-2_BIB7
  doi: 10.1007/BFb0032691
– volume: 35
  start-page: 102
  issue: 8
  year: 1992
  ident: 10.1016/S0164-1212(00)00124-2_BIB12
  article-title: A practical algorithm for extract array dependence analysis
  publication-title: Commun. ACM
  doi: 10.1145/135226.135233
– ident: 10.1016/S0164-1212(00)00124-2_BIB5
  doi: 10.1145/113445.113448
– volume: 52
  start-page: 55
  year: 2000
  ident: 10.1016/S0164-1212(00)00124-2_BIB6
  article-title: Data dependence analysis for array references
  publication-title: J. Syst. Software
  doi: 10.1016/S0164-1212(99)00132-6
– ident: 10.1016/S0164-1212(00)00124-2_BIB10
– volume: 7
  start-page: 1121
  issue: 11
  year: 1996
  ident: 10.1016/S0164-1212(00)00124-2_BIB11
  article-title: Static and dynamic evaluation of data dependence analysis techniques
  publication-title: IEEE Trans. Parallel Distrib. Syst.
  doi: 10.1109/71.544354
– ident: 10.1016/S0164-1212(00)00124-2_BIB3
  doi: 10.1109/SUPERC.1994.344316
– volume: 2
  start-page: 342
  issue: 3
  year: 1991
  ident: 10.1016/S0164-1212(00)00124-2_BIB8
  article-title: The I test: an improved dependence test for automatic paralleization and vectorization
  publication-title: IEEE Trans. Parallel Distrib. Syst.
  doi: 10.1109/71.86109
– volume: 3
  start-page: 591
  issue: 5
  year: 1992
  ident: 10.1016/S0164-1212(00)00124-2_BIB14
  article-title: The power test for data dependence
  publication-title: IEEE Trans. Parallel Distrib. Syst.
  doi: 10.1109/71.159042
– volume: 3
  start-page: 5
  issue: 3
  year: 1989
  ident: 10.1016/S0164-1212(00)00124-2_BIB2
  article-title: The perfect club benchmarks: effective performance evaluation of supercomputers
  publication-title: Int. J. Supercomput. Appl.
  doi: 10.1177/109434208900300302
– volume: 9
  start-page: 1180
  issue: 12
  year: 1998
  ident: 10.1016/S0164-1212(00)00124-2_BIB4
  article-title: Nonlinear and symbolic data dependence testing
  publication-title: IEEE Trans. Parallel Distrib. Syst.
  doi: 10.1109/71.737695
– volume: 10
  start-page: 160
  issue: 2
  year: 1999
  ident: 10.1016/S0164-1212(00)00124-2_BIB13
  article-title: The LRPD test: speculative run-time parallelization of loops with privatization and reduction parallelization
  publication-title: IEEE Trans. Parallel Distrib. Syst.
  doi: 10.1109/71.752782
– volume: 1
  start-page: 26
  issue: 1
  year: 1990
  ident: 10.1016/S0164-1212(00)00124-2_BIB9
  article-title: An efficient data dependence analysis for parallelizing compilers
  publication-title: IEEE Trans. Parallel Distrib. Syst.
  doi: 10.1109/71.80122
SSID ssj0007202
Score 1.5870266
Snippet Data dependence analysis is the most essential process while parallelizing a sequential program. Most current data dependence tests cannot handle array...
SourceID proquest
crossref
elsevier
SourceType Aggregation Database
Index Database
Publisher
StartPage 145
SubjectTerms Algorithms
Arrays
Data dependence test
Non-linear array subscripts
Parallel processing
Parallelizing compiler
Sequential scheduling
Studies
Title Non-linear array data dependence test
URI https://dx.doi.org/10.1016/S0164-1212(00)00124-2
https://www.proquest.com/docview/229541689
https://www.proquest.com/docview/26832474
Volume 57
WOSCitedRecordID wos000169371000005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1873-1228
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0007202
  issn: 0164-1212
  databaseCode: AIEXJ
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Jj9MwFLagw4ELwyrKsOQACFRlJomd2DlWVUeAhoLUIJWT5Ti2ZjiknaQdhn_Pc-wsA2I7cIkqp2lcv8_Pn5f3PoSeEyVzTOLIl6lOfYIl85mITHo8loQFgRl0LBuxCbpYsNUq_eh2TOtGToCWJbu8TDf_1dRQBsY2obP_YO7uR6EAPoPR4Qpmh-tfGX6xLn3DHUU1EVUlvk3MIdBJK3YL3Xjb7ih96ZEy4KU2t7NN3VyDk_4qqoHx3fJyVoOT8Genux5cs1MFRe-dRspn4YbEdkWhOflkYyrtMlcb6rJU57v1mZgsD6fDFcjEWNKdfVbWazKKocxFeTu3avNOO_hEAx8Z2vyRP_luu4yw7F4ADNsIVaeGkREXI3klX_biAz_-dHLCs_kqu3q3GZ8pAa4D9Pfl5tw3KmNmN95JrlxHexGNUzZCe9O389W7buymUXNKtatDH_N11FfsVRC8dpX6FZv5YVxvyEp2G91y1vSmFh130DVV3kX7rYKH5xz6PfSiB4vXgMUzYPF6sHgGLPdRdjzPZm98J5zhSxzirS-00HlOcFLkMol0nkiWywKm7kREBXBOTYJChAXFIg8olSIUgQ7iSCSpUInW-AEaletSPUReyCRjWItcK0mopmlhlM4wIzoolIyDMTps_z_f2PQofHBuMCHcNBgPTA5aaDAejRFrW4k7jme5GwcY_OnRg7ZVuetvNTdq9DCnYOkYPevugoc0216iVOsdfCWBUYtQ8ui3zx-gm31feIxG22qnnqAb8mJ7VldPHU6-A14afgk
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Non-linear+array+data+dependence+test&rft.jtitle=The+Journal+of+systems+and+software&rft.au=Huang%2C+Tsung-Chuan&rft.au=Cheng-Ming%2C+Yang&rft.date=2001-06-15&rft.pub=Elsevier+Sequoia+S.A&rft.issn=0164-1212&rft.eissn=1873-1228&rft.volume=57&rft.issue=2&rft.spage=145&rft_id=info:doi/10.1016%2FS0164-1212%2800%2900124-2&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=74901991
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0164-1212&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0164-1212&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0164-1212&client=summon