Successfully reported this slideshow.

PowerPoint slides

537 views

Published on

  • Be the first to comment

  • Be the first to like this

PowerPoint slides

  1. 2. Chapter Goals <ul><li>Describe the distinguishing characteristics of primary and secondary storage </li></ul><ul><li>Describe the devices used to implement primary storage </li></ul><ul><li>Describe memory allocation schemes </li></ul><ul><li>Compare and contrast secondary storage technology alternatives </li></ul>Systems Architecture, Fifth Edition
  2. 3. Chapter Goals (continued) <ul><li>Describe factors that determine storage device performance </li></ul><ul><li>Choose appropriate secondary storage technologies and devices </li></ul>Systems Architecture, Fifth Edition
  3. 4. Systems Architecture, Fifth Edition
  4. 5. Systems Architecture, Fifth Edition
  5. 6. Characteristics of Storage Devices <ul><li>Speed </li></ul><ul><li>Volatility </li></ul><ul><li>Access method </li></ul><ul><li>Portability </li></ul><ul><li>Cost and capacity </li></ul><ul><li>Let’s examine each of these... </li></ul>Systems Architecture, Fifth Edition
  6. 7. Speed <ul><li>Primary storage speed </li></ul><ul><ul><li>Typically faster than secondary storage speed by a factor of 105 or more </li></ul></ul><ul><ul><li>Expressed in nanoseconds (billionths of a second) </li></ul></ul><ul><li>Secondary storage speed </li></ul><ul><ul><li>Expressed in milliseconds (thousandths of a second) </li></ul></ul><ul><li>Data transfer rate = 1 second/access time (in seconds) x unit of data transfer (in bytes) (simplified) </li></ul>Systems Architecture, Fifth Edition
  7. 8. Volatility <ul><li>Primary storage devices are generally volatile </li></ul><ul><ul><li>Cannot reliably hold data for long periods </li></ul></ul><ul><li>Secondary storage devices are generally nonvolatile </li></ul><ul><ul><li>Hold data without loss over long periods of time </li></ul></ul>Systems Architecture, Fifth Edition
  8. 9. Access Method <ul><li>Serial access (linear, such as a tape) </li></ul><ul><li>Random access (direct access, such as RAM) </li></ul><ul><li>Parallel access (simultaneous access, such as RAID) </li></ul>Systems Architecture, Fifth Edition
  9. 10. Portability <ul><li>Removable storage media with standardized formats (e.g., compact disc and tape storage) </li></ul><ul><li>Typically results in slower access speeds </li></ul>Systems Architecture, Fifth Edition
  10. 11. Cost and Capacity <ul><li>Cost increases: </li></ul><ul><ul><li>With improved speed, volatility, or portability </li></ul></ul><ul><ul><li>As access method moves from serial to random to parallel access method </li></ul></ul><ul><li>Primary storage - expensive (high speed and combination of parallel/random access methods) </li></ul><ul><li>Capacity of secondary storage devices is greater than primary storage devices </li></ul>Systems Architecture, Fifth Edition
  11. 12. Systems Architecture, Fifth Edition
  12. 13. Memory-Storage Hierarchy Systems Architecture, Fifth Edition
  13. 14. Primary Storage Devices <ul><li>Critical performance characteristics </li></ul><ul><ul><li>Access speed </li></ul></ul><ul><ul><li>Data transfer unit size </li></ul></ul><ul><li>Must closely match CPU speed and word size to avoid wait states </li></ul>Systems Architecture, Fifth Edition
  14. 15. Storing Electrical Signals <ul><li>Directly </li></ul><ul><ul><li>By devices such as batteries and capacitors </li></ul></ul><ul><ul><li>Trade off between access speed and volatility </li></ul></ul><ul><li>Indirectly </li></ul><ul><ul><li>Uses energy to alter the state of a device; inverse process regenerates equivalent electrical signal </li></ul></ul><ul><li>Modern computers use memory implemented with semiconductors (RAM and NVM) </li></ul>Systems Architecture, Fifth Edition nonvolatile memory
  15. 16. Random Access Memory <ul><li>Characteristics </li></ul><ul><ul><li>Microchip implementation using semiconductors </li></ul></ul><ul><ul><li>Ability to read and write with equal speed </li></ul></ul><ul><ul><li>Random access to stored bytes, words, or larger data units </li></ul></ul><ul><li>Basic types </li></ul><ul><ul><li>Static RAM (SRAM) – faster than DRAM; uses 6 transistors/bit; does not need refreshing; faster than DRAM </li></ul></ul><ul><ul><li>Dynamic RAM (DRAM) – uses 1 transistor and 1 capacitor / bit; cheaper than SRAM; needs refreshing; higher density; needs more power requirements </li></ul></ul>Systems Architecture, Fifth Edition
  16. 17. Random Access Memory <ul><li>To bridge performance gap between memory and microprocessors </li></ul><ul><ul><li>Read-ahead memory access </li></ul></ul><ul><ul><li>Synchronous read operations </li></ul></ul><ul><ul><li>On-chip memory caches </li></ul></ul>Systems Architecture, Fifth Edition
  17. 18. Nonvolatile Memory <ul><li>Random access memory with long-term or permanent data retention </li></ul><ul><li>Usually relegated to specialized roles and secondary storage; slower write speeds and limited number of rewrites </li></ul><ul><li>Generations of devices (ROM, EPROM, and EEPROM) </li></ul>Systems Architecture, Fifth Edition
  18. 19. Nonvolatile Memory <ul><li>Flash RAM (most common NVM) </li></ul><ul><ul><li>Competitive with DRAM in capacity and read performance </li></ul></ul><ul><ul><li>Relatively slow write speed </li></ul></ul><ul><ul><li>Limited number of write cycles (more on this later) </li></ul></ul><ul><li>NVM technologies under development </li></ul><ul><ul><li>Ferroelectric RAM </li></ul></ul><ul><ul><li>Polymer memory </li></ul></ul>Systems Architecture, Fifth Edition
  19. 20. Memory Packaging <ul><li>Dual in-line packages (DIPs) </li></ul><ul><ul><li>Early RAM and ROM circuits </li></ul></ul><ul><li>Single in-line memory module (SIMM) </li></ul><ul><ul><li>Standard RAM package in late 1980s </li></ul></ul><ul><li>Double in-line memory module (DIMM) </li></ul><ul><ul><li>Newer packaging standard </li></ul></ul><ul><ul><li>A SIMM with independent electrical contacts on both sides of the module </li></ul></ul>Systems Architecture, Fifth Edition
  20. 21. Systems Architecture, Fifth Edition
  21. 22. CPU Memory Access <ul><li>Critical design issues for primary storage devices and processors </li></ul><ul><ul><li>Physical organization of memory </li></ul></ul><ul><ul><li>Organization of programs and data within memory </li></ul></ul><ul><ul><li>Method(s) of referencing specific memory locations </li></ul></ul>Systems Architecture, Fifth Edition
  22. 23. Physical Memory Organization <ul><li>Physical memory </li></ul><ul><ul><li>Actual number of memory bytes that physically are installed in the machine </li></ul></ul><ul><li>Most and least significant bytes </li></ul><ul><li>Big endian (stores most significant byte/bit at lowest memory address) and little endian </li></ul><ul><li>Addressable memory </li></ul><ul><ul><li>Highest numbered storage byte that can be represented </li></ul></ul>Systems Architecture, Fifth Edition
  23. 24. Systems Architecture, Fifth Edition
  24. 25. Systems Architecture, Fifth Edition
  25. 26. Memory Access Time <ul><li>Memory rated at PCxxxx delivers peak bandwidth of xxxxMB/sec. </li></ul><ul><li>For example, PC3200 memory delivers 3.2GB/sec peak bandwidth. </li></ul><ul><li>Typically, there is a significant delay before you can get back the first byte (say 6 cycles) </li></ul><ul><li>Random accesses would deliver around 500KB/sec. </li></ul>Systems Architecture, Fifth Edition
  26. 27. Memory compared to CPU <ul><li>How much data can a CPU pump around? </li></ul><ul><li>2GHz = 2,000,000 cycles per second </li></ul><ul><li>Each cycle, the CPU can move around a word (4 bytes on a 32-bit machine) </li></ul><ul><li>so 8GB/sec </li></ul>Systems Architecture, Fifth Edition
  27. 28. Magnetic Storage <ul><li>Exploits duality of magnetism and electricity </li></ul><ul><ul><li>Converts electrical signals into magnetic charges </li></ul></ul><ul><ul><li>Captures magnetic charge on a storage medium </li></ul></ul><ul><ul><li>Later regenerates electrical current from stored magnetic charge </li></ul></ul><ul><li>Polarity of magnetic charge represents bit values zero and one </li></ul>Systems Architecture, Fifth Edition
  28. 29. Systems Architecture, Fifth Edition
  29. 30. Systems Architecture, Fifth Edition
  30. 31. Systems Architecture, Fifth Edition
  31. 32. Magnetic Tape <ul><li>Ribbon of plastic with a coercible (usually metallic oxide) surface coating </li></ul><ul><li>Mounts in a tape drive for reading and writing </li></ul><ul><li>Relatively slow serial access </li></ul><ul><li>Compounds magnetic leakage; wraps upon itself </li></ul><ul><li>Susceptible to stretching, friction, temperature variations </li></ul>Systems Architecture, Fifth Edition
  32. 33. Systems Architecture, Fifth Edition
  33. 34. Magnetic Tape <ul><li>Two approaches to recording data </li></ul><ul><ul><li>Linear recording </li></ul></ul><ul><ul><li>Helical scanning </li></ul></ul><ul><li>Several formats and standards (e.g., DDS [DAT], AIT, Mammoth, DLT (digital linear tape), LTO (linear tape-open)) </li></ul><ul><li>Highest capacity tapes hold about 1 TB (same as largest disk drives) </li></ul><ul><li>But much cheaper per byte </li></ul>Systems Architecture, Fifth Edition
  34. 35. Systems Architecture, Fifth Edition
  35. 36. Modern Tape Formats and Capacities (uncompressed) <ul><li>DDS (DAT), from Sony and HP: 2-36 GB </li></ul><ul><li>AIT, from Sony: 35-400 GB </li></ul><ul><li>Mammoth, from Exabyte: 20-80 GB </li></ul><ul><li>DLT, from Quantum: 20-600 GB </li></ul><ul><li>LTO, from HP, IBM, Seagate: 100-800 GB </li></ul>Systems Architecture, Fifth Edition
  36. 37. Magnetic Disk <ul><li>Flat, circular platter with metallic coating that is rotated beneath read/write heads </li></ul><ul><li>Random access device; read/write head can be moved to any location on the platter </li></ul><ul><li>Hard disks and floppy disks </li></ul><ul><li>Cost performance leader for general-purpose on-line secondary storage </li></ul>Systems Architecture, Fifth Edition
  37. 38. Systems Architecture, Fifth Edition
  38. 39. Systems Architecture, Fifth Edition
  39. 40. Magnetic Disk Access Time <ul><li>Head-to-head switching time </li></ul><ul><li>Track-to-track seek time </li></ul><ul><li>Rotational delay </li></ul><ul><li>Most important performance numbers </li></ul><ul><ul><li>Average access time </li></ul></ul><ul><ul><li>Sequential access time </li></ul></ul><ul><ul><li>Sustained data transfer rate </li></ul></ul>Systems Architecture, Fifth Edition
  40. 41. Average Access Time <ul><li>Head switching time (negligible) </li></ul><ul><li>Plus head seek time (given in ms) </li></ul><ul><li>Plus rotational delay (on average, ½ a turn) If disk spins at 6000RPM, what is the rotational delay? </li></ul><ul><ul><li>One turn takes 1/6000 min or 1/100 sec = 10ms </li></ul></ul><ul><ul><li>½ turn takes 5ms. </li></ul></ul>Systems Architecture, Fifth Edition
  41. 42. Average Access Time <ul><li>Plus read time (time to spin an entire sector) </li></ul><ul><ul><li>If the drive spins at 6000RPM and the disk has 20 sectors per track, what is the read time? </li></ul></ul><ul><ul><li>Time for 1 full spin is </li></ul></ul><ul><ul><li>Time for 1/20 of a spin is </li></ul></ul>Systems Architecture, Fifth Edition
  42. 43. Let’s Try Another Problem <ul><li>Drive spins at 7200RPM and has average seek time of 8ms. The disk has 24 sectors per track. What is the average access time? </li></ul><ul><li>Head seek time = 0.008 sec (given) </li></ul><ul><li>Rotational delay (1/2 spin) = 7200 RPM (1/2) = </li></ul><ul><li>120 RPS(1/2) = 1/120 sec/rev(1/2) = 0.0042 sec </li></ul><ul><li>Read time (1 sector) = 0.0084 (full spin) / 24 sectors per track = 0.00035 sec </li></ul><ul><li>Total = 0.008 + 0.0042 + 0.00035 = 0.01255 sec or 12.55 ms </li></ul><ul><li>This is the average access time </li></ul>Systems Architecture, Fifth Edition
  43. 44. Sequential Access Time <ul><li>The best possible read time is if the head is in exactly the right place (like when we read consecutive sectors) </li></ul><ul><li>Sequential access time is the amount of time for one sector to spin under the head </li></ul><ul><li>Drive spins at 7200RPM and has average seek time of 8ms. The disk has 24 sectors per track. What is the sequential access time? </li></ul>Systems Architecture, Fifth Edition
  44. 45. Sequential Access Time <ul><li>Drive spins at 7200RPM and has average seek time of 8ms. The disk has 24 sectors per track. What is the sequential access time? </li></ul><ul><li>Read time (1 sector) = 0.0084 (full spin) / 24 sectors per track = 0.00035 sec </li></ul><ul><li>(no need to include head seek time and rotational delay) </li></ul>Systems Architecture, Fifth Edition
  45. 46. Data Transfer Rate <ul><li>The data transfer rate is the number of access that can be made per second times the amount of data per transfer. </li></ul><ul><li>The size of a transfer is the size of a sector, typically 512 bytes. </li></ul>Systems Architecture, Fifth Edition
  46. 47. Maximum Data Transfer Rate <ul><li>Maximum data transfer rate is computed using the best possible access time (sequential access time). </li></ul><ul><li>In the prior example, sequential access time was 0.35ms = 0.00035 seconds </li></ul><ul><li>Accesses per second is </li></ul><ul><li>Transfer rate is </li></ul>Systems Architecture, Fifth Edition
  47. 48. Sustained Data Transfer Rate <ul><li>Sustained data transfer rate is computed using the average access time (sectors may not be contiguous) . </li></ul><ul><li>In the prior example, average access time was 12.55ms = 0.01255 seconds </li></ul><ul><li>Accesses per second is </li></ul><ul><li>Transfer rate is </li></ul>Systems Architecture, Fifth Edition
  48. 49. Systems Architecture, Fifth Edition
  49. 50. Systems Architecture, Fifth Edition To increase capacity per platter, disk manufacturers divide tracks into zones and vary the sectors per track in each zone.
  50. 51. Optical Mass Storage Devices <ul><li>Store bit values as variations in light reflection </li></ul><ul><li>Higher areal density and longer data life than magnetic storage </li></ul><ul><li>Standardized and relatively inexpensive </li></ul><ul><li>Uses: read-only storage with low performance requirements, applications with high capacity requirements, and where portability in a standardized format is needed </li></ul>Systems Architecture, Fifth Edition
  51. 52. Systems Architecture, Fifth Edition Optical storage devices read data by shining laser beam on the disc.
  52. 53. Systems Architecture, Fifth Edition
  53. 54. CD-ROM <ul><li>Read-only; data permanently embedded in durable polycarbonate disc </li></ul><ul><li>Bit values represented as flat areas (lands) and concave dents (pits) in the reflective layer </li></ul><ul><li>Data recorded in single continuous track that spirals outward from center of disc </li></ul><ul><li>Popular medium for distributing software and large data sets </li></ul>Systems Architecture, Fifth Edition Variable data transfer rate
  54. 55. CD-ROM Systems Architecture, Fifth Edition Advantages Drawbacks <ul><li>Standardized format </li></ul><ul><li>High density </li></ul><ul><li>Cheap to manufacture </li></ul><ul><li>Cannot be rewritten </li></ul><ul><li>Capacity limited to 700 MB </li></ul>
  55. 56. CD-R <ul><li>Uses a laser that can be switched between high and low power and a laser-sensitive dye embedded in the disc </li></ul><ul><li>Relatively cheap </li></ul><ul><li>Common uses: create music CDs on home computers, back up data from other storage devices, create archives of large data sets, and manufacture small quantities of identical CDs </li></ul>Systems Architecture, Fifth Edition
  56. 57. Phase-Change Optical Discs <ul><li>Enables nondestructive writing to optical storage media </li></ul><ul><li>Materials change state easily from non-crystalline (amorphous), to crystalline, and then back again </li></ul><ul><ul><li>Reflective layer is a compound of tellurium, selenium, and tin </li></ul></ul><ul><li>Example: CD-RW </li></ul>Systems Architecture, Fifth Edition
  57. 58. DVD <ul><li>Improves on CD and CD-RW technology </li></ul><ul><ul><li>Increased track and bit density: smaller wavelength lasers and more precise mechanical control </li></ul></ul><ul><ul><li>Improved error correction </li></ul></ul><ul><ul><li>Multiple recording sites and layers </li></ul></ul>Systems Architecture, Fifth Edition
  58. 59. Flash Drives <ul><li>AKA USB flash drives, or UFD </li></ul><ul><li>NAND-type flash memory integrated with a USB connector </li></ul><ul><li>Replacing floppy disk/diskette </li></ul><ul><li>Lightweight and compact, minimal model contains a printed circuit board with storage controller device, flash memory chip, crystal oscillator, and LED </li></ul>Systems Architecture, Fifth Edition
  59. 60. Flash Drive Internals Systems Architecture, Fifth Edition From Wikipedia
  60. 61. Flash Drive Technology <ul><li>Based on earlier EPROM technology (UV-erasable) </li></ul><ul><li>EEPROMs (electrically erasable) replaced EPROMs </li></ul><ul><li>To update contents, an entire “region” of memory has to be moved off the flash drive, updated, the flash drive contents are erased, and the data moved back to the flash drive </li></ul>Systems Architecture, Fifth Edition
  61. 62. Common Uses <ul><li>Very popular with network administrators as they load them with configuration information as well as software used for maintenance and recovery </li></ul><ul><li>Operating system boots </li></ul><ul><li>Application carriers </li></ul><ul><li>MP3 music players </li></ul><ul><li>Windows Vista ReadyBoot </li></ul><ul><li>And of course file backup </li></ul>Systems Architecture, Fifth Edition
  62. 63. Major Weaknesses <ul><li>Limited number of erase and write cycles </li></ul><ul><li>Average device should support several hundred thousand cycles, but write operations will slow with age of device </li></ul><ul><li>Not as fast as fixed disk drives </li></ul>Systems Architecture, Fifth Edition
  63. 64. RAID <ul><li>Redundant Array of Independent Drives, is a collection of techniques to interface multiple hard disk drives to a computer </li></ul><ul><li>Mostly, they are a collection of techniques to store data redundantly on multiple hard disk drives </li></ul><ul><li>Only the first RAID technique, RAID 0, does not store the data redundantly </li></ul>Systems Architecture, Fifth Edition
  64. 65. More Common RAID Techniques – RAID 0 <ul><li>RAID 0, in which the data is broken into pieces and each piece is stored on different disk drives. There is no redundancy of data in this technique, so if one disk drive fails, some of the data is lost. The advantage of this technique is the speed in which data can be read or written across multiple disks at the same time. </li></ul><ul><li>aka striped </li></ul>Systems Architecture, Fifth Edition
  65. 66. Systems Architecture, Fifth Edition RAID 0 From Wikipedia
  66. 67. RAID 0 <ul><li>When two drives are used and they are of different sizes, use the smaller size and double </li></ul><ul><li>For example, one drive is 300 GB and the other is 200 GB, then you have a total of 400 GB of storage </li></ul><ul><li>RAID 0 useful in large, NSF servers (mounting issues) and in Microsoft OS where you might run out of letter designations for drives </li></ul>Systems Architecture, Fifth Edition
  67. 68. RAID 1 <ul><li>RAID 1, in which the data is stored on at least two disk drives in duplicate so as to provide a level of redundancy (fault tolerance) should one disk become corrupted </li></ul><ul><li>This technique is also known as disk mirroring, or mirrored </li></ul>Systems Architecture, Fifth Edition
  68. 69. Systems Architecture, Fifth Edition RAID 1 From Wikipedia
  69. 70. RAID 4 <ul><li>RAID 4, in which the data is striped across multiple disk drives (based on blocks) and error checking information (parity checks) concerning the stored data is kept along with the data (but on a separate disk). </li></ul><ul><li>This error checking information can be used to detect errors and possibly reconstruct the data should some of it become corrupted. </li></ul>Systems Architecture, Fifth Edition
  70. 71. Systems Architecture, Fifth Edition RAID 4 From Wikipedia
  71. 72. RAID 5 <ul><li>Employs block-level striping with parity information distributed across all data disks </li></ul>Systems Architecture, Fifth Edition
  72. 73. Other RAIDs <ul><li>RAID 2 – stripes data at the bit level and uses a Hamming code (no implementations) </li></ul><ul><li>RAID 3 – stripes data at the byte level and uses parity checking </li></ul><ul><li>RAID 6 – block-level striping with two parity blocks spread over all data disks </li></ul><ul><li>And multi-level RAIDs, such as RAID 0-5 </li></ul>Systems Architecture, Fifth Edition
  73. 74. Summary <ul><li>Storage devices and their underlying technologies </li></ul><ul><li>Characteristics common to all storage devices </li></ul><ul><li>Technology, strengths, and weaknesses of primary and secondary storage </li></ul>Systems Architecture, Fifth Edition

×