We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

On the Automatic Detection of Heap-Induced Data Dependencies with Interprocedural Shape Analysis

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Tineo, A. ; Dept. of Comput. Archit., Univ. of Malaga Complejo Tecnol., Malaga, Spain ; Corbera, F. ; Navarro, A. ; Asenjo, R.
more authors

The automatic detection of heap-induced data dependencies is major challenge for current parallelizing compilers. Currently, optimizing compilers lack enough context to expose parallelism in scientific codes that make use of dynamic data structures, those allocated at runtime and stored in the heap. Traditionally, it is believed that few static assumptions can be made of runtime structures, and those that can be made are usually not useful enough for aggressive optimization. However, we show in this paper that a precise underlying shape analysis technique, which accurately captures the shape of data structures at compile-time, can provide sufficient information to identify independent heap accesses in challenging benchmarks. The result is that hard-to-find parallelism, unknown to current parallelizing compilers, is exposed and exploited thanks to our technique.

Published in:

Parallel Processing Workshops, 2009. ICPPW '09. International Conference on

Date of Conference:

22-25 Sept. 2009