按照最先分配算法得出的结果:
JOB 1申请130K
-------------------------------------------------
空闲分区链表: |
begin:130K length:510K 空闲 |
|
占用分区链表: |
begin:0K length:130K use:Job1 |
|
整个内存情况: |
低地址 |
begin:0K length:130K use:Job1 |
begin:130K length:510K 空闲 |
高地址 |
-------------------------------------------------
JOB 2申请60K
-------------------------------------------------
空闲分区链表: |
begin:190K length:450K 空闲 |
|
占用分区链表: |
begin:0K length:130K use:Job1 |
begin:130K length:60K use:Job2 |
|
整个内存情况: |
低地址 |
begin:0K length:130K use:Job1 |
begin:130K length:60K use:Job2 |
begin:190K length:450K 空闲 |
高地址 |
-------------------------------------------------
JOB 3申请100K
-------------------------------------------------
空闲分区链表: |
begin:290K length:350K 空闲 |
|
占用分区链表: |
begin:0K length:130K use:Job1 |
begin:130K length:60K use:Job2 |
begin:190K length:100K use:Job3 |
|
整个内存情况: |
低地址 |
begin:0K length:130K use:Job1 |
begin:130K length:60K use:Job2 |
begin:190K length:100K use:Job3 |
begin:290K length:350K 空闲 |
高地址 |
-------------------------------------------------
JOB 2释放60K
-------------------------------------------------
空闲分区链表: |
begin:130K length:60K 空闲 |
begin:290K length:350K 空闲 |
|
占用分区链表: |
begin:0K length:130K use:Job1 |
begin:190K length:100K use:Job3 |
|
整个内存情况: |
低地址 |
begin:0K length:130K use:Job1 |
begin:130K length:60K 空闲 |
begin:190K length:100K use:Job3 |
begin:290K length:350K 空闲 |
高地址 |
-------------------------------------------------
JOB 4申请200K
-------------------------------------------------
空闲分区链表: |
begin:130K length:60K 空闲 |
begin:490K length:150K 空闲 |
|
占用分区链表: |
begin:0K length:130K use:Job1 |
begin:190K length:100K use:Job3 |
begin:290K length:200K use:Job4 |
|
整个内存情况: |
低地址 |
begin:0K length:130K use:Job1 |
begin:130K length:60K 空闲 |
begin:190K length:100K use:Job3 |
begin:290K length:200K use:Job4 |
begin:490K length:150K 空闲 |
高地址 |
-------------------------------------------------
JOB 3释放100K
-------------------------------------------------
空闲分区链表: |
begin:130K length:160K 空闲 |
begin:490K length:150K 空闲 |
|
占用分区链表: |
begin:0K length:130K use:Job1 |
begin:290K length:200K use:Job4 |
|
整个内存情况: |
低地址 |
begin:0K length:130K use:Job1 |
begin:130K length:160K 空闲 |
begin:290K length:200K use:Job4 |
begin:490K length:150K 空闲 |
高地址 |
-------------------------------------------------
JOB 1释放130K
-------------------------------------------------
空闲分区链表: |
begin:0K length:290K 空闲 |
begin:490K length:150K 空闲 |
|
占用分区链表: |
begin:290K length:200K use:Job4 |
|
整个内存情况: |
低地址 |
begin:0K length:290K 空闲 |
begin:290K length:200K use:Job4 |
begin:490K length:150K 空闲 |
高地址 |
-------------------------------------------------
JOB 5申请140K
-------------------------------------------------
空闲分区链表: |
begin:140K length:150K 空闲 |
begin:490K length:150K 空闲 |
|
占用分区链表: |
begin:0K length:140K use:Job5 |
begin:290K length:200K use:Job4 |
|
整个内存情况: |
低地址 |
begin:0K length:140K use:Job5 |
begin:140K length:150K 空闲 |
begin:290K length:200K use:Job4 |
begin:490K length:150K 空闲 |
高地址 |
-------------------------------------------------
JOB 6申请60K
-------------------------------------------------
空闲分区链表: |
begin:200K length:90K 空闲 |
begin:490K length:150K 空闲 |
|
占用分区链表: |
begin:0K length:140K use:Job5 |
begin:140K length:60K use:Job6 |
begin:290K length:200K use:Job4 |
|
整个内存情况: |
低地址 |
begin:0K length:140K use:Job5 |
begin:140K length:60K use:Job6 |
begin:200K length:90K 空闲 |
begin:290K length:200K use:Job4 |
begin:490K length:150K 空闲 |
高地址 |
-------------------------------------------------
JOB 7申请50K
-------------------------------------------------
空闲分区链表: |
begin:250K length:40K 空闲 |
begin:490K length:150K 空闲 |
|
占用分区链表: |
begin:0K length:140K use:Job5 |
begin:140K length:60K use:Job6 |
begin:200K length:50K use:Job7 |
begin:290K length:200K use:Job4 |
|
整个内存情况: |
低地址 |
begin:0K length:140K use:Job5 |
begin:140K length:60K use:Job6 |
begin:200K length:50K use:Job7 |
begin:250K length:40K 空闲 |
begin:290K length:200K use:Job4 |
begin:490K length:150K 空闲 |
高地址 |
-------------------------------------------------
JOB 6释放60K
-------------------------------------------------
空闲分区链表: |
begin:140K length:60K 空闲 |
begin:250K length:40K 空闲 |
begin:490K length:150K 空闲 |
|
占用分区链表: |
begin:0K length:140K use:Job5 |
begin:200K length:50K use:Job7 |
begin:290K length:200K use:Job4 |
|
整个内存情况: |
低地址 |
begin:0K length:140K use:Job5 |
begin:140K length:60K 空闲 |
begin:200K length:50K use:Job7 |
begin:250K length:40K 空闲 |
begin:290K length:200K use:Job4 |
begin:490K length:150K 空闲 |
高地址 |
-------------------------------------------------
文件中数据0 8 -5输入的格式错误,不于处理
JOB 4申请100K
输入作业号已存在于占用分区链表,不于处理
JOB 8申请250K
没有符合条件的空闲分区可供分配,不于处理
JOB 3释放100K
没有与指定作业号符合的占用分区,不于处理
========================================
没有合适的资源?快使用搜索试试~ 我知道了~
内存管理作业C++ 提供两个版本:windows平台和linux平台下运行
共10个文件
txt:4个
c:2个
dsp:1个
5星 · 超过95%的资源 需积分: 10 22 下载量 29 浏览量
2010-11-06
12:52:27
上传
评论
收藏 14KB ZIP 举报
温馨提示
提供两个版本:windows平台和linux平台下运行 注意:linux版本使用GCC编译连接运行 1. cd到source code目录 2.1 使用compile_shell shell script编译连接:./compile_shell 2.2 使用Makefile文件 编译连接:make 3. 运行生成的可执行文件: ./mainEXE (注意代码注释和输出数据中包含中文,要求linux系统支持中文显示) (通过session display manager登录X-Windows时选择简体中文语言,代码用GUN Emacs打开) 程序特色: 1 为使输出数据简明易懂,对输出的格式控制可谓精雕细啄 2 多种数据输入方式:控制台手工输入/文件输入 3 多种结果输出方式:在控制台显示/保存到文件 4 完善的异常输入数据检测报错机制 5 完善详细的数据手工输入帮助提示 7 程序的结构化模块化清晰 6 详细的源代码注释 编程要点: 1 详细见源代码和注释 2 算法难点(1) 将空闲分区链表和占用分区链表按地址顺序合并显示 3 算法难点(2) 提供最先分配和最优分配两种算法,逻辑控制较复杂
资源推荐
资源详情
资源评论
收起资源包目录
内存管理.zip (10个子文件)
win-virson
source code
main.c 16KB
AreaManage.dsw 545B
AreaManage.opt 53KB
AreaManage.dsp 4KB
Debug
AreaManage.ncb 33KB
executable file
result_data_1.txt 6KB
source_data.txt 127B
result_data_2.txt 6KB
linux-virson
source code
AreaList.c 7KB
演示说明.txt 973B
共 10 条
- 1
资源评论
- lvchenging2013-03-12还是很有帮助的!!谢谢
- 普通网友2013-04-14windows 版本还挺好用的,可以直接运行
- claymorena2013-12-02挺有帮助的 十分感谢
yanjinghao
- 粉丝: 1
- 资源: 10
上传资源 快速赚钱
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功