Disks Disk Hardware 1 Disk parameters for the

  • Slides: 21
Download presentation
Disks Disk Hardware (1) Disk parameters for the original IBM PC floppy disk and

Disks Disk Hardware (1) Disk parameters for the original IBM PC floppy disk and a Western Digital WD 18300 hard disk

Disk Hardware • Physical geometry of a disk with two zones • A possible

Disk Hardware • Physical geometry of a disk with two zones • A possible virtual geometry for this disk

Disk Arm Scheduling Algorithms • Time required to read or write a disk block

Disk Arm Scheduling Algorithms • Time required to read or write a disk block determined by 3 factors 1. 2. 3. Seek time Rotational delay Actual transfer time • Seek time dominates • Error checking is done by controllers

FCFS Illustration shows total head movement of 640 cylinders.

FCFS Illustration shows total head movement of 640 cylinders.

SSTF • Selects the request with the minimum seek time from the current head

SSTF • Selects the request with the minimum seek time from the current head position. • SSTF scheduling is a form of SJF scheduling; may cause starvation of some requests. • Illustration shows total head movement of 236 cylinders.

SSTF (Cont. )

SSTF (Cont. )

SCAN/Elevator • The disk arm starts at one end of the disk, and moves

SCAN/Elevator • The disk arm starts at one end of the disk, and moves toward the other end, servicing requests until it gets to the other end of the disk, where the head movement is reversed and servicing continues. • Sometimes called the elevator algorithm. • Illustration shows total head movement of 208 cylinders.

SCAN (Cont. )

SCAN (Cont. )

C-SCAN • Provides a more uniform wait time than SCAN. • The head moves

C-SCAN • Provides a more uniform wait time than SCAN. • The head moves from one end of the disk to the other servicing requests as it goes. When it reaches the other end, however, it immediately returns to the beginning of the disk, without servicing any requests on the return trip. • Treats the cylinders as a circular list that wraps around from the last cylinder to the first one.

C-SCAN (Cont. )

C-SCAN (Cont. )

C-LOOK • Version of C-SCAN • Arm only goes as far as the last

C-LOOK • Version of C-SCAN • Arm only goes as far as the last request in each direction, then reverses direction immediately, without first going all the way to the end of the disk.

C-LOOK (Cont. )

C-LOOK (Cont. )

Error Handling • A disk track with a bad sector • Substituting a spare

Error Handling • A disk track with a bad sector • Substituting a spare for the bad sector • Shifting all the sectors to bypass the bad one

OS Review What is an OS? What is a Process? What is a Memory

OS Review What is an OS? What is a Process? What is a Memory Manager? What is a File System?

What is an OS? • System Calls • Resource Manager

What is an OS? • System Calls • Resource Manager

What is a process? – Program in execution – Process States – Threads –

What is a process? – Program in execution – Process States – Threads – Synchronization – Scheduling

What is Memory Management? • Multiprogramming and the need to manage memory • MFT,

What is Memory Management? • Multiprogramming and the need to manage memory • MFT, MVT, security (bounds, limit) • Virtual Memory – Paging – Segmentation – Segments are paged • Page replacement algorithms

What is a File System? • Files and Directories • File operations, permissions, security

What is a File System? • Files and Directories • File operations, permissions, security • File structure organization – Allocation and De-allocation • Disks, partitions, file systems – Disk scheduling

Questions?

Questions?

Disk Arm Scheduling Algorithms (3) The elevator algorithm for scheduling disk requests

Disk Arm Scheduling Algorithms (3) The elevator algorithm for scheduling disk requests

Disk Arm Scheduling Algorithms (2) Initial position Pending requests Shortest Seek First (SSF) disk

Disk Arm Scheduling Algorithms (2) Initial position Pending requests Shortest Seek First (SSF) disk scheduling algorithm