Abstract
This work presents a study regarding the search for an optimal value of the history size for the prediction/prefetching technique history-based prefetching, which collects the recent history of accesses to individual shared memory pages and uses that information to predict the next access to a page. On correct predictions, this technique allows to hide the latency generated by page faults on the remote node when the access is effectively done. Some parameters as the size of the page history structure that is stored and transmitted among nodes can be fine-tuned to improve the prediction efficency.
Our experiments show that small values of history size provide a better performance in the tested applications, while bigger values tend to generate more latency when the page history is transmitted, without improving the prediction efficiency.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Li, K., Hudak, P.: Memory Coherence in Shared Virtual Memory Systems. ACM Transactions on Computer Systems 7, 321–359 (1989)
Cox, A.L., Dwarkadas, S., Keleher, P., Lu, H., Rajamony, R., Zwaenepoel, W.: Software Versus Hardware Shared-Memory Implementation: A Case Study. In: Proc. of the 21th Annual Int’l Symp. on Computer Architecture (ISCA 1994), pp. 106–117 (1994)
Pinto, R., Bianchini, R., De Amorim, C.R.: Comparing Latency-Tolerance Techniques for Software DSM Systems. IEEE Transactions on Parallel and Distributed Systems 14, 1180–1190 (2003)
Ruz, C.: History-based Prefetching for Software DSM Systems. Master’s thesis, Pontificia Universidad Católica de Chile (2005)
Bianchini, R., Kontothanassis, L.I., Pinto, R., De Maria, M., Abud, M., De Amorim, C.L.: Hiding Communication Latency and Coherence Overhead in Software DSMs. In: Proc. of the 7th Symp. on Architectural Support for Programming Languages and Operating Systems (ASPLOSVII), pp. 198–209 (1996)
Bianchini, R., Pinto, R., De Amorim, C.L.: Data Prefetching for Software DSMs. In: ICS 1998: Proceedings of the 12th International Conference on Supercomputing, pp. 385–392. ACM Press, New York (1998)
Lee, S., Yun, H., Lee, J., Maeng, S.: Adaptive Prefetching Technique for Shared Virtual Memory. In: First IEEE International Symposium on Cluster Computing and the Grid, CCGRID, pp. 521–526. IEEE Computer Society, Los Alamitos (2001)
Karlsson, M., Stenström, P.: Effectiveness of Dynamic Prefetching in Multiple-Writer Distributed Virtual Shared-Memory Systems. Journal of Parallel and Distributed Computing 43, 79–93 (1997)
Monnerat, L.R., Bianchini, R.: Efficiently Adapting to Sharing Patterns in Software DSMs. In: Proc. of the 4th IEEE Symp. on High-Performance Computer Architecture (HPCA-4), pp. 289–299 (1998)
Meza, F., Campos, A.E., Ruz, C.: On the Design and Implementation of a Portable DSM System for Low-Cost Multicomputers. In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L’Ecuyer, P. (eds.) ICCSA 2003. LNCS, vol. 2667, pp. 967–976. Springer, Heidelberg (2003)
Gardner, M.: Mathematical games: The fantastic combinations of John Conway’s new solitaire game ‘Life’. Scientific American 223, 120–123 (1970); The original description of Conway’s game of LIFE
Sen, S., Scherson, I.D., Shamir, A.: Shear Sort: A True Two-Dimensional Sorting Technique for VLSI Networks. In: ICPP 903–908 (1986)
Wilkinson, B., Allen, M.: Parallel programming: techniques and applications using networked workstations and parallel computers. Prentice-Hall, Inc., Englewood Cliffs (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ruz, C., Piquer, J.M. (2005). Searching an Optimal History Size for History-Based Page Prefetching on Software DSM Systems. In: Yang, L.T., Rana, O.F., Di Martino, B., Dongarra, J. (eds) High Performance Computing and Communications. HPCC 2005. Lecture Notes in Computer Science, vol 3726. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11557654_19
Download citation
DOI: https://doi.org/10.1007/11557654_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29031-5
Online ISBN: 978-3-540-32079-1
eBook Packages: Computer ScienceComputer Science (R0)