The application of DRBD in Linux-HA Haibo Zhang 4/28/2014.

Slides:



Advertisements
Similar presentations
Remus: High Availability via Asynchronous Virtual Machine Replication
Advertisements

RAID (Redundant Arrays of Independent Disks). Disk organization technique that manages a large number of disks, providing a view of a single disk of High.
RAID A RRAYS Redundant Array of Inexpensive Discs.
High Performance Cluster Computing Architectures and Systems Hai Jin Internet and Cluster Computing Center.
Mecanismos de alta disponibilidad con Microsoft SQL Server 2008 Por: ISC Lenin López Fernández de Lara.
1 Magnetic Disks 1956: IBM (RAMAC) first disk drive 5 Mb – Mb/in $/year 9 Kb/sec 1980: SEAGATE first 5.25’’ disk drive 5 Mb – 1.96 Mb/in2 625.
Chapter 5: Server Hardware and Availability. Hardware Reliability and LAN The more reliable a component, the more expensive it is. Server hardware is.
REDUNDANT ARRAY OF INEXPENSIVE DISCS RAID. What is RAID ? RAID is an acronym for Redundant Array of Independent Drives (or Disks), also known as Redundant.
High Performance Computing Course Notes High Performance Storage.
U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Emery Berger University of Massachusetts Amherst Operating Systems CMPSCI 377 Lecture.
1 I/O Management in Representative Operating Systems.
I/O Systems and Storage Systems May 22, 2000 Instructor: Gary Kimura.
Servers Redundant Array of Inexpensive Disks (RAID) –A group of hard disks is called a disk array FIGURE Server with redundant NICs.
Copyright © 2002 Wensong Zhang. Page 1 Free Software Symposium 2002 Linux Virtual Server: Linux Server Clusters for Scalable Network Services Wensong Zhang.
Case Study - GFS.
Page 1 Mirror File System A patented breakthrough technology for Business Continuity and Disaster Prevention Twin Peaks Software Inc.
Redundant Array of Inexpensive Disks (RAID). Redundant Arrays of Disks Files are "striped" across multiple spindles Redundancy yields high data availability.
The Hadoop Distributed File System: Architecture and Design by Dhruba Borthakur Presented by Bryant Yao.
Lecture 13 Fault Tolerance Networked vs. Distributed Operating Systems.
RAID and mirroring Track SA-E AfNOG workshop May 15, 2009 Cairo, Egypt (Slides by Phil Regnauld)
Two or more disks Capacity is the same as the total capacity of the drives in the array No fault tolerance-risk of data loss is proportional to the number.
N-Tier Client/Server Architectures Chapter 4 Server - RAID Copyright 2002, Dr. Ken Hoganson All rights reserved. OS Kernel Concept RAID – Redundant Array.
Disk Access. DISK STRUCTURE Sector: Smallest unit of data transfer from/to disk; 512B 2/4/8 adjacent sectors transferred together: Blocks Read/write heads.
Lecture 9 of Advanced Databases Storage and File Structure (Part II) Instructor: Mr.Ahmed Al Astal.
1 Lecture 8: Secondary-Storage Structure 2 Disk Architecture Cylinder Track SectorDisk head rpm.
RAID REDUNDANT ARRAY OF INEXPENSIVE DISKS. Why RAID?
High-Availability Linux.  Reliability  Availability  Serviceability.
Rensselaer Polytechnic Institute CSCI-4210 – Operating Systems CSCI-6140 – Computer Operating Systems David Goldschmidt, Ph.D.
HA-OSCAR Chuka Okoye Himanshu Chhetri. What is HA-OSCAR? “High Availability Open Source Cluster Application Resources”
Presented by, MySQL AB® & O’Reilly Media, Inc. 0 to 60 in 3.1 Tyler Carlton Cory Sessions.
1 Moshe Shadmon ScaleDB Scaling MySQL in the Cloud.
CS 6502 Operating Systems Dr. J.. Garrido Device Management (Lecture 7b) CS5002 Operating Systems Dr. Jose M. Garrido.
High-Availability MySQL DB based on DRBD-Heartbeat Ming Yue September 27, 2007 September 27, 2007.
High-Availability Linux Project (Last updated 24 Septemver, 2003) 30 th December, 2003 Seo Dong Mahn.
Configuring Disk Devices. Module 4 – Configuring Disk Devices ♦ Overview This module deals with making partitions using fdisk, implementing RAID and Logical.
1 Bill Hayden Director, Data Services Edward Jones.
© 2004, D. J. Foreman 1 Implementing Processes and Threads.
 High-Availability Cluster with Linux-HA Matt Varnell Cameron Adkins Jeremy Landes.
RAID Disk Arrays Hank Levy. 212/5/2015 Basic Problems Disks are improving, but much less fast than CPUs We can use multiple disks for improving performance.
U N I V E R S I T Y O F S O U T H F L O R I D A Hadoop Alternative The Hadoop Alternative Larry Moore 1, Zach Fadika 2, Dr. Madhusudhan Govindaraju 2 1.
We will focus on operating system concepts What does it do? How is it implemented? Apply to Windows, Linux, Unix, Solaris, Mac OS X. Will discuss differences.
RAID Systems Ver.2.0 Jan 09, 2005 Syam. RAID Primer Redundant Array of Inexpensive Disks random, real-time, redundant, array, assembly, interconnected,
© Logicalis Group HA options Cross Site Mirroring (XSM) and Orion Jonathan Woods.
Stretching A Wolfpack Cluster Of Servers For Disaster Tolerance Dick Wilkins Program Manager Hewlett-Packard Co. Redmond, WA
CERN - IT Department CH-1211 Genève 23 Switzerland t High Availability Databases based on Oracle 10g RAC on Linux WLCG Tier2 Tutorials, CERN,
 Introduction  Architecture NameNode, DataNodes, HDFS Client, CheckpointNode, BackupNode, Snapshots  File I/O Operations and Replica Management File.
Message Passing Computing 1 iCSC2015,Helvi Hartmann, FIAS Message Passing Computing Lecture 2 Message Passing Helvi Hartmann FIAS Inverted CERN School.
MySQL Cluster High-Availability Distributed Database.
Enhanced Availability With RAID CC5493/7493. RAID Redundant Array of Independent Disks RAID is implemented to improve: –IO throughput (speed) and –Availability.
Network-Attached Storage. Network-attached storage devices Attached to a local area network, generally an Ethernet-based network environment.
High Availability Low Dollar Clustered Storage
CSE 451: Operating Systems Spring 2010 Module 18 Redundant Arrays of Inexpensive Disks (RAID) John Zahorjan Allen Center 534.
High Availability Clusters in Linux Sulamita Garcia EDS Unix Specialist
USEIMPROVEEVANGELIZE Solutions for High Availability and Disaster Recovery with MySQL ● Detlef Ulherr ● Sun Microsystems.
Implementing Processes and Threads
CSE451 I/O Systems and the Full I/O Path Autumn 2002
Unit OS10: Fault Tolerance
Chapter 7: Consistency & Replication IV - REPLICATION MANAGEMENT -Sumanth Kandagatla Instructor: Prof. Yanqing Zhang Advanced Operating Systems (CSC 8320)
High Availability Low Dollar Clustered Storage
CSE 451: Operating Systems Spring 2006 Module 18 Redundant Arrays of Inexpensive Disks (RAID) John Zahorjan Allen Center.
RAID Disk Arrays Hank Levy 1.
RAID RAID Mukesh N Tekwani
Dave LIVE Linux AG Buildout!.
RAID Disk Arrays Hank Levy 1.
Selecting a Disk-Scheduling Algorithm
Overview Continuation from Monday (File system implementation)
UNIT IV RAID.
RAID Disk Arrays Hank Levy 1.
RAID RAID Mukesh N Tekwani April 23, 2019
Disk Scheduling The operating system is responsible for using hardware efficiently — for the disk drives, this means having a fast access time and disk.
Presentation transcript:

The application of DRBD in Linux-HA Haibo Zhang 4/28/2014

What is DRBD? DRBD (Distributed Replicated Block Device) is a software development for high availability clusters

What is the HA? The Linux-HA (High-Availability Linux project provides a high availability (clustering) Solution for Linux, FreeBSD, OpenBSD, Solaris and which promotes reliability, availability, and serviceability (RAS).

Easy way to understand Disk Array RAID ( Redundant Arrays of Inexpensive Disks , RAID )

The structure of HA

DRBD core functionality by Linux kernel implements, Under the file system it is closest to the IO stack. Conducive to the transmission of the data System should be the shared disk file system like GFS2 ; OCFS2

How the DRBD running Mirroring of important data Fully synchronous switch between master slave

File transfer The local write return immediately successful and the data is sent to the other party, dual both power-down, the data may be lost Local and the other write successfully identified and returned. Dual power-down or also damaged disk, the data may be lost Return immediately write local success, the data on buffer. may be lost Copy data Asynchronous Memory synchronization

heartbeat

Split brain Each node want to switch to master node when the net broken Quorum Algorithm to handle split brain

Core of the progress Input data heartbeat Copy data Receive Data respond Transfer data to node Input data heartbeat Copy data

DRBD in the in reality Company with big data Bank Database system

Tha Thank You!