Proceedings Article10.1109/ICDCS.1997.598058
An efficient logging scheme for recoverable distributed shared memory systems
Taesoon Park,Sungbok Cho,Heon Y. Yeom +2 more
- 27 May 1997
- pp 305-313
28
TL;DR: This paper presents a new logging scheme for recoverable distributed shared memory systems that only the data item accessed by multiple processes is logged when it is invalidated by the overwritten.
read more
Abstract: The paper presents a new logging scheme for recoverable distributed shared memory systems. In previous schemes, the logging is performed whenever a new data item is accessed or written by a process. However, in the proposed scheme, only the data item accessed by multiple processes is logged when it is invalidated by the overwritten. Moreover, the logging is performed at one process responsible for that data item, unlike the other schemes in which every process accessing the data item performs the logging. As a result, the amount and the frequency of logging can be significantly reduced. The performance of the proposed scheme is analyzed using extensive simulation study and our new logging scheme shows superior performance in various system environments.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Patent
Systems and methods for performing data replication
Anand Prahlad,David Ngo +1 more
- 18 Dec 2006
TL;DR: In this paper, the replicated data represents a known good state of the application, as determined by the consistency point entries, and the destination system(s) may perform a storage operation (e.g., snapshot, backup) to copy the replica data and to logically associate the copied data with a time information indicative of the source system time when the application was in the known good states.
442
Patent
Systems and methods for performing replication copy storage operations
Rajiv Kottomtharayil
- 03 May 2013
TL;DR: In this article, a system and method for performing storage operations relating to a first secondary copy of electronic data is described, where a storage policy or storage preferences may dictate that a replication copy should be used in storage operations performed to a particular client, sub-client, data, media or other item.
401
Patent
Rolling cache configuration for a data replication system
Andrei Erofeev
- 18 Dec 2006
TL;DR: In this paper, the replicated data represents a known good state of the application, as determined by the consistency point entries, and the destination system(s) may perform a storage operation (e.g., snapshot, backup) to copy the replica data and to logically associate the copied data with a time information indicative of the source system time when the application was in the known good states.
341
Patent
Systems and methods for managing replicated database data
David Ngo
- 15 Apr 2009
TL;DR: In this paper, a tracking module (e.g., a filter driver) monitors transactions from a database application to a source storage device to generate log entries having at least one marker indicating a known good state of the application.
179
Patent
Systems and methods for performing discrete data replication
Vijay H. Agrawal,Anand Prahlad +1 more
- 09 Dec 2009
TL;DR: In this paper, a replication system uses the journal information to identify modified files, conduct a block-level comparison of only the modified files with corresponding files on the destination system, and identify the particular data blocks that changed.
160
References
Distributed snapshots: determining global states of distributed systems
K. Mani Chandy,Leslie Lamport +1 more
TL;DR: An algorithm by which a process in a distributed system determines a global state of the system during a computation, which helps to solve an important class of problems: stable property detection.
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
TL;DR: Many large sequential computers execute operations in a different order than is specified by the program, and a correct execution by each processor does not guarantee the correct execution of the entire program.
The Nas Parallel Benchmarks
David H. Bailey,Eric Barszcz,John T. Barton,D. S. Browning,Russell Carter,Leonardo Dagum,Rod Fatoohi,Paul O. Frederickson,T. A. Lasinski,Robert Schreiber,Horst D. Simon,V. Venkatakrishnan,Sisira Weeratunga +12 more
- 01 Sep 1991
TL;DR: A new set of benchmarks has been developed for the performance evaluation of highly parallel supercom puters that mimic the computation and data move ment characteristics of large-scale computational fluid dynamics applications.
•Journal Article
The NAS Parallel Benchmarks
TL;DR: The original NAS Parallel Benchmarks consisted of eight individual bench- mark problems, each of which focused on some aspect of scientific computing, although most of these benchmarks have much broader relevance, since in a much larger sense they are typical of many real-world computing applications.
2.1K
Memory consistency and event ordering in scalable shared-memory multiprocessors
Kourosh Gharachorloo,Daniel E. Lenoski,James Laudon,Phillip B. Gibbons,Anoop Gupta,John L. Hennessy +5 more
- 01 May 1990
TL;DR: A new model of memory consistency, called release consistency, that allows for more buffering and pipelining than previously proposed models is introduced and is shown to be equivalent to the sequential consistency model for parallel programs with sufficient synchronization.