1 / 320

CHAPTER 15 --------------------- Section 15.1- 4 changes Section 15.2- 3 changes

erasmus-hawkins
Download Presentation

CHAPTER 15 --------------------- Section 15.1- 4 changes Section 15.2- 3 changes

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CHAPTER 13-------------------------Section 13.1 – 4 changesSection 13.2 - 5 changes Section 13.3- 3 changes (Figures)Section 13.4 – 3 changesSection 13.5 – 3 changesSection 13.6- 4 changesSection 13.7- 3 changesSection 13.8- 3 changesSection 13.9- 4 changes===========================Total – 32 Changes

  2. CHAPTER 15 --------------------- Section 15.1- 4 changes Section 15.2- 3 changes Section 15.3- 4 changes Section 15.4- 3 changes Section 15.5- 3 changes Section 15.6- 4 changes Section 15.7- 3 changes Section 15.8 – 2 changes Section 15.9 – 3 changes ====================== Total – 29 Changes

  3. CHAPTER 18 ------------------------- Section 18.1- 3 changes Section 18.2- 2 changes Section 18.3- 3 changes Section 18.4 – 4 changes Section 18.5 – 2 changes Section 18.6- 4 changes Section 18.7- 3 changes Section 18.8- 3 changes ===================== Total = 25 changes

  4. 13.1 Secondary Storage Management The Memory Hierarchy

  5. The Memory Hierarchy Overview The memory hierarchy of devices with progressively slower access but larger capacity is reviewed. We see how the speed of data access is affected by how we organize our data on the disk. How to manage insertions and deletions of records, as well as records whose sizes grow and shrink is also discussed.

  6. The Memory Hierarchy • Computer systems have several different components in which data may be stored. • Data capacities & access speeds range over at least seven orders of magnitude • Devices with smallest capacity also offer the fastest access speed

  7. Description of Levels • Cache • Megabyte or more of Cache storage. • On-board cache : On same chip. • Level-2 cache : On another chip. • Cache data accessed in few nanoseconds • Data moved from main memory to cache when needed by processor • Volatile

  8. Description of Levels 2. Main Memory • 1 GB or more of main memory. • Instruction execution & Data Manipulation - involves information resident in main memory. • Time to move data from main memory to the processor or cache is in the 10-100 nanosecond range. • Volatile 3. Secondary Storage • Typically a magnetic disk. • Capacity upto 1 TB. • One machine can have several disk units. • Time to transfer a single byte between disk & main memory is around 10 milliseconds.

  9. Description of Levels 4. Tertiary Storage • Holds data volumes measured in terabytes. • Significantly higher read/write times. • Smaller cost per bytes. • Retrieval takes seconds or minutes, but capacities in the petabyte range are possible.

  10. Transfer of Data Between Levels • Data moves between adjacent levels of the hierarchy. (For secondary and tertiary storage finding storage place is greate deal of time) • Each level is organized to transfer large amounts of data to or from the level below • Key technique for speeding up database operations is to arrange data so that when one piece of a disk block is needed, it is likely that other data on the same block will also be needed at about the same time.

  11. Volatile & Non Volatile Storage • A volatile device “forgets” what is stored in it when the power goes off. • Example: Main Memory(although certain types of more expensive memory chips, such as flash memory, can hold their data after a power failure) • A nonvolatile device, on the other hand, is expected to keep its contents intact even for long periods when the device is turned off or there is a power failure. • Example: Secondary & Tertiary Storage

  12. Virtual Memory • Managed by Operating System. • Has address space of 32 bits. • Some memory in main memory & rest on disk. • Transfer between the two is in units of disk blocks (pages). • Not a level of the memory hierarchy

  13. Section 13.2 – Secondary storage management

  14. Index • 13.2 Disks • 13.2.1 Mechanics of Disks • 13.2.2 The Disk Controller • 13.2.3 Disk Access Characteristics

  15. Disks: • The use of secondary storage is one of the important characteristics of a DBMS, and secondary storage is almost exclusively based on magnetic disks

  16. Structure of a Disk

  17. Data in Disk • 0’s and 1’s are represented by different patterns in the magnetic material. • A common diameter for the disk platters is 3.5 inches.

  18. Mechanics of Disks • Two principal moving pieces of hard drive 1- Head Assembly 2- Disk Assembly • Disk Assembly has 1 or more circular platters that rotate around a central spindle. • Platters are covered with thin magnetic material

  19. Top View of Disk Surface

  20. Mechanics of Disks • Tracks are concentric circles on a platter. • Tracks are organized into sectors which are segments of circular platter. • Sectors are indivisible as far as errors are concerned. • Blocks are logical data transfer units.

  21. Disk Controller • Control the actuator to move head assembly • Selecting the surface from which to read or write • Transfer bits from desired sector to main memory

  22. Simple Single Processor Computer

  23. Disk Access characteristics • Seek time: The disk controller positions the head assembly at the cylinder containing the track on which the block is located. The time to do so is the seek time. • Rotational latency: The disk controller waits while the first sector of the block moves under the head. This time is called the rotational latency.

  24. Disk Access characteristics • Transfer time:All the sectors and the gaps between them pass under the head, while the disk controller reads or writes data in these sectors. This delay is called the transfer time. • Latency of the disk:The sum of the seek time, rotational latency, transfer time is the latency of the time.

  25. 13.3 Accelerating Access to Secondary Storage San Jose State University Spring 2012

  26. 13.3 Accelerating Access to Secondary StorageSection Overview • 13.3.1: The I/O Model of Computation • 13.3.2: Organizing Data by Cylinders • 13.3.3: Using Multiple Disks • 13.3.4: Mirroring Disks • 13.3.5: Disk Scheduling and the Elevator Algorithm • 13.3.6: Prefetching and Large-Scale Buffering

  27. 13.3 Introduction • Average block access is ~10ms. • Disks may be busy. • Requests may outpace access delays, leading to infinite scheduling latency. • There are various strategies to increase disk throughput. • The “I/O Model” is the correct model to determine speed of database operations

  28. 13.3 Introduction (Contd.) • Actions that improve database access speed: • Place blocks closer, within the same cylinder • Increase the number of disks • Mirror disks • Use an improved disk-scheduling algorithm • Use prefetching

  29. 13.3.1 The I/O Model of Computation • If we have a computer running a DBMS that: • Is trying to serve a number of users • Has 1 processor, 1 disk controller, and 1 disk • Each user is accessing different parts of the DB • It can be assumed that: • Time required for disk access is much larger than access to main memory; and as a result: • The number of block accesses is a good approximation of time required by a DB algorithm

  30. 13.3.2 Organizing Data by Cylinders • It is more efficient to store data that might be accessed together in the same or adjacent cylinder(s). • In a relational database, related data should be stored in the same cylinder.

  31. 13.3.3 Using Multiple Disks • If the disk controller supports the addition of multiple disks and has efficient scheduling, using multiple disks can improve performance significantly • By striping a relation across multiple disks, each chunk of data can be retrieved in a parallel fashion, improving performance by up to a factor of n, where n is the total number of disks the data is striped over

  32. 13.3.4 Mirroring Disks • A drawback of striping data across multiple disks is that you increase your chances of disk failure. • To mitigate this risk, some DBMS use a disk mirroring configuration • Disk mirroring makes each disk a copy of the other disks, so that if any disk fails, the data is not lost • Since all the data is in multiple places, access speedup can be increased by more than n since the disk with the head closest to the requested block can be chosen

  33. 13.3.4 Mirroring Disks

  34. 13.3.5 Disk Scheduling • One way to improve disk throughput is to improve disk scheduling, prioritizing requests such that they are more efficient • The elevator algorithm is a simple yet effective disk scheduling algorithm • The algorithm makes the heads of a disk oscillate back and forth similar to how an elevator goes up and down • The access requests closest to the heads current position are processed first

  35. 13.3.5 Disk Scheduling • When sweeping outward, the direction of head movement changes only after the largest cylinder request has been processed • When sweeping inward, the direction of head movement changes only after the smallest cylinder request has been processed • Example:

  36. 13.3.6 Prefetching and Large-Scale Buffering • In some cases we can anticipate what data will be needed • We can take advantage of this by prefetching data from the disk before the DBMS requests it • Since the data is already in memory, the DBMS receives it instantly

  37. 13.4.Disk Failures

  38. Index • 13.4 Disk Failures 13.4.1 Intermittent Failures 13.4.2 Organizing Data by Cylinders 13.4.3 Stable Storage 13.4.4 Error- Handling Capabilities of Stable Storage 13.4.5 Recovery from Disk Crashes 13.4.6 Mirroring as a Redundancy Technique 13.4.7 Parity Blocks 13.4.8 An Improving: RAID 5 13.4.9 Coping With Multiple Disk Crashers

  39. Intermittent Failures • If we try to read the sector but the correct content of that sector is not delivered to the disk controller • Controller will check good and bad sector • If the write is correct: Read is performed • Good sector and bad sector is known by the read operation

  40. CheckSum • Read operation that determine the good or bad status

  41. How CheckSum perform • Each sector has some additional bits • Set depending on the values of the data bits stored in each sector • If the data bit in the not proper we know there is an error reading • Odd number of 1: bits have odd parity(01101000) • Even number of 1: bit have even parity (111011100) • Find Error is the it is one bit parity

  42. Stable Storage • Deal with disk error • Sectors are paired and each pair X showing left and right copies as Xl and Xr • It check the parity bit of left and right by substituting spare sector of Xl and Xr until the good value is returned

  43. The writing policy is: • Write the value of X into X l - Check that the value has status “good”; i.e., the parity-check bits are correct in the written copy. If not, repeat the write. If after a set number of write attempts, we have not successfully written X into X l , assume that there is-a media failure in this sector. A fix-up such as substituting a spare sector for X l must be adopted. • Repeat (1) for X r .

  44. Error-Handling Capabilities of Stable Storage • Since it has XL and XR, one of them fail we can still read other one • Chance both of them fail are pretty small • The write Fail, it happened during power outage

  45. Recover Disk Crash • The most serious mode of failure for disks is “head crash” where data permanently destroyed. • The way to recover from crash , we use RAID method

  46. Mirroring as a Redundancy Technique • it is call Raid 1 • Just mirror each disk

  47. Raid 1 graph

  48. Parity Block • It often call Raid 4 technical • read block from each of the other disks and modulo-2 sum of each column and get redundant disk disk 1: 11110000 disk 2: 10101010 disk 3: 00111000 get redundant disk 4(even 1= 0, odd 1 =1) disk 4: 01100010

  49. Raid 4 graphic

  50. Parity Block- Fail Recovery • It can only recover one disk fail • If it has more than one like two disk • Then it can’t be recover us modulo-2 sum

More Related