#include <iostream>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <map>
#include <algorithm>
using namespace std;
int findLRU(map<int, int> managedMap);
deque<int> fifo;
map<int, int> lru;
map<int, int>opt;
const int LEN = 1000; //要访问的页面总数
const int BLOCKNO = 3; //物理块数
const int INF = 999999; //用于opt算法中在后续找不到该元素所用
int main() {
//初始化测试以数据
srand((unsigned)time(NULL));
int testData[LEN];
//int testData[LEN] = {2,3,2,1,5,2,4,5,3,2,5,2};
for (int i = 0; i < LEN; i++) {
testData[i] = rand() % 5 + 1;
}
//初始化测试数据完毕
int success=0; //命中次数
int fail = 0; //缺页次数 + 物理块数
//FIFO算法
for (int i = 0; i < LEN; i++) {
auto pos = find(fifo.cbegin(), fifo.cend(), testData[i]);
if (pos != fifo.cend())
success++;
else {
fail++;
if (fifo.size() < BLOCKNO) {
fifo.push_back(te
OPT, LRU, FIFO页面调度算法的模拟
最新推荐文章于 2024-06-12 00:34:15 发布