From Boxwood to Eclipse. Eclipse Evolution2 A Quick Overview of Boxwood Virtualized distributed storage that provides high-level abstractions Storage.

Slides:



Advertisements
Similar presentations
Boxwood: Distributed Data Structures as Storage Infrastructure Lidong Zhou Microsoft Research Silicon Valley Team Members: Chandu Thekkath, Marc Najork,
Advertisements

Boxwood: Abstractions as the Foundation for Storage Infrastructure Lidong Zhou, Microsoft Research Silicon Valley Joint work with Chandu Thekkath, John.
SDN Controller Challenges
Replication Management. Motivations for Replication Performance enhancement Increased availability Fault tolerance.
Replication and Consistency (2). Reference r Replication in the Harp File System, Barbara Liskov, Sanjay Ghemawat, Robert Gruber, Paul Johnson, Liuba.
The Zebra Striped Network Filesystem. Approach Increase throughput, reliability by striping file data across multiple servers Data from each client is.
Serverless Network File Systems. Network File Systems Allow sharing among independent file systems in a transparent manner Mounting a remote directory.
Xen , Linux Vserver , Planet Lab
Transaction.
1 Principles of Reliable Distributed Systems Tutorial 12: Frangipani Spring 2009 Alex Shraer.
ABCSG - Distributed Database 1 Data Management Distributed Database Data Replication.
Coda file system: Disconnected operation By Wallis Chau May 7, 2003.
High Performance Computing Course Notes High Performance Storage.
Computer Science Lecture 21, page 1 CS677: Distributed OS Today: Coda, xFS Case Study: Coda File System Brief overview of other recent file systems –xFS.
Chapter 10: File-System Interface
1 Porcupine: A Highly Available Cluster-based Mail Service Yasushi Saito Brian Bershad Hank Levy University of Washington Department of Computer Science.
Jeff Chheng Jun Du.  Distributed file system  Designed for scalability, security, and high availability  Descendant of version 2 of Andrew File System.
DISTRIBUTED COMPUTING
CS 443 Advanced OS Fabián E. Bustamante, Spring 2005 Porcupine: A Highly Available Cluster- based Mail Service Y. Saito, B. Bershad, H. Levy U. Washington.
Massively Distributed Database Systems Spring 2014 Ki-Joune Li Pusan National University.
Distributed storage for structured data
Reducing Risk with Cloud Storage. Dell Storage Forum 2011 Storage 2 Dells’ Definition of Cloud Demand driven scalability: up or down, just happens Metered:
Copyright © 2012 Cleversafe, Inc. All rights reserved. 1 Combining the Power of Hadoop with Object-Based Dispersed Storage.
Sanjay Ghemawat, Howard Gobioff, and Shun-Tak Leung Google∗
Presented by: Alvaro Llanos E.  Motivation and Overview  Frangipani Architecture overview  Similar DFS  PETAL: Distributed virtual disks ◦ Overview.
Distributed File Systems Concepts & Overview. Goals and Criteria Goal: present to a user a coherent, efficient, and manageable system for long-term data.
1 The Google File System Reporter: You-Wei Zhang.
CSC 456 Operating Systems Seminar Presentation (11/13/2012) Leon Weingard, Liang Xin The Google File System.
Mobility in Distributed Computing With Special Emphasis on Data Mobility.
CS Storage Systems Lecture 14 Consistency and Availability Tradeoffs.
M i SMob i S Mob i Store - Mobile i nternet File Storage Platform Chetna Kaur.
A BigData Tour – HDFS, Ceph and MapReduce These slides are possible thanks to these sources – Jonathan Drusi - SCInet Toronto – Hadoop Tutorial, Amir Payberah.
XML as a Boxwood Data Structure Feng Zhou, John MacCormick, Lidong Zhou, Nick Murphy, Chandu Thekkath 8/20/04.
By: Ashish Gohel 8 th sem ISE.. Why Cloud Computing ? Cloud Computing platforms provides easy access to a company’s high-performance computing and storage.
Chapter 20 Distributed File Systems Copyright © 2008.
What is a Distributed File System?? Allows transparent access to remote files over a network. Examples: Network File System (NFS) by Sun Microsystems.
Distributed File System By Manshu Zhang. Outline Basic Concepts Current project Hadoop Distributed File System Future work Reference.
Introduction to DFS. Distributed File Systems A file system whose clients, servers and storage devices are dispersed among the machines of a distributed.
Lecture # 3 & 4 Chapter # 2 Database System Concepts and Architecture Muhammad Emran Database Systems 1.
Presenters: Rezan Amiri Sahar Delroshan
Serverless Network File Systems Overview by Joseph Thompson.
The Replica Location Service The Globus Project™ And The DataGrid Project Copyright (c) 2002 University of Chicago and The University of Southern California.
IM NTU Distributed Information Systems 2004 Replication Management -- 1 Replication Management Yih-Kuen Tsay Dept. of Information Management National Taiwan.
Service Primitives for Internet Scale Applications Amr Awadallah, Armando Fox, Ben Ling Computer Systems Lab Stanford University.
INTRODUCTION TO DBS Database: a collection of data describing the activities of one or more related organizations DBMS: software designed to assist in.
Computer Science Lecture 19, page 1 CS677: Distributed OS Last Class: Fault tolerance Reliable communication –One-one communication –One-many communication.
11 CLUSTERING AND AVAILABILITY Chapter 11. Chapter 11: CLUSTERING AND AVAILABILITY2 OVERVIEW  Describe the clustering capabilities of Microsoft Windows.
Distributed File Systems Architecture – 11.1 Processes – 11.2 Communication – 11.3 Naming – 11.4.
Introduction.  Administration  Simple DBMS  CMPT 454 Topics John Edgar2.
HADOOP Carson Gallimore, Chris Zingraf, Jonathan Light.
Copyright © 2012 Cleversafe, Inc. All rights reserved. 1 Combining the Power of Hadoop with Object-Based Dispersed Storage.
GPFS: A Shared-Disk File System for Large Computing Clusters Frank Schmuck & Roger Haskin IBM Almaden Research Center.
THE EVOLUTION OF CODA M. Satyanarayanan Carnegie-Mellon University.
Chapter Five Distributed file systems. 2 Contents Distributed file system design Distributed file system implementation Trends in distributed file systems.
Department of Computer Science, Johns Hopkins University EN Instructor: Randal Burns 24 September 2013 NoSQL Data Models and Systems.
Computer Science Lecture 19, page 1 CS677: Distributed OS Last Class: Fault tolerance Reliable communication –One-one communication –One-many communication.
Chapter 8 Fault Tolerance. Outline Introductions –Concepts –Failure models –Redundancy Process resilience –Groups and failure masking –Distributed agreement.
Databases and DBMSs Todd S. Bacastow January 2005.
Sanjay Ghemawat, Howard Gobioff, Shun-Tak Leung
Reducing Risk with Cloud Storage
Large Distributed Systems
Software Design and Architecture
CHAPTER 3 Architectures for Distributed Systems
Google Filesystem Some slides taken from Alan Sussman.
EECS 498 Introduction to Distributed Systems Fall 2017
Today: Coda, xFS Case Study: Coda File System
Distributed File Systems
Outline Review of Quiz #1 Distributed File Systems 4/20/2019 COP5611.
Abstractions for Fault Tolerance
Presentation transcript:

From Boxwood to Eclipse

Eclipse Evolution2 A Quick Overview of Boxwood Virtualized distributed storage that provides high-level abstractions Storage Applications An evolution path for distributed storage:

Eclipse Evolution3 A Quick Overview of Boxwood Virtualized distributed storage that provides high-level abstractions An evolution path for distributed storage: Virtual Disk Storage Applications

Eclipse Evolution4 A Quick Overview of Boxwood Virtualized distributed storage that provides high-level abstractions An evolution path for distributed storage: Storage Applications …… TreeTableList

Eclipse Evolution5 Chunk Store Reliable “Media” ServicesServices Locking Logging Consensus Storage Application High-level Storage Abstractions Boxwood Architecture Replicated Logical Device Magnetic Media B-Tree

Eclipse Evolution6 Open Question What happens if the system experiences massive failures?  Graceful degradation (or mitigating the “availability cliff”)

Eclipse Evolution7 Availability Cliff Availability Failures 1 0 Graceful Degradation Tolerable Failures More Severe

Eclipse Evolution8 Boxwood is Inherently NOT Gracefully Degradable ABCDEFEFABCDGH ABCDE Paxos Service/Monitor Service M : machine M Dependencies are the main problem! B-Tree

Eclipse: Gracefully Degradable Storage Abstractions Courtesy of Shirin Observatory and Science Center, MIT

Failures More Severe System View current scenario Why Eclipse? Tolerable Failures

Eclipse Evolution11 Degraded Availability  A client might have a partial view of data  A client might be allowed to perform a subset of operations on data  We are NOT talking about graceful performance degradation!

Eclipse Evolution12 Benefits of Graceful Degradation  Seamless disaster recovery from massive permanent failures  During massive transient failures or network partitions, Offer a partial system view until system heals Return to a consistent/complete state when system heals

Eclipse Evolution13 Eclipse Concepts  Gracefully degradable storage abstractions Sets or a collection of sets A subset can be considered a degradation  Gracefully degradable and self-restoring system architecture Failure isolation: Failure of one unit should not cause the information on other units to be inaccessible Paxos for the self-restoring point, but operational even without Paxos

Eclipse Evolution14 Is Set Abstraction Useful?  A mail service, where each mailbox can be implemented as a set  A data retention/backup system  MSN Spaces  An emerging trend: A flat structure with search capability to replace a hierarchical structure

Eclipse Evolution15 Availability Cliff Revisited Availability Failures 1 0 More Severe Fault toleranceFault isolation Self-restoration

Eclipse Evolution16 Storing a Set  Set elements are stored on multiple servers  A local index is maintained for each locally stored element  As long as a server is available, its local elements are accessible  A global view can be constructed from local views

Eclipse Evolution17 Global Index as Soft State  Global index for each set Can also maintain metadata for each element Soft state, for performance improvements Can support more complex data structures  Map set id to the server maintaining the set’s global index Paxos maintains the authoritative mapping Mapping disseminated to all servers as hints Same set might have multiple index servers during massive failures

Eclipse Evolution18 Replication Strategies  Limited operations during degraded mode (e.g., no updates)  Optimistic replication: hard to figure out the stabilization point  Inherently weak semantics: immutable elements, tolerance to re- appearance of deleted elements

Eclipse Evolution19 Related Work  Optimistic Replication: (Saito and Shapiro) Bayou (Terry et al.), Coda (Kumar and Satyanarayanan), Ficus (Reiher et al.), and Locus (Walker et al.)  Fault Isolation Hive (Chapin et al.), Archipelago (Ji et al.), Porcupine (Saito et al.), Pangaea (Saito et al.), and D-GRAID (Sivathanu et al.)  Other Related Work Harvest, Yield, and Scalable Tolerant Systems (Fox and Brewer), TACT (Yu and Vahdat)