博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
OS Review Chapter 13: Mass Storage Structure
阅读量:3949 次
发布时间:2019-05-24

本文共 2359 字,大约阅读时间需要 7 分钟。

Chapter 13: Mass Storage Structure

文章目录

Disk Structure

在这里插入图片描述

Disk Attachment

Disks may be attached one of two ways:

  • Host attached via an I/O port
  • Network attached via a network connection

在这里插入图片描述

Network-Attached Storage

在这里插入图片描述

Storage-Area Network

Disk Scheduling

The operating system is responsible for using hardware efficiently — for the disk drives, this means having a fast access time and disk bandwidth.

Access time has two major components :

  • Seek time is the time for the disk are to move the heads to the cylinder containing the desired sector. 寻道

  • Rotational latency is the additional time waiting for the disk to rotate the desired sector to the disk head. 旋转时延

    两者均为机械运动

Access time 中,还有transfer time,属于电子运动,时延很短

–>Minimize seek time–>Seek time ≈ seek distance -->

Disk Scheduling Several algorithms exist to schedule the servicing of disk I/O requests :

FCFS

在这里插入图片描述

SSTF (Shortest Seek Time First)

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.

在这里插入图片描述

SCAN (elevator algorithm)

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.

在这里插入图片描述

C-SCAN (circular)

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.

在这里插入图片描述

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.

在这里插入图片描述

Selecting a Disk-Scheduling Algorithm

The disk-scheduling algorithm should be written as a separate module of the operating system, allowing it to be replaced with a different algorithm if necessary.

Either SSTF or LOOK is a reasonable choice for the default algorithm.

在这里插入图片描述

Disk Formatting

Low-level formatting, or physical formatting — Dividing a disk into sectors that the disk controller can read and write.

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 “making a file system”.

转载地址:http://bmgwi.baihongyu.com/

你可能感兴趣的文章
通过限制循环次数来避免死循环
查看>>
ADO连接字符串
查看>>
根据类型分配内存,实现通用编程
查看>>
字符数组的位置决定程序能否成功执行--不明白
查看>>
拷贝代码时没有仔细检查,导致误修改了函数参数
查看>>
MySQL批量导入数据SQL语句(CSV数据文件格式)
查看>>
ADO连接Oracle
查看>>
遍历Windows系统中所有进程的名字(*.exe)
查看>>
使用互斥量保证程序最多只有一个实例运行
查看>>
进程定点自杀
查看>>
进程看门狗
查看>>
线程看门狗
查看>>
调试代码的宏定义
查看>>
__FILE__和__FUNCTION__的使用
查看>>
创建、重命名文件
查看>>
文件大小保护
查看>>
先文件大小保护,再写文件
查看>>
目录创建
查看>>
日志文件系统的写日志函数
查看>>
删除目录下的文件
查看>>