Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Chapter

Download BibTeX

Title

Checkpointing speculative distributed shared memory

Authors

[ 1 ] Instytut Informatyki (II), Wydział Informatyki i Zarządzania, Politechnika Poznańska | [ P ] employee

Year of publication

2006

Chapter type

paper

Publication language

english

Abstract

EN This paper describes a checkpointing mechanism destined for Distributed Shared Memory (DSM) systems with speculative prefetching. 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 fetched before the actual access operation is performed, resulting, at least potentially, in considerable performance improvement. The proposed mechanism is based on independent checkpointing integrated with a coherence protocol for a given consistency model introducing little overhead. It ensures the consistency of checkpoints, allowing fast recovery from failures.

Pages (from - to)

9 - 16

DOI

10.1007/11752578_2

URL

https://link.springer.com/chapter/10.1007/11752578_2

Book

Parallel Processing and Applied Mathematics : 6th International Conference, PPAM 2005, Poznań, Poland, September 11-14, 2005, Revised Selected Papers

Presented on

6th International Conference on Parallel Processing and Applied Mathematics, PPAM 2005, 11-14.09.2005, Poznań, Polska

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.