DISTRIBUTED CONSISTENCY MANAGEMENT IN A SINGLE ADDRESS SPACE DISTRIBUTED OPERATING SYSTEM Sombrero.

Slides:



Advertisements
Similar presentations
Multiple Processor Systems
Advertisements

L.N. Bhuyan Adapted from Patterson’s slides
More on File Management
Cache Coherence Mechanisms (Research project) CSCI-5593
1 Cache and Caching David Sands CS 147 Spring 08 Dr. Sin-Min Lee.
Topics covered: Memory subsystem CSE243: Introduction to Computer Architecture and Hardware/Software Interface.
Consistency and Replication Chapter 7 Part II Replica Management & Consistency Protocols.
Virtual Memory. Hierarchy Cache Memory : Provide invisible speedup to main memory.
Serverless Network File Systems. Network File Systems Allow sharing among independent file systems in a transparent manner Mounting a remote directory.
Multiple Processor Systems
Cache Coherent Distributed Shared Memory. Motivations Small processor count –SMP machines –Single shared memory with multiple processors interconnected.
Distributed Operating Systems CS551 Colorado State University at Lockheed-Martin Lecture 4 -- Spring 2001.
DISTRIBUTED CONSISTENCY MANAGEMENT IN A SINGLE ADDRESS SPACE DISTRIBUTED OPERATING SYSTEM Sombrero.
File Systems Implementation
Distributed Process Management
1 Lecture 22: Fault Tolerance Papers: Token Coherence: Decoupling Performance and Correctness, ISCA’03, Wisconsin A Low Overhead Fault Tolerant Coherence.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved DISTRIBUTED SYSTEMS.
Improving IPC by Kernel Design Jochen Liedtke Shane Matthews Portland State University.
Distributed Resource Management: Distributed Shared Memory
RGF M.S. Thesis Presentaton 12/011 Reduced Development Costs in the Operating System.
CSE 490dp Resource Control Robert Grimm. Problems How to access resources? –Basic usage tracking How to measure resource consumption? –Accounting How.
Implementation of Distributed Air Traffic Control Simulator Ranko Radovanović, Miloš Cvetanović, Zaharije Radivojević School of Electrical Engineering,
MODERN OPERATING SYSTEMS Third Edition ANDREW S. TANENBAUM Chapter 4 File Systems Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc.
Multiple Processor Systems. Multiprocessor Systems Continuous need for faster and powerful computers –shared memory model ( access nsec) –message passing.
Computer Architecture Lecture 28 Fasih ur Rehman.
TreadMarks Distributed Shared Memory on Standard Workstations and Operating Systems Pete Keleher, Alan Cox, Sandhya Dwarkadas, Willy Zwaenepoel.
August 15, 2001Systems Architecture II1 Systems Architecture II (CS ) Lecture 12: Multiprocessors: Non-Uniform Memory Access * Jeremy R. Johnson.
Shared Address Space Computing: Hardware Issues Alistair Rendell See Chapter 2 of Lin and Synder, Chapter 2 of Grama, Gupta, Karypis and Kumar, and also.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved Chapter 2 ARCHITECTURES.
IT253: Computer Organization
Performance of the Shasta distributed shared memory protocol Daniel J. Scales Kourosh Gharachorloo 創造情報学専攻 M グェン トアン ドゥク.
Properties of Layouts Single failure correcting: no two units of same stripe are mapped to same disk –Enables recovery from single disk crash Distributed.
Multiple Processor Systems. Multiprocessor Systems Continuous need for faster computers –shared memory model ( access nsec) –message passing multiprocessor.
SYNAR Systems Networking and Architecture Group CMPT 886: Computer Architecture Primer Dr. Alexandra Fedorova School of Computing Science SFU.
Ch 10 Shared memory via message passing Problems –Explicit user action needed –Address spaces are distinct –Small Granularity of Transfer Distributed Shared.
1 Lecture 24: Fault Tolerance Papers: Token Coherence: Decoupling Performance and Correctness, ISCA’03, Wisconsin A Low Overhead Fault Tolerant Coherence.
Page 1 Distributed Shared Memory Paul Krzyzanowski Distributed Systems Except as otherwise noted, the content of this presentation.
Acknowledgement: These slides are adapted from slides provided in Thißen & Spaniol's course Distributed Systems and Middleware, RWTH Aachen Processes Distributed.
操作系统原理 OPERATING SYSTEMS Chapter 4 File Systems 文件系统.
SYNAR Systems Networking and Architecture Group CMPT 886: Computer Architecture Primer Dr. Alexandra Fedorova School of Computing Science SFU.
CMSC 611: Advanced Computer Architecture Shared Memory Most slides adapted from David Patterson. Some from Mohomed Younis.
Running Commodity Operating Systems on Scalable Multiprocessors Edouard Bugnion, Scott Devine and Mendel Rosenblum Presentation by Mark Smith.
 The emerged flash-memory based solid state drives (SSDs) have rapidly replaced the traditional hard disk drives (HDDs) in many applications.  Characteristics.
The University of Adelaide, School of Computer Science
Cache Coherence: Directory Protocol
Cache Coherence: Directory Protocol
MODERN OPERATING SYSTEMS Third Edition ANDREW S
תרגול מס' 5: MESI Protocol
Improving Memory Access 1/3 The Cache and Virtual Memory
DISTRIBUTED SYSTEMS Principles and Paradigms Second Edition ANDREW S
Lecture 18: Coherence and Synchronization
Ivy Eva Wu.
Flexible Synchronisation of Shared Groupware Objects
Exploiting Memory Hierarchy Chapter 7
CMSC 611: Advanced Computer Architecture
Using Packet Information for Efficient Communication in NoCs
CMPT 886: Computer Architecture Primer
FIGURE 12-1 Memory Hierarchy
Distributed P2P File System
Outline Midterm results summary Distributed file systems – continued
Multiple Processor Systems
Memory Systems CH008.
Lecture 25: Multiprocessors
Prof. Leonardo Mostarda University of Camerino
High Performance Computing
Improving IPC by Kernel Design
CS703 - Advanced Operating Systems
Cache coherence CEG 4131 Computer Architecture III
Distributed Resource Management: Distributed Shared Memory
DISTRIBUTED SYSTEMS Principles and Paradigms Second Edition ANDREW S
Presentation transcript:

DISTRIBUTED CONSISTENCY MANAGEMENT IN A SINGLE ADDRESS SPACE DISTRIBUTED OPERATING SYSTEM Sombrero

John Olson M.S. Thesis Presentation 8/02 Request Access

John Olson M.S. Thesis Presentation 8/02 Page Miss After Token Set

John Olson M.S. Thesis Presentation 8/02 Simplified Memory Object Control Block

John Olson M.S. Thesis Presentation 8/02 Copy Set Graph with Arity 2

John Olson M.S. Thesis Presentation 8/02 Copy Set Parent Graph

John Olson M.S. Thesis Presentation 8/02 Copy Set Parent Graph Depicted As Linear Graphs

John Olson M.S. Thesis Presentation 8/02 Last Known Writer Graph

John Olson M.S. Thesis Presentation 8/02 Extended Last Known Writer Graph with Cycle

John Olson M.S. Thesis Presentation 8/02 Pruned Last Known Writer Graph

John Olson M.S. Thesis Presentation 8/02 Extended Pruned Last Known Writer Graph

John Olson M.S. Thesis Presentation 8/02 Modified-Page Cache Graph

John Olson M.S. Thesis Presentation 8/02 Process of Pruning Modified Page Cache Graph

John Olson M.S. Thesis Presentation 8/02 Pruned Modified Page Cache Graph

John Olson M.S. Thesis Presentation 8/02 Page Flushing upon MPC Graph Pruning

John Olson M.S. Thesis Presentation 8/02 Overlay View of Four Graphs

John Olson M.S. Thesis Presentation 8/02 Last Known Writer Graph of Figure 10 After Node Deletion

John Olson M.S. Thesis Presentation 8/02 Delete Node From Last Known Writer Graph Algorithm

John Olson M.S. Thesis Presentation 8/02 Delete Node From Modified-Page Cache Graph Algorithm

John Olson M.S. Thesis Presentation 8/02 Current Sombrero Architecture on a Single Node

John Olson M.S. Thesis Presentation 8/02 Token Tracking Invocation Scenarios

John Olson M.S. Thesis Presentation 8/02 Token Tracking Invocation Scenarios - continued 4 Requesting Node receives message from current LKW node that token has been revoked / NotifyGrantTokenOK

John Olson M.S. Thesis Presentation 8/02 Token Tracking Invocation Scenarios – continued 7(2) Page Miss Paging Service

John Olson M.S. Thesis Presentation 8/02 Token Tracking Invocation Scenarios – continued

John Olson M.S. Thesis Presentation 8/02 Token Tracking Invocation Scenarios – continued

John Olson M.S. Thesis Presentation 8/02 Request Write Permission Algorithm

John Olson M.S. Thesis Presentation 8/02 Send Modified Pages to Peer Algorithm

John Olson M.S. Thesis Presentation 8/02 Receive Request for Write Token from Peer Algorithm

John Olson M.S. Thesis Presentation 8/02 Receive Modified Pages from Peer Algorithm

John Olson M.S. Thesis Presentation 8/02 Handle Local MPC Graph Pruning

John Olson M.S. Thesis Presentation 8/02 Sombrero Simulation Implementation Architecture

John Olson M.S. Thesis Presentation 8/02 Sombrero to Simulation Mapping

John Olson M.S. Thesis Presentation 8/02 Single Node Access

John Olson M.S. Thesis Presentation 8/02 Two Node Access

John Olson M.S. Thesis Presentation 8/02 Three Node Scenario

John Olson M.S. Thesis Presentation 8/02 Three Node Multiple Pages

John Olson M.S. Thesis Presentation 8/02 MRMW Three Node Scenario

John Olson M.S. Thesis Presentation 8/02 Thread Migration Scenarios on a Memory Object

John Olson M.S. Thesis Presentation 8/02 Questions