论文信息 - The Pilgrim: a new consistency protocol for distributed shared memory

The Pilgrim: a new consistency protocol for distributed shared memory

We propose a new consistency protocol named Pilgrim for distributed shared memory (DSM) where different shared objects are replicated at each site. This protocol provides both reliable consistency and guaranteed performance. This protocol is discussed and proved with a finite state automaton, and we demonstrate its qualities.

H. Guyennet | J.-C. Lapayre | M. Trehel

[1] Anoop Gupta,et al. Memory consistency and event ordering in scalable shared-memory multiprocessors , 1990, ISCA '90.

[2] Mamoru Maekawa,et al. A N algorithm for mutual exclusion in decentralized systems , 1985, TOCS.

[3] Ashok K. Agrawala,et al. An optimal algorithm for mutual exclusion in computer networks , 1981, CACM.

[4] Leslie Lamport,et al. Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[5] Gérard Le Lann,et al. Distributed Systems - Towards a Formal Approach , 1977, IFIP Congress.

[6] Jean-Christophe Lapayre,et al. A co-operative application management platform based on shared virtual memory , 1996, Proceedings of 3rd International Conference on High Performance Computing (HiPC).

[7] Paul Hudak,et al. Memory coherence in shared virtual memory systems , 1989, TOCS.

[8] M. Raynal,et al. A Suite of Formal Definitions for Consistency Criteria in Distributed Shared Memories , 1996 .

[9] Anoop Gupta,et al. Memory consistency and event ordering in scalable shared-memory multiprocessors , 1990, [1990] Proceedings. The 17th Annual International Symposium on Computer Architecture.

[10] Rida A. Bazzi,et al. The power of processor consistency , 1993, SPAA '93.

[11] Mohamed Naimi,et al. An Improvement of the \logN Distributed Algorithm for Mutual Exclusion , 1987, ICDCS.