Exclusive Access to Resources in Distributed Shared Memory Architecture

• Autorzy: Czaja L.
• Języki publikacji: EN

Abstrakty

EN

A protocol of mutual exclusion with FIFO discipline is devised for distributed systems with Distributed Shared Memory (DSM) and without any central server. To this end, replication of data - a principal feature of DSM is exploited. Some data consistency is discussed.

Słowa kluczowe

EN

distributed shared memory; Logical Time; Global Timestamps

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2012
• Tom: Vol. 119, nr 3/4
• Strony: 265--280
• Opis fizyczny: Bibliogr. 16 poz., rys.

Twórcy

autor

Czaja L.

• Institute of Informatics, Warsaw University, Banacha 2, Warsaw, Poland,

Bibliografia

• [1] Bershad, B.N., Zekauskas, M.J., Sawdon, W.A.: The Midway Distributed Shared Memory System. Proc. IEEE COMPCON Conf., IEEE 1993, pp. 528-537.
• [2] Birrell, A.D., Nelson, B.J.: Implementing Remote Procedure Calls. ACM Trans. on Computer Systems 2(2) (1984) 39-59.
• [3] Cheriton, D.R.: Preliminary Thoughts on Problem-Oriented Shared Memory: a Decentralized Approach to Distributed Systems. ACM Operating Systems Review 19(4) (1985) 26-33.
• [4] Coulouris, G., Dollimore, J., Kindberg, T.: Distributed Systems, Concepts and Design. Addison-Wesley, 1994. Chapter 17.
• [5] Dubois, M., Scheurich, C., Briggs, F.A.: Memory Access Buffering in Multiprocessors. Proc. 13th Ann. Int'l Symp. on Computer Architecture, ACM 1986, pp. 434-442.
• [6] Gharachorloo, K., Lenoski, D., Laudon, J., Gibbons, P., Gupta, A., Henessy, J.: Memory Consistency and Event Ordering in Scalable Shared-Memory Multiprocessors. Proc. 17th Ann. Int'l Symp. on Computer Architecture, ACM 1990, pp. 15-26.
• [7] Hutto, P.W., Ahamad, M.: Slow Memory: Weakening Consistency to Enhance Concurrency in Distributed Shared Memories. Proc. 10th Int'l Conf. on Distributed Computing Systems, IEEE 1990, pp. 302-311.
• [8] Kshemkalyani, A.D., Singhal, M: Distributed Computing: Principles, Algorithms, and Systems. Cambridge University Press, 2008, Chapter 12.
• [9] Lamport, L.: Time, Clocks, and the Ordering of Events in a Distributed System. Comm. ACM 21(7) (1978) 558-565.
• [10] Lamport, L.: How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs. IEEE Trans. on Computers C-28(9) (1979) 690-691.
• [11] Lipton, R.J., Sandberg, J.S.: Pram: A Scalable Shared Memory. Tech. Rep. CS-Tr-180-88, Princeton Univ. 1988.
• [12] Li, K., Huda, P.: Memory Coherence in Shared Virtual Memory Systems. ACM Trans. on Computer Systems 7(4) (1989) 321-359.
• [13] Mosberger, D.: Memory Consistency Models. Tech. Rep. TR 93/11 Dept. of Comp. Sci. Univ. of Arizona 1993.
• [14] Ricart, G., Agravala, A.K.: An Optimal Algorithm for Mutual Exclusion in Computer Networks. Comm. Of the ACM 24(1) (1981) 9-17.
• [15] Tanenbaum, S.: Distributed Operating Systems. Prentice-Hall International Inc. 1995, Chapter 6.
• [16] C. Cachin, R. Guerraoui, L. Rodrigues: Introduction to Reliable and Secure. Distributed Programming. Second Edition, Springer 2011