Searching an Optimal History Size for History-Based Page Prefetching on Software DSM Systems

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.

[1]  Effectiveness of Dynamic Prefetching in Multiple-WriterDistributed Virtual Shared Memory Systems , 1997 .

[2]  Alan L. Cox,et al.  Software versus hardware shared-memory implementation: a case study , 1994, ISCA '94.

[3]  Cristian Ruz,et al.  On the Design and Implementation of a Portable DSM System for Low-Cost Multicomputers , 2003, ICCSA.

[4]  Joonwon Lee,et al.  Adaptive prefetching technique for shared virtual memory , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.

[5]  Ricardo Bianchini,et al.  Data prefetching for software DSMs , 1998, ICS '98.

[6]  Ricardo Bianchini,et al.  Comparing Latency-Tolerance Techniques for Software DSM Systems , 2003, IEEE Trans. Parallel Distributed Syst..

[7]  Master Gardener,et al.  Mathematical games: the fantastic combinations of john conway's new solitaire game "life , 1970 .

[8]  Marina L. Gavrilova,et al.  Computational Science and Its Applications — ICCSA 2003 , 2003 .

[9]  Fernando Gustavo Tinetti,et al.  Parallel programming: techniques and applications using networked workstations and parallel computers. Barry Wilkinson, C. Michael Allen , 2000 .

[10]  Ricardo Bianchini,et al.  Efficiently adapting to sharing patterns in software DSMs , 1998, Proceedings 1998 Fourth International Symposium on High-Performance Computer Architecture.

[11]  Adi Shamir,et al.  Shear Sort: A True Two-Dimensional Sorting Techniques for VLSI Networks , 1986, ICPP.

[12]  Ricardo Bianchini,et al.  Hiding communication latency and coherence overhead in software DSMs , 1996, ASPLOS VII.

[13]  Paul Hudak,et al.  Memory coherence in shared virtual memory systems , 1989, TOCS.