操作系统--磁盘调度算法--FIFO，SSTF，SCAN，CSCAN

最新推荐文章于 2022-05-25 23:10:20 发布

HWQlet

最新推荐文章于 2022-05-25 23:10:20 发布

阅读量1.6k

点赞数

分类专栏：计算机操作系统文章标签：磁盘调度算法

本文链接：https://blog.csdn.net/HWQlet/article/details/106172265

版权

本文深入探讨了四种主要的磁盘调度算法：先来先服务(FIFO)、最短寻道时间优先(SSTF)、扫描(SCAN)和循环扫描(CSCAN)，分析其工作原理、优缺点及其在操作系统中的应用。

摘要由CSDN通过智能技术生成

代码如下：

"""磁盘调度算法，FIFO，SSTF，SCAN，CSCAN"""
import random
from collections import deque
from functools import reduce

path_num = int(input("path_num:"))
Disk_path = [x for x in random.sample(range(0, 201), path_num)]
Begin_path = random.choice(range(0, 201))
Disk_path_order = []
Move_order = []
Sum_moving = 0
Average_moving = 0


class disknode:
    """都是新式类了"""
    def __init__(self):
        self.val = None
        self.next = None
        self.pre = None


def initial():
    global path_num, Move_order, Disk_path_order, Average_moving,Sum_moving
    Disk_path_order = []
    Move_order = []
    Average_moving = 0
    Sum_moving = 0


def display():
    print("初始磁道:", Begin_path)
    print("磁道请求序列:", Disk_path)
    print("磁道调度序列:", Disk_path_order)
    print("移动距离序列:", Move_order)
    print("总移动距离:", Sum_moving)
    print("平均移动距离:", Average_moving)


def fifo():
    global Average_moving, Sum_moving
    count = 0
    while count < len(Disk_path):
        if count == 0:
            Disk_path_order.append(Disk_path[count])
            Move_order.append(abs(Disk_path_order[count] - Begin_path))
        else:
            Disk_path_order.append(Disk_path[count])