Wednesday, April 25, Discs RAID: Introduction Error detection and correction Error detection: Simple parity Error correction: Hamming Codes
|
|
- Randolph McGee
- 5 years ago
- Views:
Transcription
1 Wednesday, April 25, 2018 Topics for today Secondary memory Discs RAID: Introduction Error detection and correction Error detection: Simple parity Error correction: Hamming Codes Storage management (Chapter 9) Discs (see Fig. 9.17) Basic model of a hard disc drive (HDD) is a set of parallel rotating platters on which data can be recorded (usually on both sides apart possible from the topmost or bottommost on the stack). Read/write heads move as a unit into one of a finite number of positions. Consider one of these positions. As the disc rotates, the projection of the read/write head on the recording surface defines a track on which data can be stored. A track is normally divided into sectors and a sector is usually the smallest addressable unit of the disc. An address is thus a three-part object Surface-number, track-number, sector-number The set of tracks (one per surface) having the same radius is called a cylinder (because of its shape) The capacity of a disc is nominally the product Recording_surfaces * tracks-per-surface * sectors-per-track * bytes-per-sector The actual capacity is less than this because some bytes are used for formatting information (e.g., track numbers) and error-correcting and not available for users. To read/write a sector, we need to move the read/write heads to the appropriate track (note that the average movement is N/3 tracks if there are N tracks total) wait for the sector to rotate round (latency time is, on average, half a rotation). Spinning the discs faster, e.g. 15,000 rpm vs 3600 rpm, reduces latency. do the read/write Comp 162 Notes Page 1 of 9 April 25, 2018
2 An Operating System will typically allocate space in clusters of sectors (e.g. an allocation unit might be 4 sectors) to reduce the head movement overheads. It is also likely to allocate data cylinder by cylinder rather than surface by surface. Trends (from Computer Systems by Bryant and O Hallaron) Disk Year $/GB Seek time (ms) Typical Size MB Main memory Effective Cycle time (ns) , , , , , ,500, : m times cheaper 29 times faster 1.5m times larger 10,000 times faster Recent advances (1) Helium filled drives Helium is much less dense than air thus reducing the power needed to spin the platters. The platters can also be placed closer to each other. The advantages of helium have been known for some time, manufacturing is now enabling commercial products. Sealed helium drives work better than conventional drives in location where air is thin, for example mountain-top observatories. (2) Heat-assisted magnetic recording Heat from a laser is used during writing to increase areal density. The density can be increased by a factor of between 10 and 100. Comp 162 Notes Page 2 of 9 April 25, 2018
3 Optical drives Optical drives are typically write-only. Good for applications that require unmodifiable logs or other permanent records. Also good for movie libraries. Solid State Drives (SSD) SSD provide an alternative to conventional hard disc drives. Advantages of SSD Faster start up Shorter access time Relatively constant access time to all data Generally fast transfer rates Disadvantages of SSD Lower capacity but this is changing rapidly High cost per Gb Tendency to fail without warning Need for software to move contents around to even out wear Best of both worlds? Use SSD as a cache memory in front of HDD. Hold copies of frequently accessed data on the SSD. As long as changed data is written back to the HDD, failure of the SSD is not a problem. What about failures of the HDD? The uncorrectable read rate is low, in the region of 1 in 10 14, but it is non-zero. RAID systems try to reduce the effective failure rate even further. Comp 162 Notes Page 3 of 9 April 25, 2018
4 RAID (9.5) Introduction Discs are getting larger. Currently, 3TB and 4TB hard disc drives are commonplace, Samsung announced a 16 TB SSD in August 2015 (PM1633a). However, a large disc can be a single point of failure in a system. A RAID system (Redundant Array of Inexpensive Discs 1 ) is an alternative to a SLED (Single Large Expensive Disc). The idea of RAID is to make an array of discs appear as a single disc to the rest of the system but with improved reliability and/or performance compared with a real single large disc L O G I C RAID systems that are easy for home users are available. See, for example, those made by Drobo (disk robot) ( ) To appreciate how some aspects of RAID work we first need to consider some simple aspects of error detection and correction. Error detection and correction (Warford 9.4) Consider writing information to a device then, later, reading it back. How do we know that what we read is what was written? Writing to a potentially unreliable storage device is the same problem as transmitting over a noisy channel. We need to introduce redundancy into the system in order to be able detect errors and even more redundancy in order to be able to correct errors. 1 Originally, RAID was Redundant Array of Inexpensive Discs. However, inexpensive discs tended to be unreliable so the acronym was changed to Redundant Array of Independent Discs. Some people, looking for more generality, use Redundant Array of Independent Devices. Comp 162 Notes Page 4 of 9 April 25, 2018
5 Definitions The Hamming distance between two code words (bit patterns) of the same length is the number of bit positions at which they differ. For example Codeword Codeword Hamming distance The code distance of a set of codewords is the smallest Hamming distance between any two members of the set. Set of four codewords Code distance { } 2 { } 1 Error Detection: Simple Parity If all bit patterns are legal in a particular context, that is, there is no redundancy, we cannot detect errors. We can introduce redundancy in the form of a simple parity bit for example, so chosen to make the total number of 1 bits even. Thus if the data is we store Only half of the 9-bit patterns have even parity. If an odd number of bits is changed while the item is in storage, we can detect the change when we read it back (the number of 1 bits will be odd) but we cannot correct the error because we do not have enough information to locate it. In order to be able to detect single bit errors, the code distance needs to be > 1. This makes sense, if the distance is 1 then a single bit modification can change one valid codeword into another. For the same reason in order to detect n-bit errors the code distance needs to be > n Comp 162 Notes Page 5 of 9 April 25, 2018
6 Error correction: Hamming codes In order to be able to correct errors we add multiple parity bits to a data object in such a way as to enable single-bit errors to be located (and therefore corrected). Clearly, the code distance needs to be larger. In order to correct an error, the bad codeword needs to be closer to the appropriate correct codeword than to any other correct codeword. To detect and correct single bit errors, the code distance must be greater than 2. We can see why by looking at two codewords with distance=2 If Valid 1 = And Valid 2 = Which code was intended if we receive ? In general, in order to detect and correct d-bit errors, the code distance must be > 2d. So, in order to detect and correct single-bit errors, the code distance must be at least 3. Here is a possible scheme for arranging this. If there are 8 data bits we add 4 parity bits (see Fig. 9.24). Number the 12 bits (conceptually) 1 through 12 and place the parity bits in positions 1, 2, 4 and 8. In simple parity we had one group of bits (1..9) and chose the parity bit to make the total number of 1 s even. In our extended scheme we have 4 groups: Bits 1,3,5,7,9,11 Bits 2,3,6,7,10,11 Bits 4,5,6,7,12 Bits 8,9,10,11,12 Each group has a parity bit, the remaining are data bits. The parity bit is chosen so that the number of bits in each group is even. You can see how the groups are determined by considering the following table showing the binary representations of the numbers 1 through 12. The first group contains those numbers having 1 in the last column, the second group contains those numbers having a 1 in the next-to-last column and so on Comp 162 Notes Page 6 of 9 April 25, 2018
7 Example. Data is Adding parity locations P P 1 P P First group is P so P1 is set to 1 Second group is P so P2 is set to 0 Third group is P so P4 is set to 0 Fourth group is P so P8 is set to 1 So we store If any single bit is changed, a unique combination of parity bits will be affected and we can pinpoint the error. Here is a template showing the 4 groups of bits x x x x x x x x x x x x x x x x x x x x x x Suppose we receive the 12 bits above, with one bit changed: We enter the bits into template Checking the four rows reveals that groups checked by bits 2 and 4 are bad (odd number of 1s) so bit 6 (2 + 4) must be the culprit. If bit 10 had been changed, parity bits P8 and P2 would be wrong because 10 is in those two groups (and only those groups). Because of the way we positioned the parity bits and grouped the data bits we add up the indexes of the failed check bits to get the index of the bad bit which we can then correct. Comp 162 Notes Page 7 of 9 April 25, 2018
8 Next we will look at how these ideas are used in RAID systems. Reading Section 9.1 has a page or two on disc drives. Section 9.4 discusses error detecting and correcting codes. Review Questions 1. If a disc spins at 7200 rpm what is (a) the maximum latency, (b) the minimum latency (c) the average latency? 2. Why might an operating system allocate space cylinder by cylinder rather than surface by surface? 3. Why is the average head movement N/3 tracks and not N/2 tracks? 4. For each of the following sets of strings, determine the Hamming distance. (a) { } (b) { } (c) { } (d) { } (e) { } 5. For each of these 12-bit Hamming codes received, determine if there was an error and, if so, which bit was in error. Even parity is assumed. (a) (b) (c) Comp 162 Notes Page 8 of 9 April 25, 2018
9 Review Answers 1. (a) 1/120 sec (b) 0 sec (c) 1/240 sec. 2. To reduce access times: sectors in a particular cylinder can be accessed without moving the read/write heads 3. Because there are, for example, N-1 ways to move 1 track and only one way to move N-1 tracks. The average is ( (N-1)*1 + (N-2)*2 + 1 * (N-1) ) / (1+2+ N-1) Which approximates to N/3 4. (a) 1 (b) 1 (c) 1 (d) 2 (e) 2 5. (a) Bad bit 7 (b) Good (c) Bad bit 4 Comp 162 Notes Page 9 of 9 April 25, 2018
Monday, May 4, Discs RAID: Introduction Error detection and correction Error detection: Simple parity Error correction: Hamming Codes
Monday, May 4, 2015 Topics for today Secondary memory Discs RAID: Introduction Error detection and correction Error detection: Simple parity Error correction: Hamming Codes Storage management (Chapter
More informationCOMP283-Lecture 3 Applied Database Management
COMP283-Lecture 3 Applied Database Management Introduction DB Design Continued Disk Sizing Disk Types & Controllers DB Capacity 1 COMP283-Lecture 3 DB Storage: Linear Growth Disk space requirements increases
More informationI/O CANNOT BE IGNORED
LECTURE 13 I/O I/O CANNOT BE IGNORED Assume a program requires 100 seconds, 90 seconds for main memory, 10 seconds for I/O. Assume main memory access improves by ~10% per year and I/O remains the same.
More informationBBM371- Data Management. Lecture 2: Storage Devices
BBM371- Data Management Lecture 2: Storage Devices 18.10.2018 Memory Hierarchy cache Main memory disk Optical storage Tapes V NV Traveling the hierarchy: 1. speed ( higher=faster) 2. cost (lower=cheaper)
More informationCSCI-GA Database Systems Lecture 8: Physical Schema: Storage
CSCI-GA.2433-001 Database Systems Lecture 8: Physical Schema: Storage Mohamed Zahran (aka Z) mzahran@cs.nyu.edu http://www.mzahran.com View 1 View 2 View 3 Conceptual Schema Physical Schema 1. Create a
More informationStorage Devices for Database Systems
Storage Devices for Database Systems 5DV120 Database System Principles Umeå University Department of Computing Science Stephen J. Hegner hegner@cs.umu.se http://www.cs.umu.se/~hegner Storage Devices for
More informationMagnetic Disk. Optical. Magnetic Tape. RAID Removable. CD-ROM CD-Recordable (CD-R) CD-R/W DVD
External Memory Magnetic Disk RAID Removable Optical CD-ROM CD-Recordable (CD-R) CD-R/W DVD Magnetic Tape Disk substrate coated with magnetizable material (iron oxide rust) Substrate used to be aluminium
More informationComputer System Architecture
CSC 203 1.5 Computer System Architecture Department of Statistics and Computer Science University of Sri Jayewardenepura Secondary Memory 2 Technologies Magnetic storage Floppy, Zip disk, Hard drives,
More informationA track on a magnetic disk is a concentric rings where data is stored.
CS 320 Ch 6 External Memory Figure 6.1 shows a typical read/ head on a magnetic disk system. Read and heads separate. Read head uses a material that changes resistance in response to a magnetic field.
More informationCOS 318: Operating Systems. Storage Devices. Vivek Pai Computer Science Department Princeton University
COS 318: Operating Systems Storage Devices Vivek Pai Computer Science Department Princeton University http://www.cs.princeton.edu/courses/archive/fall11/cos318/ Today s Topics Magnetic disks Magnetic disk
More informationChapter 12: Mass-Storage
Chapter 12: Mass-Storage Systems Chapter 12: Mass-Storage Systems Revised 2010. Tao Yang Overview of Mass Storage Structure Disk Structure Disk Attachment Disk Scheduling Disk Management Swap-Space Management
More informationWilliam Stallings Computer Organization and Architecture 8 th Edition. Chapter 6 External Memory
William Stallings Computer Organization and Architecture 8 th Edition Chapter 6 External Memory Types of External Memory Magnetic Disk RAID Removable Optical CD-ROM CD-Recordable (CD-R) CD-R/W DVD Magnetic
More informationStorage. CS 3410 Computer System Organization & Programming
Storage CS 3410 Computer System Organization & Programming These slides are the product of many rounds of teaching CS 3410 by Deniz Altinbuke, Kevin Walsh, and Professors Weatherspoon, Bala, Bracy, and
More informationCS 554: Advanced Database System
CS 554: Advanced Database System Notes 02: Hardware Hector Garcia-Molina CS 245 Notes 2 1 Outline Hardware: Disks Access Times (disk) Optimizations (disk access time) Other Topics: Storage costs Using
More informationMass-Storage Structure
CS 4410 Operating Systems Mass-Storage Structure Summer 2011 Cornell University 1 Today How is data saved in the hard disk? Magnetic disk Disk speed parameters Disk Scheduling RAID Structure 2 Secondary
More informationChapter 9: Peripheral Devices: Magnetic Disks
Chapter 9: Peripheral Devices: Magnetic Disks Basic Disk Operation Performance Parameters and History of Improvement Example disks RAID (Redundant Arrays of Inexpensive Disks) Improving Reliability Improving
More informationI/O, Disks, and RAID Yi Shi Fall Xi an Jiaotong University
I/O, Disks, and RAID Yi Shi Fall 2017 Xi an Jiaotong University Goals for Today Disks How does a computer system permanently store data? RAID How to make storage both efficient and reliable? 2 What does
More informationDisks and RAID. CS 4410 Operating Systems. [R. Agarwal, L. Alvisi, A. Bracy, E. Sirer, R. Van Renesse]
Disks and RAID CS 4410 Operating Systems [R. Agarwal, L. Alvisi, A. Bracy, E. Sirer, R. Van Renesse] Storage Devices Magnetic disks Storage that rarely becomes corrupted Large capacity at low cost Block
More informationUNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering. Computer Architecture ECE 568
UNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering Computer Architecture ECE 568 Part 6 Input/Output Israel Koren ECE568/Koren Part.6. Motivation: Why Care About I/O? CPU Performance:
More informationI/O CANNOT BE IGNORED
LECTURE 13 I/O I/O CANNOT BE IGNORED Assume a program requires 100 seconds, 90 seconds for main memory, 10 seconds for I/O. Assume main memory access improves by ~10% per year and I/O remains the same.
More informationComponents of the Virtual Memory System
Components of the Virtual Memory System Arrows indicate what happens on a lw virtual page number (VPN) page offset virtual address TLB physical address PPN page offset page table tag index block offset
More informationStorage System COSC UCB
Storage System COSC4201 1 1999 UCB I/O and Disks Over the years much less attention was paid to I/O compared with CPU design. As frustrating as a CPU crash is, disk crash is a lot worse. Disks are mechanical
More informationProfessor: Pete Keleher! Closures, candidate keys, canonical covers etc! Armstrong axioms!
Professor: Pete Keleher! keleher@cs.umd.edu! } Mechanisms and definitions to work with FDs! Closures, candidate keys, canonical covers etc! Armstrong axioms! } Decompositions! Loss-less decompositions,
More informationCSE 120. Operating Systems. March 27, 2014 Lecture 17. Mass Storage. Instructor: Neil Rhodes. Wednesday, March 26, 14
CSE 120 Operating Systems March 27, 2014 Lecture 17 Mass Storage Instructor: Neil Rhodes Paging and Translation Lookaside Buffer frame dirty? no yes CPU checks TLB PTE in TLB? Free page frame? no yes OS
More informationComputer Science 61C Spring Friedland and Weaver. Input/Output
Input/Output 1 A Computer is Useless without I/O I/O handles persistent storage Disks, SSD memory, etc I/O handles user interfaces Keyboard/mouse/display I/O handles network 2 Basic I/O: Devices are Memory
More informationCOS 318: Operating Systems. Storage Devices. Jaswinder Pal Singh Computer Science Department Princeton University
COS 318: Operating Systems Storage Devices Jaswinder Pal Singh Computer Science Department Princeton University http://www.cs.princeton.edu/courses/archive/fall13/cos318/ Today s Topics Magnetic disks
More informationMass-Storage Structure
Operating Systems (Fall/Winter 2018) Mass-Storage Structure Yajin Zhou (http://yajin.org) Zhejiang University Acknowledgement: some pages are based on the slides from Zhi Wang(fsu). Review On-disk structure
More informationUNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering. Computer Architecture ECE 568
UNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering Computer Architecture ECE 568 Part 6 Input/Output Israel Koren ECE568/Koren Part.6. CPU performance keeps increasing 26 72-core Xeon
More informationCS370 Operating Systems
CS370 Operating Systems Colorado State University Yashwant K Malaiya Fall 2016 Lecture 35 Mass Storage Slides based on Text by Silberschatz, Galvin, Gagne Various sources 1 1 Questions For You Local/Global
More informationCISC 7310X. C11: Mass Storage. Hui Chen Department of Computer & Information Science CUNY Brooklyn College. 4/19/2018 CUNY Brooklyn College
CISC 7310X C11: Mass Storage Hui Chen Department of Computer & Information Science CUNY Brooklyn College 4/19/2018 CUNY Brooklyn College 1 Outline Review of memory hierarchy Mass storage devices Reliability
More informationPrinciples of Data Management. Lecture #2 (Storing Data: Disks and Files)
Principles of Data Management Lecture #2 (Storing Data: Disks and Files) Instructor: Mike Carey mjcarey@ics.uci.edu Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 1 Today s Topics v Today
More informationCOS 318: Operating Systems. Storage Devices. Kai Li Computer Science Department Princeton University
COS 318: Operating Systems Storage Devices Kai Li Computer Science Department Princeton University http://www.cs.princeton.edu/courses/archive/fall11/cos318/ Today s Topics Magnetic disks Magnetic disk
More informationChapter 10: Mass-Storage Systems. Operating System Concepts 9 th Edition
Chapter 10: Mass-Storage Systems Silberschatz, Galvin and Gagne 2013 Chapter 10: Mass-Storage Systems Overview of Mass Storage Structure Disk Structure Disk Attachment Disk Scheduling Disk Management Swap-Space
More informationSemiconductor Memory Types Microprocessor Design & Organisation HCA2102
Semiconductor Memory Types Microprocessor Design & Organisation HCA2102 Internal & External Memory Semiconductor Memory RAM Misnamed as all semiconductor memory is random access Read/Write Volatile Temporary
More informationToday: Secondary Storage! Typical Disk Parameters!
Today: Secondary Storage! To read or write a disk block: Seek: (latency) position head over a track/cylinder. The seek time depends on how fast the hardware moves the arm. Rotational delay: (latency) time
More informationChapter 6. Storage and Other I/O Topics
Chapter 6 Storage and Other I/O Topics Introduction I/O devices can be characterized by Behaviour: input, output, storage Partner: human or machine Data rate: bytes/sec, transfers/sec I/O bus connections
More informationChapter 6 External Memory
Chapter 6 External Memory Magnetic Disk Removable RAID Disk substrate coated with magnetizable material (iron oxide rust) Substrate used to be aluminium Now glass Improved surface uniformity Increases
More informationu Covered: l Management of CPU & concurrency l Management of main memory & virtual memory u Currently --- Management of I/O devices
Where Are We? COS 318: Operating Systems Storage Devices Jaswinder Pal Singh Computer Science Department Princeton University (http://www.cs.princeton.edu/courses/cos318/) u Covered: l Management of CPU
More informationTODAY AND TOMORROW. Storage CHAPTER
1 TODAY AND TOMORROW 3 Storage CHAPTER Storage Systems Characteristics All storage systems have specific characteristics Storage medium (what data is stored on) Can be removable or nonremovable from the
More informationCSE 451: Operating Systems Spring Module 12 Secondary Storage
CSE 451: Operating Systems Spring 2017 Module 12 Secondary Storage John Zahorjan 1 Secondary storage Secondary storage typically: is anything that is outside of primary memory does not permit direct execution
More informationChapter 10: Mass-Storage Systems
COP 4610: Introduction to Operating Systems (Spring 2016) Chapter 10: Mass-Storage Systems Zhi Wang Florida State University Content Overview of Mass Storage Structure Disk Structure Disk Scheduling Disk
More informationDisk Scheduling COMPSCI 386
Disk Scheduling COMPSCI 386 Topics Disk Structure (9.1 9.2) Disk Scheduling (9.4) Allocation Methods (11.4) Free Space Management (11.5) Hard Disk Platter diameter ranges from 1.8 to 3.5 inches. Both sides
More informationExternal Memory. Computer Architecture. Magnetic Disk. Outline. Data Organization and Formatting. Write and Read Mechanisms
Computer Architecture Prof. Dr. Nizamettin AYDIN naydin@yildiz.edu.tr nizamettinaydin@gmail.com External Memory http://www.yildiz.edu.tr/~naydin 1 2 Outline Types of External Memory Magnetic Disk Magnetic
More informationChapter 10: Mass-Storage Systems
Chapter 10: Mass-Storage Systems Silberschatz, Galvin and Gagne 2013 Chapter 10: Mass-Storage Systems Overview of Mass Storage Structure Disk Structure Disk Attachment Disk Scheduling Disk Management Swap-Space
More informationDatabase Systems II. Secondary Storage
Database Systems II Secondary Storage CMPT 454, Simon Fraser University, Fall 2009, Martin Ester 29 The Memory Hierarchy Swapping, Main-memory DBMS s Tertiary Storage: Tape, Network Backup 3,200 MB/s (DDR-SDRAM
More informationWilliam Stallings Computer Organization and Architecture 6 th Edition. Chapter 6 External Memory
William Stallings Computer Organization and Architecture 6 th Edition Chapter 6 External Memory Types of External Memory Magnetic Disk RAID Removable Optical CD-ROM CD-Recordable (CD-R) CD-R/W DVD Magnetic
More informationChapter 12: Mass-Storage
hapter 12: Mass-Storage Systems hapter 12: Mass-Storage Systems Overview of Mass Storage Structure Disk Structure Disk Attachment Disk Scheduling Disk Management RAID Structure Objectives Moving-head Disk
More informationChapter 12: Mass-Storage
hapter 12: Mass-Storage Systems hapter 12: Mass-Storage Systems To explain the performance characteristics of mass-storage devices To evaluate disk scheduling algorithms To discuss operating-system services
More informationStorage Technologies and the Memory Hierarchy
Storage Technologies and the Memory Hierarchy 198:231 Introduction to Computer Organization Lecture 12 Instructor: Nicole Hynes nicole.hynes@rutgers.edu Credits: Slides courtesy of R. Bryant and D. O Hallaron,
More informationLecture 29. Friday, March 23 CS 470 Operating Systems - Lecture 29 1
Lecture 29 Reminder: Homework 7 is due on Monday at class time for Exam 2 review; no late work accepted. Reminder: Exam 2 is on Wednesday. Exam 2 review sheet is posted. Questions? Friday, March 23 CS
More informationCS3600 SYSTEMS AND NETWORKS
CS3600 SYSTEMS AND NETWORKS NORTHEASTERN UNIVERSITY Lecture 9: Mass Storage Structure Prof. Alan Mislove (amislove@ccs.neu.edu) Moving-head Disk Mechanism 2 Overview of Mass Storage Structure Magnetic
More informationV. Mass Storage Systems
TDIU25: Operating Systems V. Mass Storage Systems SGG9: chapter 12 o Mass storage: Hard disks, structure, scheduling, RAID Copyright Notice: The lecture notes are mainly based on modifications of the slides
More informationThe personal computer system uses the following hardware device types -
EIT, Author Gay Robertson, 2016 The personal computer system uses the following hardware device types - Input devices Input devices Processing devices Storage devices Processing Cycle Processing devices
More informationStorage Technologies - 3
Storage Technologies - 3 COMP 25212 - Lecture 10 Antoniu Pop antoniu.pop@manchester.ac.uk 1 March 2019 Antoniu Pop Storage Technologies - 3 1 / 20 Learning Objectives - Storage 3 Understand characteristics
More informationCS 261 Fall Mike Lam, Professor. Memory
CS 261 Fall 2016 Mike Lam, Professor Memory Topics Memory hierarchy overview Storage technologies SRAM DRAM PROM / flash Disk storage Tape and network storage I/O architecture Storage trends Latency comparisons
More informationSTORAGE SYSTEMS. Operating Systems 2015 Spring by Euiseong Seo
STORAGE SYSTEMS Operating Systems 2015 Spring by Euiseong Seo Today s Topics HDDs (Hard Disk Drives) Disk scheduling policies Linux I/O schedulers Secondary Storage Anything that is outside of primary
More informationCS429: Computer Organization and Architecture
CS429: Computer Organization and Architecture Dr. Bill Young Department of Computer Sciences University of Texas at Austin Last updated: April 9, 2018 at 12:16 CS429 Slideset 17: 1 Random-Access Memory
More informationVirtual Memory. Reading. Sections 5.4, 5.5, 5.6, 5.8, 5.10 (2) Lecture notes from MKP and S. Yalamanchili
Virtual Memory Lecture notes from MKP and S. Yalamanchili Sections 5.4, 5.5, 5.6, 5.8, 5.10 Reading (2) 1 The Memory Hierarchy ALU registers Cache Memory Memory Memory Managed by the compiler Memory Managed
More informationHomework, etc. Computer Science Foundations
Homework, etc. 0 Chapter 12: reading, exercises Due: 10/4 NOTE: EARLIER THAN USUAL! Will be covered in depth on test (change from Monday s announcement) Prelim I: 10/6 Copyright c 2002 2017 UMaine School
More informationChapter 6 - External Memory
Chapter 6 - External Memory Luis Tarrataca luis.tarrataca@gmail.com CEFET-RJ L. Tarrataca Chapter 6 - External Memory 1 / 66 Table of Contents I 1 Motivation 2 Magnetic Disks Write Mechanism Read Mechanism
More informationStorage. How does volatility compare? What is a storage device and a storage medium? Today s standard disk is 3.5 wide
1 Chapter 7 Storage 2 Chapter 7 Objectives 3 Memory Versus Storage 1 What is storage? 2 Media and devices used to store and retrieve data, instructions,and information 4 Memory Versus Storage 1 How does
More informationUNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering. Computer Architecture ECE 568
UNIVERSITY OF MASSACHUSETTS Dept of Electrical & Computer Engineering Computer Architecture ECE 568 art 5 Input/Output Israel Koren ECE568/Koren art5 CU performance keeps increasing 26 72-core Xeon hi
More informationCHAPTER 12: MASS-STORAGE SYSTEMS (A) By I-Chen Lin Textbook: Operating System Concepts 9th Ed.
CHAPTER 12: MASS-STORAGE SYSTEMS (A) By I-Chen Lin Textbook: Operating System Concepts 9th Ed. Chapter 12: Mass-Storage Systems Overview of Mass-Storage Structure Disk Structure Disk Attachment Disk Scheduling
More informationIST346. Data Storage
IST346 Data Storage Data Storage Why Data Storage? Information is a the center of all organizations. Organizations need to store data. Lots of it. What Kinds of Data? Documents and Files (Reports, Proposals,
More informationEXTERNAL MEMORY (Part 1)
Eastern Mediterranean University School of Computing and Technology ITEC255 Computer Organization & Architecture EXTERNAL MEMORY (Part 1) Introduction When external memory is discussed, one should consider
More informationDatabase Architecture 2 & Storage. Instructor: Matei Zaharia cs245.stanford.edu
Database Architecture 2 & Storage Instructor: Matei Zaharia cs245.stanford.edu Summary from Last Time System R mostly matched the architecture of a modern RDBMS» SQL» Many storage & access methods» Cost-based
More informationDisks, Memories & Buffer Management
Disks, Memories & Buffer Management The two offices of memory are collection and distribution. - Samuel Johnson CS3223 - Storage 1 What does a DBMS Store? Relations Actual data Indexes Data structures
More informationCS429: Computer Organization and Architecture
CS429: Computer Organization and Architecture Dr. Bill Young Department of Computer Sciences University of Texas at Austin Last updated: November 28, 2017 at 14:31 CS429 Slideset 18: 1 Random-Access Memory
More informationStorage Systems. Storage Systems
Storage Systems Storage Systems We already know about four levels of storage: Registers Cache Memory Disk But we've been a little vague on how these devices are interconnected In this unit, we study Input/output
More informationMass-Storage. ICS332 - Fall 2017 Operating Systems. Henri Casanova
Mass-Storage ICS332 - Fall 2017 Operating Systems Henri Casanova (henric@hawaii.edu) Magnetic Disks! Magnetic disks (a.k.a. hard drives ) are (still) the most common secondary storage devices today! They
More informationTopics. Lecture 8: Magnetic Disks
Lecture 8: Magnetic Disks SONGS ABOUT COMPUTER SCIENCE Topics Basic terms and operation Some history and trends Performance Disk arrays (RAIDs) SAVE THE CODE Written by Mikolaj Franaszczuk To the tune
More informationCS 471 Operating Systems. Yue Cheng. George Mason University Fall 2017
CS 471 Operating Systems Yue Cheng George Mason University Fall 2017 Review: Memory Accesses 2 Impact of Program Structure on Memory Performance o Consider an array named data with 128*128 elements o Each
More informationCSE 153 Design of Operating Systems
CSE 153 Design of Operating Systems Winter 2018 Lecture 20: File Systems (1) Disk drives OS Abstractions Applications Process File system Virtual memory Operating System CPU Hardware Disk RAM CSE 153 Lecture
More informationAdapted from instructor s supplementary material from Computer. Patterson & Hennessy, 2008, MK]
Lecture 17 Adapted from instructor s supplementary material from Computer Organization and Design, 4th Edition, Patterson & Hennessy, 2008, MK] SRAM / / Flash / RRAM / HDD SRAM / / Flash / RRAM/ HDD SRAM
More informationCS143: Disks and Files
CS143: Disks and Files 1 System Architecture CPU Word (1B 64B) ~ x GB/sec Main Memory System Bus Disk Controller... Block (512B 50KB) ~ x MB/sec Disk 2 Magnetic disk vs SSD Magnetic Disk Stores data on
More informationChapter 11. I/O Management and Disk Scheduling
Operating System Chapter 11. I/O Management and Disk Scheduling Lynn Choi School of Electrical Engineering Categories of I/O Devices I/O devices can be grouped into 3 categories Human readable devices
More informationWhither Hard Disk Archives? Dave Anderson Seagate Technology 6/2016
Whither Hard Disk Archives? Dave Anderson Seagate Technology 6/2016 Topics as They Relate to Large Storage Archives Where Topology might go Basic HDD Topologies advantages & disadvantages Hyper converged
More informationCS152 Computer Architecture and Engineering Lecture 19: I/O Systems
CS152 Computer Architecture and Engineering Lecture 19: I/O Systems April 5, 1995 Dave Patterson (patterson@cs) and Shing Kong (shing.kong@eng.sun.com) Slides available on http://http.cs.berkeley.edu/~patterson
More informationCSCI-GA Operating Systems. I/O : Disk Scheduling and RAID. Hubertus Franke
CSCI-GA.2250-001 Operating Systems I/O : Disk Scheduling and RAID Hubertus Franke frankeh@cs.nyu.edu Disks Scheduling Abstracted by OS as files A Conventional Hard Disk (Magnetic) Structure Hard Disk
More informationRandom-Access Memory (RAM) CS429: Computer Organization and Architecture. SRAM and DRAM. Flash / RAM Summary. Storage Technologies
Random-ccess Memory (RM) CS429: Computer Organization and rchitecture Dr. Bill Young Department of Computer Science University of Texas at ustin Key Features RM is packaged as a chip The basic storage
More information16/06/56. Secondary Storage. Secondary Storage. Secondary Storage The McGraw-Hill Companies, Inc. All rights reserved.
Distinguish between primary and secondary storage. Discuss the important characteristics of secondary storage, including media, capacity, storage devices, and access speed. Describe hard disk platters,
More informationContents. Memory System Overview Cache Memory. Internal Memory. Virtual Memory. Memory Hierarchy. Registers In CPU Internal or Main memory
Memory Hierarchy Contents Memory System Overview Cache Memory Internal Memory External Memory Virtual Memory Memory Hierarchy Registers In CPU Internal or Main memory Cache RAM External memory Backing
More informationChapter 13 Disk Storage, Basic File Structures, and Hashing.
Chapter 13 Disk Storage, Basic File Structures, and Hashing. Copyright 2004 Pearson Education, Inc. Chapter Outline Disk Storage Devices Files of Records Operations on Files Unordered Files Ordered Files
More informationModule 1: Basics and Background Lecture 4: Memory and Disk Accesses. The Lecture Contains: Memory organisation. Memory hierarchy. Disks.
The Lecture Contains: Memory organisation Example of memory hierarchy Memory hierarchy Disks Disk access Disk capacity Disk access time Typical disk parameters Access times file:///c /Documents%20and%20Settings/iitkrana1/My%20Documents/Google%20Talk%20Received%20Files/ist_data/lecture4/4_1.htm[6/14/2012
More informationChapter 10: Mass-Storage Systems. Operating System Concepts 9 th Edition
Chapter 10: Mass-Storage Systems Silberschatz, Galvin and Gagne 2013 Objectives To describe the physical structure of secondary storage devices and its effects on the uses of the devices To explain the
More informationCSE 451: Operating Systems Spring Module 12 Secondary Storage. Steve Gribble
CSE 451: Operating Systems Spring 2009 Module 12 Secondary Storage Steve Gribble Secondary storage Secondary storage typically: is anything that is outside of primary memory does not permit direct execution
More informationOverview. EE 4504 Computer Organization. Historically, the limiting factor in a computer s performance has been memory access time
Overview EE 4504 Computer Organization Section 3 Computer Memory Historically, the limiting factor in a computer s performance has been memory access time Memory speed has been slow compared to the speed
More informationDepartment of Computer Engineering University of California at Santa Cruz. File Systems. Hai Tao
File Systems Hai Tao File System File system is used to store sources, objects, libraries and executables, numeric data, text, video, audio, etc. The file system provide access and control function for
More informationAdministrivia. CMSC 411 Computer Systems Architecture Lecture 19 Storage Systems, cont. Disks (cont.) Disks - review
Administrivia CMSC 411 Computer Systems Architecture Lecture 19 Storage Systems, cont. Homework #4 due Thursday answers posted soon after Exam #2 on Thursday, April 24 on memory hierarchy (Unit 4) and
More informationCS 201 The Memory Hierarchy. Gerson Robboy Portland State University
CS 201 The Memory Hierarchy Gerson Robboy Portland State University memory hierarchy overview (traditional) CPU registers main memory (RAM) secondary memory (DISK) why? what is different between these
More informationCS61C - Machine Structures. Week 7 - Disks. October 10, 2003 John Wawrzynek
CS61C - Machine Structures Week 7 - Disks October 10, 2003 John Wawrzynek http://www-inst.eecs.berkeley.edu/~cs61c/ CS61C wk 7 Disks UC Regents 1 Magnetic Disk common I/O device Computer Processor (active)
More informationCPS104 Computer Organization and Programming Lecture 18: Input-Output. Outline of Today s Lecture. The Big Picture: Where are We Now?
CPS104 Computer Organization and Programming Lecture 18: Input-Output Robert Wagner cps 104.1 RW Fall 2000 Outline of Today s Lecture The system Magnetic Disk Tape es DMA cps 104.2 RW Fall 2000 The Big
More informationIntroduction to I/O. April 30, Howard Huang 1
Introduction to I/O Where does the data for our CPU and memory come from or go to? Computers communicate with the outside world via I/O devices. Input devices supply computers with data to operate on.
More informationCPSC 421 Database Management Systems. Lecture 11: Storage and File Organization
CPSC 421 Database Management Systems Lecture 11: Storage and File Organization * Some material adapted from R. Ramakrishnan, L. Delcambre, and B. Ludaescher Today s Agenda Start on Database Internals:
More informationStoring Data: Disks and Files
Storing Data: Disks and Files Yea, from the table of my memory I ll wipe away all trivial fond records. -- Shakespeare, Hamlet Data Access Disks and Files DBMS stores information on ( hard ) disks. This
More informationFile. File System Implementation. File Metadata. File System Implementation. Direct Memory Access Cont. Hardware background: Direct Memory Access
File File System Implementation Operating Systems Hebrew University Spring 2009 Sequence of bytes, with no structure as far as the operating system is concerned. The only operations are to read and write
More informationStorage Systems : Disks and SSDs. Manu Awasthi CASS 2018
Storage Systems : Disks and SSDs Manu Awasthi CASS 2018 Why study storage? Scalable High Performance Main Memory System Using Phase-Change Memory Technology, Qureshi et al, ISCA 2009 Trends Total amount
More informationConcepts Introduced. I/O Cannot Be Ignored. Typical Collection of I/O Devices. I/O Issues
Concepts Introduced I/O Cannot Be Ignored Assume a program requires 100 seconds, 90 seconds for accessing main memory and 10 seconds for I/O. I/O introduction magnetic disks ash memory communication with
More informationComputer Architecture 计算机体系结构. Lecture 6. Data Storage and I/O 第六讲 数据存储和输入输出. Chao Li, PhD. 李超博士
Computer Architecture 计算机体系结构 Lecture 6. Data Storage and I/O 第六讲 数据存储和输入输出 Chao Li, PhD. 李超博士 SJTU-SE346, Spring 2018 Review Memory hierarchy Cache and virtual memory Locality principle Miss cache, victim
More informationPage 1. Magnetic Disk Purpose Long term, nonvolatile storage Lowest level in the memory hierarchy. Typical Disk Access Time
Review: Major Components of a Computer Processor Control Datapath Cache Memory Main Memory Secondary Memory (Disk) Devices Output Input Magnetic Disk Purpose Long term, nonvolatile storage Lowest level
More information