循环首次适应的动态分区分配算法模拟

循环首次适应的动态分区分配算法模拟

课程设计报告

课程设计题目：循环首次适应的动态分区分配算法模拟

专 业：计算机科学与技术 班 级：10204102 姓 名：谱 学 号: 10204102 指导教师: 高小辉

2013年 1 月 11 日

循环首次适应的动态分区分配算法模拟

目 录

一．循环首次适应算法 ···················································3

1. 概述 ································································ 3 2．需求分析·······························································3

二．实验指导································································4

1.基本思想······················································4 2．数据结构······················································4

三．运行环境·······················································6

四．流程图···································································6

五．循环首次适应算法代码···········································5

六．调试结果·······················································11

七、总结··························································14

八．参考文献·······················································14

循环首次适应的动态分区分配算法模拟

一． 循环首次适应算法

1. 概述：

该算法是由首次适应算法演变而成的。在为进程分配内存空间时，不再是每次都从链首开始查找，而是从上次找到的空闲分区的下一个空闲分区开始查找，直至找到一个能满足要求的空闲分区，从中划出一块的请求大小相等的内存空间分配给作业。为实现该算法，应设置一起始查找指针，用于指示下一次起始查询的空闲分区，并采用循环查找方式，即如果最后一个（链尾）空闲分区的大小仍不能满足要求，则返回到第一个空闲分区，比较大小是否满足，找到后，应调整起始查询指针。

2. 需求分析

了解动态分区分配中使用的数据结构和分配算法，并进一步加深对动态分区存储管理方式及其实现过程的理解。采用首次适应算法的动态分区分配过程alloc()和回收过程free()。

空闲分区通过空闲分区 …… 此处隐藏：6417字，全部文档内容请下载后查看。喜欢就下载吧 ……