Professional Documents
Culture Documents
• Disk Structure
• Disk Scheduling
• Disk Management
• Swap-Space Management
• Disk Reliability
• Stable-Storage Implementation
• Tertiary Storage Devices
• Operating System Issues
• Performance Issues
Applied Operating System Concepts 13.1 Silberschatz, Galvin, and Gagne 1999
Disk Structure
Applied Operating System Concepts 13.2 Silberschatz, Galvin, and Gagne 1999
Disk Scheduling
Applied Operating System Concepts 13.3 Silberschatz, Galvin, and Gagne 1999
Disk Scheduling (Cont.)
Head pointer 53
Applied Operating System Concepts 13.4 Silberschatz, Galvin, and Gagne 1999
FCFS
• 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.
Applied Operating System Concepts 13.6 Silberschatz, Galvin, and Gagne 1999
SSTF (Cont.)
• 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 or bus route
algorithm.
• Illustration shows total head movement of 208 (?) cylinders.
Applied Operating System Concepts 13.8 Silberschatz, Galvin, and Gagne 1999
SCAN (Cont.)
Applied Operating System Concepts 13.10 Silberschatz, Galvin, and Gagne 1999
C-SCAN (Cont.)
Applied Operating System Concepts 13.11 Silberschatz, Galvin, and Gagne 1999
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.
Applied Operating System Concepts 13.12 Silberschatz, Galvin, and Gagne 1999
C-LOOK (Cont.)
Applied Operating System Concepts 13.13 Silberschatz, Galvin, and Gagne 1999
Selecting a Disk-Scheduling Algorithm
Applied Operating System Concepts 13.14 Silberschatz, Galvin, and Gagne 1999
Disk Management
• Low-level formatting, or physical formatting — Dividing a disk into sectors that the disk
controller can read and write.
– How are sectors identified?
– Sector made up of a data structure: header, data area and a trailer - disk
controller/device drivers must be capable of identifying and interpreting this.
• To use a disk to hold files, the operating system still needs to record its own data
structures on the disk.
– Partition the disk into one or more groups of cylinders.
– Logical formatting or “creating a file system”. Includes: maps of free & allocated
space (FAT or inodes), & initial empty directory.
• Boot block initializes system.
– The bootstrap is stored in ROM.
– Bootstrap loader program - stored in boot block.
• Methods such as sector sparing used to handle bad blocks - usually SCSI.
– DOS based systems identify bad blocks in the FAT
Applied Operating System Concepts 13.15 Silberschatz, Galvin, and Gagne 1999
Swap-Space Management
How is virtual memory implemented or created on a disk? All we
have in the beginning are files and ”empty” memory.
• Swap-space — Virtual memory uses disk space as an extension of main
memory - this is where the entire virtual memory is mapped and stored.
Must have a disk sufficiently large to handle this address space.
• Swap space is not necessarily preserve once the machine is re-booted- it
generally grows as the system gets used.
• Swap-space can be carved out of the normal file system,or, more commonly, it
can be in a separate disk partition.
• Swap-space management
– 4.3BSD (UNIX version) allocates swap space when process starts; holds
text segment (the program) and data segment.
– In UNIX 4.3BSD, when a process starts, its text is paged in from the
file system and then written out to swap-space when necessary, and
are read back in from there, so the file system is consulted only once
for each text page.
– Kernel uses swap maps to track swap-space use.
– Solaris 2 allocates swap space only when a page is forced out of physical
memory, not when the virtual memory page is first created.
Applied Operating System Concepts 13.16 Silberschatz, Galvin, and Gagne 1999
Disk Reliability
OMIT remaining slides after this one - end of course!
Applied Operating System Concepts 13.17 Silberschatz, Galvin, and Gagne 1999
Stable-Storage Implementation
Applied Operating System Concepts 13.18 Silberschatz, Galvin, and Gagne 1999
Tertiary Storage Devices
Applied Operating System Concepts 13.19 Silberschatz, Galvin, and Gagne 1999
Removable Disks
Applied Operating System Concepts 13.20 Silberschatz, Galvin, and Gagne 1999
Removable Disks (Cont.)
Applied Operating System Concepts 13.21 Silberschatz, Galvin, and Gagne 1999
WORM Disks
Applied Operating System Concepts 13.22 Silberschatz, Galvin, and Gagne 1999
Tapes
Applied Operating System Concepts 13.23 Silberschatz, Galvin, and Gagne 1999
Operating System Issues
Applied Operating System Concepts 13.24 Silberschatz, Galvin, and Gagne 1999
Application Interface
Applied Operating System Concepts 13.25 Silberschatz, Galvin, and Gagne 1999
Tape Drives
Applied Operating System Concepts 13.26 Silberschatz, Galvin, and Gagne 1999
File Naming
Applied Operating System Concepts 13.27 Silberschatz, Galvin, and Gagne 1999
Hierarchical Storage Management (HSM)
Applied Operating System Concepts 13.28 Silberschatz, Galvin, and Gagne 1999
Speed
Applied Operating System Concepts 13.29 Silberschatz, Galvin, and Gagne 1999
Speed (Cont.)
Applied Operating System Concepts 13.30 Silberschatz, Galvin, and Gagne 1999
Reliability
Applied Operating System Concepts 13.31 Silberschatz, Galvin, and Gagne 1999
Cost
Applied Operating System Concepts 13.32 Silberschatz, Galvin, and Gagne 1999