Estimating Effective Prefetch Distance in Threaded Prefetching for Linked Data Structures |
| |
Authors: | Yan Huang Zhi-Min Gu Jie Tang Min Cai Jianxun Zhang Ninghan Zheng |
| |
Affiliation: | 1. Software Engineering College, Zhengzhou University of Light Industry, Zhengzhou, China 2. School of Computer Science and Technology, Beijing Institute of Technology, Beijing, China
|
| |
Abstract: | Helper threaded prefetching based on chip multiprocessor has been shown to reduce memory latency and improve overall system performance, and has been explored in linked data structures accesses. In our earlier work, we had proposed an effective threaded prefetching technique that balances delinquent loads between main thread and helper thread to improve effectiveness of prefetching. In this paper, we analyze memory access characteristic of specific application to estimate effective prefetch distance range for our proposed threaded prefetching technique. The effect of hardware prefetchers on the estimation is also exploited. We discuss key design issues of our proposed method and present preliminary experimental results. Our experimental evaluations indicated that the bounded range of effective prefetch distance can be determined using our method, and the optimal prefetch distances can be determined based on the estimated effective prefetch distance range by few trial runs. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|