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:
Algorithms
Arrays
Data dependence test
Non-linear array subscripts
Parallel processing
Parallelizing compiler
Sequential scheduling
Studies
Data dependence test
Parallelizing compiler
Non-linear array subscripts
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!
Popis
Shrnutí: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.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0164-1212
1873-1228
DOI:10.1016/S0164-1212(00)00124-2