Abstract
This paper discusses a way of incorporating speculation techniques into Distributed Shared Memory (DSM) systems with checkpointing mechanism without creating unnecessary checkpoints. Speculation is a general technique involving prediction of the future of a computation, namely accesses to shared objects unavailable on the accessing node (read faults). Thanks to such predictions objects can be pushed to requesting nodes before the actual access operation is performed, resulting, at least potentially, in a considerable performance improvement. This mechanism is a foundation for the proposed SpecCkpt protocol based on independent checkpointing integrated with a coherence protocol for a given consistency model introducing little overhead. It ensures the consistency of checkpoints, at the same time allowing a fast recovery from failures.
The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-3-540-35127-6_28
Chapter PDF
References
Bianchini, R., Pinto, R., Amorim, C.L.: Data Prefetching for Software DSMs. In: Proc. Int. Conference on Supercomputing, Melbourne, Australia (1998)
Carbajal, J., Michael, M., Nguyen, A.-T., Torrellas, J., Sharma, A.: Augmint: A Multiprocessor Simulation Environment for Intel x86 Architectures. CSRD Technical Report 1463 (March 1996)
Danilecki, A., Szychowiak, M.: Checkpointing Speculative Distributed Shared Memory. In: Wyrzykowski, R., Dongarra, J., Meyer, N., Waśniewski, J. (eds.) PPAM 2005. LNCS, vol. 3911, pp. 9–16. Springer, Heidelberg (2006)
Danilecki, A., Szychowiak, M.: Checkpointing Speculative DSM Systems, Research Report RA-021/05, Institute of Computing Science, Poznan University of Technology (2005)
Danilecki, A., Szychowiak, M., Kobusinski, J.: Simplified DSM simulation with the use of the Augmint backend, Research Report RA-04/06, Institute of Computing Science, Poznan University of Technology (2006)
Gupta, A., Ohara, M., Singh, J., Torrie, E., Woo, S.: The SPLASH2 Programs: Characterization and Methodological Considerations. In: Proc. 22nd Int. Symposium on Computer Architecture (ISCA 1995) (May 1995)
Kongmunvattana, A., Tanchatchawal, S., Tzeng, N.-F.: Coherence-Based Coordinated Checkpointing for Software Distributed Shared Memory Systems. In: Proc. 20th Conference on Distributed Computing Systems, pp. 556–563 (2000)
Lai, A.-C., Babak Falsafi, B.: Selective, Accurate, and Timely Self-Invalidation Using Last-Touch Prediction. In: Proc. 27th Int. Symposium on Computer Architecture (ISCA 27), Vancouver, BC, Canada, pp. 139–148 (2000)
Park, T., Yeom, H.: A Low Overhead Logging Scheme for Fast Recovery in Distributed Shared Memory Systems. Journal of Supercomputing 15(3), 295–320 (2002)
Rajwar, R., Kagi, A., Goodman, J.R.: Inferential Queueing and Speculative Push. International Journal of Parallel Programming (IJPP) 32(3), 273–284 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 IFIP International Federation for Information Processing
About this paper
Cite this paper
Danilecki, A., Szychowiak, M. (2006). Using Speculative Push for Unnecessary Checkpoint Creation Avoidance. In: Eliassen, F., Montresor, A. (eds) Distributed Applications and Interoperable Systems. DAIS 2006. Lecture Notes in Computer Science, vol 4025. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11773887_24
Download citation
DOI: https://doi.org/10.1007/11773887_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35126-9
Online ISBN: 978-3-540-35127-6
eBook Packages: Computer ScienceComputer Science (R0)