Please use this identifier to cite or link to this item:
|Title:||EXTENSIONS TO CYCLE SHRINKING|
|Publisher:||WORLD SCIENTIFIC PUBL CO PTE LTD|
|Citation:||INTERNATIONAL JOURNAL OF HIGH SPEED COMPUTING, 7(2), 265-284|
|Abstract:||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 , 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  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.|
|Appears in Collections:||Article|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.