> # ♻️ 资源
> **大小:** 4.42MB
> **文档链接:**[**https://www.yuque.com/sxbn/ks/100013187**](https://www.yuque.com/sxbn/ks/100013187)
**➡️ 资源下载:**[**https://download.csdn.net/download/s1t16/88220877**](https://download.csdn.net/download/s1t16/88220877)
**注:更多内容可关注微信公众号【神仙别闹】,如当前文章或代码侵犯了您的权益,请私信作者删除!**
# 最佳页面置换算法
**思想**: 最佳页面置换算法所选择的被淘汰页,将是以后永不使用的,或许是在最长时间内不再被访问的页面。
通常可以保证有最小的缺页率,但这种方法不太现实。
**实现模拟算法思想如下**:创建一数组用以记录当前内存内各页面以后到最近可能访问的那一次所需遍历的次数(即最长时间内不再被访问的时间)。当须置换时,将所需遍历次数最多的那个覆盖掉即可。
程序结果界面如下:
![image.png](https://cdn.nlark.com/yuque/0/2023/png/2469055/1692149450221-f98b0d87-409f-4547-9196-d76e1636b6ae.png#averageHue=%23887562&clientId=u6d3b5214-3685-4&from=paste&height=253&id=u83655aeb&originHeight=316&originWidth=693&originalType=binary&ratio=1.25&rotation=0&showTitle=false&size=151793&status=done&style=none&taskId=udb97b4a9-f1aa-4477-b675-78250b7addc&title=&width=554.4)
输入创建页面个数为10:
![image.png](https://cdn.nlark.com/yuque/0/2023/png/2469055/1692149471143-3cad62d8-4f71-4bb4-8a19-77a6be5de1e1.png#averageHue=%23786c5e&clientId=u6d3b5214-3685-4&from=paste&height=214&id=uae392dae&originHeight=267&originWidth=688&originalType=binary&ratio=1.25&rotation=0&showTitle=false&size=148980&status=done&style=none&taskId=u561b85c4-7bba-442b-b442-fc1b39ee9c1&title=&width=550.4)
输入物理块数为3:
![image.png](https://cdn.nlark.com/yuque/0/2023/png/2469055/1692149501051-d919cc49-1159-4c82-9e8a-6a4ce3f65b8b.png#averageHue=%237e7062&clientId=u6d3b5214-3685-4&from=paste&height=235&id=u1f5b0dc5&originHeight=294&originWidth=693&originalType=binary&ratio=1.25&rotation=0&showTitle=false&size=175637&status=done&style=none&taskId=uc494cfd7-ce54-41f0-a124-f9204d504ee&title=&width=554.4)点击查看,效果如下:
![image.png](https://cdn.nlark.com/yuque/0/2023/png/2469055/1692149528449-8b3a88ca-0670-4ff0-84ed-79e99f30450a.png#averageHue=%2373695c&clientId=u6d3b5214-3685-4&from=paste&height=218&id=u027cf2ba&originHeight=273&originWidth=689&originalType=binary&ratio=1.25&rotation=0&showTitle=false&size=153047&status=done&style=none&taskId=ub969780b-cbca-40a8-b6ab-74100023a7e&title=&width=551.2)
点击运行,并点击查看,效果如下:
![image.png](https://cdn.nlark.com/yuque/0/2023/png/2469055/1692149550322-4206141f-ecf8-4b1a-bcce-b5fb3c661528.png#averageHue=%236f665b&clientId=u6d3b5214-3685-4&from=paste&height=254&id=u590dcd67&originHeight=317&originWidth=690&originalType=binary&ratio=1.25&rotation=0&showTitle=false&size=203546&status=done&style=none&taskId=ufce5dad9-43f4-4fba-835a-bb549e3b4f3&title=&width=552)
# 最近最久未使用算法
**思想**:选择最近最久未使用的页面作为淘汰页面
**实现方法**:始终将最近最久未使用的页面放在ss[0][j]内,若页面不在内存,将其置换到ss[0][j],并刷新ss[i][j],找出最近最久未使用的放入ss[0][j]内。
程序结果界面如下:
输入创建页面个数为7
![image.png](https://cdn.nlark.com/yuque/0/2023/png/2469055/1692149586536-17ff102b-0cef-4ce7-8098-9543370d9d08.png#averageHue=%23877360&clientId=u6d3b5214-3685-4&from=paste&height=230&id=udb6d6e3e&originHeight=287&originWidth=690&originalType=binary&ratio=1.25&rotation=0&showTitle=false&size=147465&status=done&style=none&taskId=uf0029ae0-e8a9-4df8-b0d9-0ed1897d4a7&title=&width=552)
输入物理块数为3
![image.png](https://cdn.nlark.com/yuque/0/2023/png/2469055/1692149605949-7505757e-0345-4ea2-aa47-8e06fa9fbb90.png#averageHue=%237a6c5c&clientId=u6d3b5214-3685-4&from=paste&height=266&id=uecef71e7&originHeight=333&originWidth=688&originalType=binary&ratio=1.25&rotation=0&showTitle=false&size=197633&status=done&style=none&taskId=u4b8b1ddb-c937-489e-a773-94ebdf7e280&title=&width=550.4)
点击查看效果如下:
![image.png](https://cdn.nlark.com/yuque/0/2023/png/2469055/1692149627233-c5dc0d93-69db-400a-a6ee-70576945b75f.png#averageHue=%23796a5b&clientId=u6d3b5214-3685-4&from=paste&height=246&id=u1a36b3c8&originHeight=308&originWidth=689&originalType=binary&ratio=1.25&rotation=0&showTitle=false&size=154863&status=done&style=none&taskId=ueb426b7f-4797-412a-b54b-b828c4de1f2&title=&width=551.2)
运行并查看:
![image.png](https://cdn.nlark.com/yuque/0/2023/png/2469055/1692149644531-87f68e79-405c-41ec-b2b0-7b7c271d54c4.png#averageHue=%237e6d5c&clientId=u6d3b5214-3685-4&from=paste&height=230&id=uefa52b7b&originHeight=287&originWidth=689&originalType=binary&ratio=1.25&rotation=0&showTitle=false&size=143688&status=done&style=none&taskId=u062ce0a6-c9e7-458b-b7e3-f05609a78c2&title=&width=551.2)
# 先进先出页面置换算法
**思想**:该算法总是淘汰最先进入内存的页面,即选择在内存中驻留时间最久的予以淘汰。
**算法实现具体方法**:利用数组,总是将最先进入的放在数组的起始单元内ss[0][j]内,若页面不在内存,将其放在ss[0][j]内覆盖即可。
程序结果界面如下:
![image.png](https://cdn.nlark.com/yuque/0/2023/png/2469055/1692149668771-cb5eda0e-cae0-4422-9d79-f8a094a4c799.png#averageHue=%2384725f&clientId=u6d3b5214-3685-4&from=paste&height=259&id=u935ec2d9&originHeight=324&originWidth=690&originalType=binary&ratio=1.25&rotation=0&showTitle=false&size=176844&status=done&style=none&taskId=u41fb7d9c-a71b-4e67-ae52-bee606a8cbc&title=&width=552)创建页面个数为8;
物理块数为4;
![image.png](https://cdn.nlark.com/yuque/0/2023/png/2469055/1692149690817-80b2cf2f-a2aa-424f-8f86-1df9120eaed2.png#averageHue=%237d6e5f&clientId=u6d3b5214-3685-4&from=paste&height=246&id=ueda9c787&originHeight=307&originWidth=687&originalType=binary&ratio=1.25&rotation=0&showTitle=false&size=164473&status=done&style=none&taskId=u224f5ffe-881b-418e-91ea-a6063170775&title=&width=549.6)
运行并查看,结果如下图:
![image.png](https://cdn.nlark.com/yuque/0/2023/png/2469055/1692149708640-b474ea63-2c20-40e9-b6a4-73fb95ab53d9.png#averageHue=%2386715d&clientId=u6d3b5214-3685-4&from=paste&height=223&id=ue25af35e&originHeight=279&originWidth=690&originalType=binary&ratio=1.25&rotation=0&showTitle=false&size=109764&status=done&style=none&taskId=udb0df899-c22a-4101-a712-27f956d9c56&title=&width=552)