Abstract
In this paper, we propose a software data prefetching mechanism to cope with following two unfavorable phenomenons from large arrays. One is the failure of the reuse, and the other is the effect of the presence of unnecessary prefetching instructions. Also, we realized the proposed mechanism into a preprocessor, LOOP.
This paper was supported (in part) by NON DIRECTED RESEARCH FUND, Korea Research Foundation
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
D. Callahan, K. Kennedy and A. Porterfield: Software prefetching. Proc. 5th ASPLOS. (1991) 40–52
Chen, T. F.: Data Prefetching for High-Performance Processors. TR 93-07-01, Dept. of Computer Science and Engineering, University of Washington, (1993)
Fu, J. W. C. and Patel, J. H.: Data Prefetching in Multiprocessor Vector Memories, Proc. 18th ISCA, (1991) 54–63
Mowry, T., Lam, M. S. and Gupta, A.: Design and evaluation of a compiler algorithm for prefetching. Proc. 5th ASPLOS. (1992) 62–73
M. E. Wolf and M. S. Lam: A Data Locality Optimizing Algorithm. Proc. SIGPLAN '91 PLDI (1991) 30–44
Se-Jin Hwang and Myong-Soon Park: Loop Reorganizing Algorithm for Data Prefetching. TR KUCS-CS-94-004, Korea University, (1994) (in Korean)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hwang, SJ., Park, MS. (1995). Efficient software data prefetching for a Loop with large arrays. In: Haridi, S., Ali, K., Magnusson, P. (eds) EURO-PAR '95 Parallel Processing. Euro-Par 1995. Lecture Notes in Computer Science, vol 966. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020473
Download citation
DOI: https://doi.org/10.1007/BFb0020473
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60247-7
Online ISBN: 978-3-540-44769-6
eBook Packages: Springer Book Archive