PDF-Lesson 07:Distributed Shared Memory Systems

Chapter 12 Multiprocessor Architectures Schaum. Overview of . Distributed Systems. Andrew. . Tanenbaum. and Marten van Steen, . Distributed Systems – Principles and Paradigms. , Prentice Hall, c2002.. Outline. Overview. Goals. Software. Client Server. Distributed Shared Memory. Shared Memory. Shared memory programs are easier to write. Multiprocessor systems. Message passing systems:. - no physically shared memory. - need to provide an abstraction of shared memory: Distributed Shared Memory. 1. 9. Linking and Sharing. 9.1 Single-Copy Sharing . Why Share . Requirements for Sharing. Linking and Sharing . 9.2 Sharing in Systems without Virtual Memory. 9.3 Sharing in Paging Systems. Sharing of Data. Spring 2015. Ki-. Joune. Li . http://isel.cs.pusan.ac.kr/~lik. Pusan National University. An . assignment. Choose an electronic (or electric) device . Define additional functions with. . data storage. Gokarna Sharma. (A joint work with . Costas Busch. ). Louisiana State University. Agenda. Introduction and Motivation. Scheduling Bounds in Different Software Transactional Memory Implementations. Tightly-Coupled Shared Memory Systems. 1. COMET: Code Offload by. Migrating Execution Transparently. OSDI'12. Mark Gordon, Anoushe Jamshidi,. Scott Mahlke, Z. Morley Mao, and Xu Chen. University of Michigan, AT&T Labs - Research. Mark Gordon. multicore issues. By Paul Grubbs. Portions of this talk were taken from Deniz Altinbuken’s talk on Disco in 2009: http://www.cs.cornell.edu/courses/cs6410/2009fa/lectures/09-multiprocessors.ppt. What papers will we be discussing?. ISIT 2017 Tutorial. Viveck R. Cadambe (Pennsylvania State . University). Pulkit. Grover (Carnegie Mellon University). Motivation. Worldwide Data Storage, 0.8 ZB in 2009, . 4.4 ZB in 2013, 44 ZB in 2020. Clocks. External clock synchronization (. Cristian. ). Internal clock synchronization (. Gusella. & . Zatti. ). Network Time Protocol (Mills). Decisions. Agreement protocols (Fischer). Data. Distributed file . . Course Review. Final Exam. December 19, 4:10-6:10 PM. MAT 417. Open . book/notes. Textbook . or printings of the . slides. No any other kinds . of materials are allowed. What we have learnt so far… . Recall: Microprocessors are classified by how memory is organized. Tightly-coupled multiprocessor systems use the same memory. They are also referred to as . shared memory multiprocessors. .. The processors do not necessarily have to share the same block of physical memory: . The Linux Operating System. Small Linux Clusters. Parallel Computing. The . Neuronix. Cluster. Supercomputing. Lecture 01: . History of High Performance Computing. Course Syllabus and Web Site. A Brief History of Supercomputing. Lecture 19. April . 4. th. , . 2012. Bus-Based Shared Memory (. Con’t. ). Distributed Shared Memory. Prof John D. Kubiatowicz. http://www.cs.berkeley.edu/~kubitron/cs252. Recall: Natural Extensions of Memory System. Lecture 21. April . 11. th. , . 2012. Distributed Shared Memory (. con’t. ). Synchronization. Prof John D. Kubiatowicz. http://www.cs.berkeley.edu/~kubitron/cs252. Recall: Sequential Consistency of Directory Protocols.