Single fault-tolerant distributed shared memory using competitive update

Microprocessors and Microsystems

Volumn 21, Issue 3, 1997, Pages 183-196

  Kim, Jai Hoon ^a   Vaidya, Nitin H ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

Back up; Competitive update; Fault tolerant; Recoverable distributed shared memory

Indexed keywords

COMPUTER SYSTEM RECOVERY; DATA COMMUNICATION SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; NETWORK PROTOCOLS;

COMPETITIVE UPDATE PROTOCOL; DISTRIBUTED SHARED MEMORY;

DATA STORAGE EQUIPMENT;

EID: 0031372045     PISSN: 01419331     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0141-9331(97)00032-X     Document Type: Article

References (31)

1. S.V. Adve, Designing memory consistency models for shared-memory multiprocessors, PhD thesis, University of Wisconsin-Madison, December 1993.
2. C. Anderson, A. Karlin, Two adaptive hybrid cache coherency protocols, in: Proc. Int. Symp. High-Performance Computer Architecture, 1996, pp. 303-313.
3. J. Archibald, A cache coherence approach for large multiprocessor systems, in: Int. Conf. Supercomputing, July 1988, pp. 337-345.
4. M. Banatre, A. Gefflaut, C. Morin, Tolerating node failures in cache only memory architectures, Tech. Rep. 853, INRIA, 1994.
5. M. Banatre, P. Heng, G. Muller, N. Peyrouze, B. Rochat, An experience in the design of a reliable object based system, in: Int. Conf. Parallel, Distributed Information Systems, 1993.
6. L. Brown, J. Wu, Dynamic snooping in a fault-tolerant distributed shared memory, in: Symp. Distributed Computing Systems, 1994, pp. 218-226.
7. J. Carter, D. Khandekar, L. Kamb, Distributed shared memory: Where we are and where we should be headed, in: Proc. 5th Workshop Hot Topics in Operating Systems, May 1995, pp. 119-122.
8. J.B. Carter, Efficient distributed shared memory based on multi-protocol release consistency, PhD thesis, Rice University, Sept. 1993.
9. F. Dahlgren, M. Dubois, P. Stenstrom, Combined performance gains of simple cache protocol extentions, in: Proc. 21st Annu. Int. Symp. Computer Architecture, Apr. 1994, pp. 187-197.
10. T. Fuchi, M. Tokoro, A mechanism for recoverable shared virtual memory, 1994.
11. H. Grahn, P. Stenstrom, M. Dubois, Implementation and evaluation of update-based cache protocols under relaxed memory consistency models, Future Generation Comput. Syst. 11 (1995) 247-271.
12. G. Janakiraman, Y. Tamir, Coordinated checkpointing-rollback error recovery for distributed shared memory multicomputer, in: 13th Symp. Reliable Distributed Systems, Oct. 1994.
13. B. Janssens, W.K. Fuchs, Relaxing consistency in recoverable distributed shared memory, in: Proc. 23rd Int. Symp. Fault-Tolerant Computing, 1993, pp. 155-163.
14. B. Janssens, W.K. Fuchs, Reducing interprocessor dependence in recoverable distributed shared memory, in: 13th Symp. Reliable Distributed Systems, Oct. 1994.
15. A. Karlin, M. Manasse, L. Rudolph, D. Sleator, Competitive snoopy caching, in: Proc. 27th Annu. Symp. Foundations of Computer Science, 1986, pp. 244-254.
16. A.-M. Kermarrec, G. Cabillic, A. Gefflaut, C. Morin, I. Puaut, A recoverable distributed shared memory integrating coherence and recoverability, in: Proc. 25th Int. Symp. Fault-Tolerant Computing, 1995, pp. 289-298.
17. D. Khandekar, Quarks: Portable dsm on unix, Tech. Rep., University of Utah.
18. J.-H. Kim, N.H. Vaidya, Recoverable distributed shared memory using the competitive update protocol, in: 1995 Pacific Rim Int. Symp. Fault-Tolerant Systems, 1995, pp. 152-157.
19. J.-H. Kim, N.H. Vaidya, A cost-comparison approach for adaptive distributed shared memory, in: ACM Int. Conf. Supercomputing (ICS), May 1996, pp. 44-51.
20. K. Li, P. Hudak, Memory coherence in shared virtual memory systems, ACM Trans. Comput. Syst. 7 (1989) 321-359.
21. N. Neves, M. Castrol, P. Guedes, A checkpoint protocol for an entry consistent shared memory system, in: Symp. Principles of Distributed Computing, Aug. 1994, pp. 121-129.
22. B. Nitzberg, V. Lo, Distributed shared memory: A survey of issues and algorithms, IEEE Comput. 24 (1991) 52-60.
23. J. Plank, M. Beck, G. Kingsley, K. Li, Libckpt, Transparent checkpointing under unix, in: Usenix Winter 1995 Tech. Conf., Jan. 1995.
24. J. Plank, K. Li, Faster checkpointing with n + 1 parity, in: Proc. 24th Int. Symp. Fault-Tolerant Computing, 1994, pp. 288-297.
25. A. Raynaud, Z. Zhang, J. Torrellas, Distance-adaptive update protocols for scalable shared-memory multiprocessors, in: Proc. Int. Symp. on High-Performance Computer Architecture, 1996, pp. 323-334.
26. G. Richard, M. Singhal, Using logging and asynchronous checkpointing to implement recoverable distributed shared memory, in: 12th Symp. Reliable Distributed Systems, 1993.
27. M. Stumm, S. Zhou, Algorithms implementing distributed shared memory, IEEE Comput., (1990) 54-64.
28. M. Stumm, S. Zhou, Fault tolerant distributed shared memory algorithms, in: Proc. Int. Conf. Parallel and Distributed Processing, 1990, pp. 719-724.
29. O. Theel, B. Fleisch, Design and analysis of highly available and scalable coherence protocols for distributed shared memory systems using stochastic modeling, in: Proc. Int. Conf. Parallel Processing, vol. I, 1995.
30. N.H. Vaidya, A case for two-level distributed recovery schemes, in: ACM SIGMETRICS Conf. Measurement and Modeling of Computer Systems, 1995, pp. 64-73.
31. K.-L. Wu, W.K. Fuchs. Recoverable distributed shared virtual memory: Memory coherence and storage structures, in: Proc. 19th Int. Symp. Fault-Tolerant Computing, 1989, pp. 520-527.