ICOM 6005 – Database Management Systems Design Dr. Manuel Rodríguez-Martínez Electrical and Computer Engineering Department Lecture ?? – September October.

Slides:



Advertisements
Similar presentations
Disk Arrays COEN 180. Large Storage Systems Collection of disks to store large amount of data. Performance advantage: Each drive can satisfy only so many.
Advertisements

RAID Redundant Arrays of Independent Disks Courtesy of Satya, Fall 99.
I/O Management and Disk Scheduling
Faculty of Information Technology Department of Computer Science Computer Organization Chapter 7 External Memory Mohammad Sharaf.
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 Oh yes Whats RAID? Redundant Array (of) Independent Disks. A scheme involving multiple disks which replicates data across multiple drives. Methods.
RAID: Redundant Array of Inexpensive Disks Supplemental Material not in book.
RAID Redundant Array of Independent Disks
CS 6560: Operating Systems Design
CSCE430/830 Computer Architecture
ICOM 6005 – Database Management Systems Design Dr. Manuel Rodríguez-Martínez Electrical and Computer Engineering Department Lecture 8 – File Structures.
Operating Systems ECE344 Ashvin Goel ECE University of Toronto Disks and RAID.
ICOM 6005 – Database Management Systems Design Dr. Manuel Rodríguez-Martínez Electrical and Computer Engineering Department Lecture 11 – Hash-based Indexing.
CSE521: Introduction to Computer Architecture Mazin Yousif I/O Subsystem RAID (Redundant Array of Independent Disks)
Lecture 36: Chapter 6 Today’s topic –RAID 1. RAID Redundant Array of Inexpensive (Independent) Disks –Use multiple smaller disks (c.f. one large disk)
CSCE 212 Chapter 8 Storage, Networks, and Other Peripherals Instructor: Jason D. Bakos.
RAID Technology. Use Arrays of Small Disks? 14” 10”5.25”3.5” Disk Array: 1 disk design Conventional: 4 disk designs Low End High End Katz and Patterson.
ICOM 6005 – Database Management Systems Design Dr. Manuel Rodríguez-Martínez Electrical and Computer Engineering Department Lecture 16 – Intro. to Transactions.
Reliability of Disk Systems. Reliability So far, we looked at ways to improve the performance of disk systems. Next, we will look at ways to improve the.
1 Advanced Database Technology February 12, 2004 DATA STORAGE (Lecture based on [GUW ], [Sanders03, ], and [MaheshwariZeh03, ])
Computer ArchitectureFall 2007 © November 28, 2007 Karem A. Sakallah Lecture 24 Disk IO and RAID CS : Computer Architecture.
CPSC-608 Database Systems Fall 2008 Instructor: Jianer Chen Office: HRBB 309B Phone: Notes #6.
Lecture 17 I/O Optimization. Disk Organization Tracks: concentric rings around disk surface Sectors: arc of track, minimum unit of transfer Cylinder:
Computer ArchitectureFall 2008 © November 12, 2007 Nael Abu-Ghazaleh Lecture 24 Disk IO.
Disks CS 416: Operating Systems Design, Spring 2001 Department of Computer Science Rutgers University
Secondary Storage CSCI 444/544 Operating Systems Fall 2008.
Storage System: RAID Questions answered in this lecture: What is RAID? How does one trade-off between: performance, capacity, and reliability? What is.
ICOM 6005 – Database Management Systems Design Dr. Manuel Rodríguez-Martínez Electrical and Computer Engineering Department Lecture 5 – Storage Organization.
CS4432: Database Systems II Data Storage (Better Block Organization) 1.
ICOM 6005 – Database Management Systems Design Dr. Manuel Rodríguez-Martínez Electrical and Computer Engineering Department Lecture 6 – RAID ©Manuel Rodriguez.
Chapter 6 RAID. Chapter 6 — Storage and Other I/O Topics — 2 RAID Redundant Array of Inexpensive (Independent) Disks Use multiple smaller disks (c.f.
CS 352 : Computer Organization and Design University of Wisconsin-Eau Claire Dan Ernst Storage Systems.
1 Recitation 8 Disk & File System. 2 Disk Scheduling Disks are at least four orders of magnitude slower than main memory –The performance of disk I/O.
CSE 321b Computer Organization (2) تنظيم الحاسب (2) 3 rd year, Computer Engineering Winter 2015 Lecture #4 Dr. Hazem Ibrahim Shehata Dept. of Computer.
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.
I/O – Chapter 8 Introduction Disk Storage and Dependability – 8.2 Buses and other connectors – 8.4 I/O performance measures – 8.6.
1 Chapter 7: Storage Systems Introduction Magnetic disks Buses RAID: Redundant Arrays of Inexpensive Disks.
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.
RAID COP 5611 Advanced Operating Systems Adapted from Andy Wang’s slides at FSU.
Lecture 9 of Advanced Databases Storage and File Structure (Part II) Instructor: Mr.Ahmed Al Astal.
Parity Logging O vercoming the Small Write Problem in Redundant Disk Arrays Daniel Stodolsky Garth Gibson Mark Holland.
© Pearson Education Limited, Chapter 16 Physical Database Design – Step 7 (Monitor and Tune the Operational System) Transparencies.
CE Operating Systems Lecture 20 Disk I/O. Overview of lecture In this lecture we will look at: Disk Structure Disk Scheduling Disk Management Swap-Space.
RAID SECTION (2.3.5) ASHLEY BAILEY SEYEDFARAZ YASROBI GOKUL SHANKAR.
1/14/2005Yan Huang - CSCI5330 Database Implementation – Storage and File Structure Storage and File Structure.
ICOM 5016– Intro. to Database Systems Lecture 11 - Buffer Management and RAID Dr. Manuel Rodríguez-Martínez Electrical and Computer Engineering Department.
Redundant Array of Independent Disks.  Many systems today need to store many terabytes of data.  Don’t want to use single, large disk  too expensive.
Lecture 40: Review Session #2 Reminders –Final exam, Thursday 3:10pm Sloan 150 –Course evaluation (Blue Course Evaluation) Access through.
Database System Concepts, 6 th Ed. ©Silberschatz, Korth and Sudarshan See for conditions on re-usewww.db-book.com Lecture 11: Storage Organization.
ICOM 5016– Intro. to Database Systems Lecture 12 – RAID and Buffer Management Dr. Bienvenido Vélez Electrical and Computer Engineering Department Slides.
ICOM 5016 – Introduction to Database Systems Lecture 13- File Structures Dr. Bienvenido Vélez Electrical and Computer Engineering Department Slides by.
Chapter 14: Mass-Storage Systems Disk Structure. Disk Scheduling. RAID.
ICOM 6005 – Database Management Systems Design Dr. Manuel Rodríguez-Martínez Electrical and Computer Engineering Department Lecture 7 – Buffer Management.
CPSC 231 Secondary storage (D.H.)1 Learning Objectives Understanding disk organization. Sectors, clusters and extents. Fragmentation. Disk access time.
Hands-On Microsoft Windows Server 2008 Chapter 7 Configuring and Managing Data Storage.
COSC 6340: Disks 1 Disks and Files DBMS stores information on (“hard”) disks. This has major implications for DBMS design! » READ: transfer data from disk.
Part IV I/O System Chapter 12: Mass Storage Structure.
Enhanced Availability With RAID CC5493/7493. RAID Redundant Array of Independent Disks RAID is implemented to improve: –IO throughput (speed) and –Availability.
CS422 Principles of Database Systems Disk Access Chengyu Sun California State University, Los Angeles.
I/O Errors 1 Computer Organization II © McQuain RAID Redundant Array of Inexpensive (Independent) Disks – Use multiple smaller disks (c.f.
Multiple Platters.
RAID Redundant Arrays of Independent Disks
Disks and RAID.
ICOM 5016– Intro. to Database Systems
RAID RAID Mukesh N Tekwani
ICOM 6005 – Database Management Systems Design
Data Orgnization Frequently accessed data on the same storage device?
RAID RAID Mukesh N Tekwani April 23, 2019
Presentation transcript:

ICOM 6005 – Database Management Systems Design Dr. Manuel Rodríguez-Martínez Electrical and Computer Engineering Department Lecture ?? – September October 18, 2001

ICOM 6005Dr. Manuel Rodriguez Martinez2 Readings Read –New Book: Chapter 7 “Storing Data: Disks and Files” –Old Book: Chapter 3 “Storing Data: Disks and Files” –Paper: “Disk Striping” by Kenneth Salem and Hector Garcia-Molina

ICOM 6005Dr. Manuel Rodriguez Martinez3 Disks as performance bottlenecks … Microprocessor speed increase 50% per year. Disk performance improvements –Access time decreases 10% per year –Transfer rate decreases 20% per year Disk crash results in data loss. Solution: Disk array –Have several disk behave as a single large and very fast disk. Parallel I/O –Put some redundancy to recover from a failure somewhere in the array

ICOM 6005Dr. Manuel Rodriguez Martinez4 Disk Array Several disks are group into a single logical unit. Disk Array Controller Bus Controller System Bus CPUMemory

ICOM 6005Dr. Manuel Rodriguez Martinez5 Disk striping Disk striping is a mechanism to divide the data in a file into segments that are scattered over the disks of the disk array. The minimum size of a segment is 1 bit, in which case each data blocks must be read from several disks to extract the appropriate bits. –The drawback of this approach is the overhead of managing data at the level of bits. Better approach is to have a striping unit of 1 disk block. –Sequential I/O can be run parallel since block can be fetched in parallel from the disks.

ICOM 6005Dr. Manuel Rodriguez Martinez6 Disk Stripping – Block sized Disk stripping can be used to partition the data in a file into equal-sized segments of a block size that are distributed over the disk array. Disk Array Controller Bus File Disk Blocks

ICOM 6005Dr. Manuel Rodriguez Martinez7 Data Allocation Data is partitioned into equal sized segments –Stripping unit Each segment is stored in a different disk of the arrays Typically, round-robin algorithm is used If we have n disks, then partition i is stored at disk –i mod n Example: Array of 5 disks, and file of 1MB with a 4KB stripping unit –Disk 0: gets partitions: 0, 5, 10, 15, 20, … –Disk 1: gets partitions: 1, 6, 11, 16, 21, … –Disk 2: gets partitions: 2, 7, 12, 17, 22, … –Etc.

ICOM 6005Dr. Manuel Rodriguez Martinez8 Benefits of Striping With striping we can access data blocks in parallel! –issue a request to the proper disks to get the blocks For example, suppose we have a 5-disk array with 4KB striping and disk blocks. Let F be a 1MB file. If we need to access partitions 0, 11, 22, 23, then we need to ask: –Disk 0 for partition 0 at time t0 –Disk 1 for partition 11 at time t0 –Disk 2 for partition 22 at time t0 –Disk 3 for partition 23 at time t0 All these requests are issued by the DBMS and are serviced concurrently by the disk array!

ICOM 6005Dr. Manuel Rodriguez Martinez9 Single Disk Time Line t0t1 Elapsed Clock Time Read Request Disk Service Time Read Request Completed

ICOM 6005Dr. Manuel Rodriguez Martinez10 Striping Time Line t0t1 Elapsed Clock Time Read Request Disk Service Time Read Request Completed Parallel I/O

ICOM 6005Dr. Manuel Rodriguez Martinez11 Time access estimates Access time: seek time + rotational delay + transfer time Disk used independently or in array: IBM Deskstar 14GPX 14.4 GB disk –Seek time: 9.1 milliseconds (msecs) –Rotational delay: 4.15 msecs –Tranfer rate: 13MB/sec How does striping compares with a single disk? Scenario: 1disk block(4KB) striping-unit, access to blocks 0, 11, 22, and 23. Disk array has 5 disks –Editorial Note: Looks like an exam problem!

ICOM 6005Dr. Manuel Rodriguez Martinez12 Single Disk Access time Total time = sum of time to read each partition Time for partition 0: 9.1 msec + 4.3msec + 4KB/(1MB/1sec)*(1MB/1024 KB)*(1000msec/1sec) = 9.1 msec + 4.3msec msecs = 17.3 msecs Time for partition 11: 9.1 msec + 4.3msec + 4KB/(1MB/1sec)*(1MB/1024 KB)*(1000msec/1sec) = 9.1 msec + 4.3msec msecs = 17.3 msecs Time for partition 22: 9.1 msec + 4.3msec + 4KB/(1MB/1sec)*(1MB/1024 KB)*(1000msec/1sec) = 9.1 msec + 4.3msec msecs = 17.3 msecs Time for partition 23: 9.1 msec + 4.3msec + 4KB/(1MB/1sec)*(1MB/1024 KB)*(1000msec/1sec) = 9.1 msec + 4.3msec msecs = 17.3 msecs Total time: 4 * 17.3 msec = 69.2 msecs

ICOM 6005Dr. Manuel Rodriguez Martinez13 Stripping Access Time Total time: maximum time to complete any read quest. Following same calculation as in previous slide: –Time for partition 0: 17.3 msec –Time for partition 11: 17.3 msec –Time for partition 22: 17.3 msec –Time for partition 23: 17.3 msec Total time: –max{17.3msec, 17.3msec 17.3msec 17.3msec} = 17.3 msec In this case, stripping gives us a 4-1 better (4 times) performance because of parallel I/O.

ICOM 6005Dr. Manuel Rodriguez Martinez14 The problem with striping Striping has the advantage of speeding up disk access time. But the use of a disk array decrease the reliability of the storage system because more disks mean more possible points of failure. Mean-time-to-failure (MTTF) –Mean time to have the disk fail and lose its data MTTF is inversely proportional to the number of components in used by the system. –The more we have the more likely they will fall apart!

ICOM 6005Dr. Manuel Rodriguez Martinez15 MTTF in disk array Suppose we have a single disk with a MTTF of 50,000 hrs (5.7 years). Then, if we build an array with 50 disks, then the have a MTTF for the array of 50,000/50 = 1000 hrs, or 42 days!, because any disk can fail at any given time with equal probability. –Disk failures are more common when disks are new (bad disk from factory) or old (wear due to usage). Morale of the story: More does not necessarily means better!

ICOM 6005Dr. Manuel Rodriguez Martinez16 Increasing MTTF with redundancy We can increase the MTTF in a disk array by storing some redundant information in the disk array. –This information can be used to recover from a disk failure. This information should be carefully selected so it can be used to reconstruct original data after a failure. What to store as redundant information? –full data block? –Parity bit for a set of bit locations across the disks