会议专题

Performance Evaluation of Thread Prefetching for Recursive Data Structures

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.

memory wall Linked data structure multi-core and multi-threading cache misses data prefetching

Zhu HuiDong Cheng Jing Ding Wei Huang Yan

School of Computer and Communication Engineering Zhengzhou University of Light Industry Zhengzhou,Ch College of Information Science and Engineering Henan University of Technology Zhengzhou,China

国际会议

2011 International Conference on Computer and Network Engineering(ICCNE 2011)(2011年计算机与网络工程国际会议)

郑州

英文

408-411

2011-06-17(万方平台首次上网日期,不代表论文的发表时间)