A highly available partition-processing protocol for distributed shared memory systems
JW Lin, SY Kuo - European Conference on Parallel Processing, 1996 - Springer
JW Lin, SY Kuo
European Conference on Parallel Processing, 1996•SpringerThis paper investigates the problem of network partitioning in distributed shared memory
(DSM) systems. Network partitioning in a DSM system will severely reduce the availability of
shared pages. We propose a partition-processing protocol for DSM systems, called one-
copy read and nocopy write protocol, to allow that shared pages can be optimistically
accessed in each partition without taking care of the consistency with other partitions.
However, the proposed protocol may introduce the problem: inconsistency between …
(DSM) systems. Network partitioning in a DSM system will severely reduce the availability of
shared pages. We propose a partition-processing protocol for DSM systems, called one-
copy read and nocopy write protocol, to allow that shared pages can be optimistically
accessed in each partition without taking care of the consistency with other partitions.
However, the proposed protocol may introduce the problem: inconsistency between …
Abstract
This paper investigates the problem of network partitioning in distributed shared memory (DSM) systems. Network partitioning in a DSM system will severely reduce the availability of shared pages. We propose a partition-processing protocol for DSM systems, called one-copy read and nocopy write protocol, to allow that shared pages can be optimistically accessed in each partition without taking care of the consistency with other partitions. However, the proposed protocol may introduce the problem: inconsistency between partitions. To resolve the inconsistency problem, we employ a coordinated checkpointing technique to reconstruct the consistency between partitions. Finally, we perform mathematical analysis to evaluate the availability of the proposed protocol.
Springer
Showing the best result for this search. See all results