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...

Full description

Saved in:
Bibliographic Details
Published in:The Journal of systems and software Vol. 57; no. 2; pp. 145 - 154
Main Authors: Huang, Tsung-Chuan, Yang, Cheng-Ming
Format: Journal Article
Language:English
Published: New York Elsevier Inc 15.06.2001
Elsevier Sequoia S.A
Subjects:
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
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography: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