Previous [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12]

Journal of Information Science and Engineering, Vol.18 No.6, pp.853-869 (November 2002)


An Optimistic-Based Partition-Processing Approach for
Distributed Shared Memory Systems

Jenn-Wei Lin and Sy-Yen Kuo*
Department of Computer Science and Information Engineering
Fu Jen Catholic University
Taipei, 242 Taiwan
E-mail: jwlin@csie.fju.edu.tw
*Department of Electrical Engineering
National Taiwan University
Taipei, 107 Taiwan
E-mail: sykuo@ee.ntu.edu.tw

This paper investigates the problem of network partitioning in Distributed Shared Memory (DSM) systems. We propose an optimistic-based partition-processing approach, which can make shared pages available when network partitioning occurs. However, this approach does not guarantee that the same page in different partitions can maintain a consistent value. To eliminate this problem, a memory-based coordinated checkpoininting scheme is presented to save consistent states at low cost. If there are inconsistencies between two partitions, one saved consistent state is chosen to perform backward error recovery. Extensive trace-driven simulations have been performed to evaluate the effects of the proposed approach on system performance.

Keywords: network partitioning, distributed shared memory, checkpointing, backward error recovery, trace-driven simulations

Full Text () Retrieve PDF document (200211_01.pdf)

Received August 31, 2001; accepted April 15, 2002.
Communicated by Jang-Ping Sheu, Makoto Takizawa and Myongsoon Park.