By Topic

Performance evaluation of thread prefetching for recursive data structures

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

4 Author(s)
Zhu HuiDong ; School of Computer and Communication Engineering Zhengzhou University of Light Industry Zhengzhou, China ; Cheng Jing ; Ding Wei ; Huang Yan

The memory wall problem is one of the important issues in modern computer system - it affects the system performance in spite of the powerful processor. The emergence of multi-core processors has further exacerbated the problem. On the other hand, the increasing use of the linked data structure in applications aggravates the memory access latency. This paper dispatches two thread prefetching techniques based on CMP which prefetches the demanded data into the shared cache in advance to hide the long memory access latency, and evaluates these two helper thread prefetching algorithms based on three fundamental aspects of data prefetching. The performance evaluation of thread prefetching shows with acceptable coverage, increasing timeliness and accuracy can improve performance of threaded prefetching. However, improving accuracy by issuing prefetches earlier introduces more uncertainty in the prefetching, hence reducing coverage. Performance results of four benchmark applications when applying with two thread prefetching techniques is also provided.

Published in:

Communication Software and Networks (ICCSN), 2011 IEEE 3rd International Conference on

Date of Conference:

27-29 May 2011