Detecting Parallelism in C Programs with Recursive Data Structures (1998)
Cached
Download Links
- [www.sable.mcgill.ca]
- [www-acaps.cs.mcgill.ca]
- DBLP
Other Repositories/Bibliography
| Venue: | IEEE Transactions on Parallel and Distributed Systems |
| Citations: | 154 - 13 self |
BibTeX
@ARTICLE{Ghiya98detectingparallelism,
author = {Rakesh Ghiya and Laurie Hendren and Yingchun Zhu},
title = {Detecting Parallelism in C Programs with Recursive Data Structures},
journal = {IEEE Transactions on Parallel and Distributed Systems},
year = {1998},
volume = {1},
pages = {35--47}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we present techniques to detect three common patterns of parallelism in C programs that use recursive data structures. These patterns include, function calls that access disjoint sub-pieces of tree-like data structures, pointer-chasing loops that traverse list-like data structures, and array-based loops which operate on an array of pointers pointing to disjoint data structures. We design dependence tests using a family of three existing pointer analyses, namely points-to, connection and shape analyses, with special emphasis on shape analysis. To identify loop parallelism, we introduce special tests for detecting loop-carried dependences in the context of recursive data structures. We have implemented the tests in the framework of our McCAT C compiler, and we present some preliminary experimental results.
