Record Details

EXTENSIONS TO CYCLE SHRINKING

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title EXTENSIONS TO CYCLE SHRINKING
 
Creator SETHI, A
BISWAS, S
SANYAL, A
 
Subject parallelizing compiler
restructuring transformations
dependence distances
cycle shrinking
 
Description An important part of a parallelizing compiler is the restructuring phase, which extracts parallelism from a sequential program. We consider an important restructuring transformation called cycle shrinking [5], which partitions the iteration space of a loop so that the iterations within each group of the partition can be executed in parallel. The method in [5] mainly deals with dependences with constant distances. In this paper, we propose certain extensions to the cycle shrinking transformation. For dependences with constant distances, we present an algorithm which, under certain fairly general conditions, partitions the iteration space in a minimal number of groups. Under such conditions, our method is optimal while the previous methods are not. We have also proposed an algorithm to handle a large class of loops which have dependences with variable distances. This problem is considerably harder and has not been considered before in full generality.
 
Publisher WORLD SCIENTIFIC PUBL CO PTE LTD
 
Date 2011-09-02T00:39:41Z
2011-12-26T12:59:52Z
2011-12-27T05:52:53Z
2011-09-02T00:39:41Z
2011-12-26T12:59:52Z
2011-12-27T05:52:53Z
1995
 
Type Article
 
Identifier INTERNATIONAL JOURNAL OF HIGH SPEED COMPUTING, 7(2), 265-284
0129-0533
http://dx.doi.org/10.1142/S0129053395000154
http://dspace.library.iitb.ac.in/xmlui/handle/10054/12912
http://hdl.handle.net/10054/12912
 
Language en