By Topic

Trace-based Automatic Padding for Locality Improvement with Correlative Data Visualization Interface

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
$33 $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

3 Author(s)
Marco Hobbel ; University of Bayreuth, Germany ; Thomas Rauber ; Carsten Scholtes

An important goal for most programs from scientific or engineering computing is to reduce the execution time as far as possible. The programs refer to user data in problem specific access patterns. For regular applications, it can be expected that repeated program executions exhibit a similar memory access pattern. Many data intensive applications benefit from a high memory bandwidth which, on modern architectures, is supported by a multi-level cache hierarchy. The efficiency of caching depends strongly on temporal or spatial reuse, thus, potential conflicts should be avoided.

Published in:

16th International Conference on Parallel Architecture and Compilation Techniques (PACT 2007)

Date of Conference:

15-19 Sept. 2007