页面置换算法——基于c语言数组实现

最新推荐文章于 2024-10-27 12:59:29 发布

iEmmus

最新推荐文章于 2024-10-27 12:59:29 发布

阅读量71

点赞数 2

文章标签：算法 c语言 c++

本文链接：https://blog.csdn.net/iEmmus/article/details/139883436

版权

#define _

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<stdlib.h>
using namespace std;
int storage[10] = { 0 }, process[4] = { 0 }, page[21], memory[10] = { 0 };
void Opt()
{
    for (int i = 1, j = 1; i <= 20; i++)
    {
        int temp = 0;
        for (int k = 1; k <= 3; k++)
            storage[k] = 0;
        if (j > 3)
        {
            if (memory[page[i]] == 0)
            {
                temp = 1;
                for (j = 1; j < 4; j++)
                {
                    for (int k = i; k <= 20; k++)
                    {
                        if (page[k] == process[j])
                        {
                            storage[process[j]] = k - i;
                            break;
                        }
                    }
                    if (storage[process[j]] == 0)
                        storage[process[j]] = 50;

                }
                int MAX = max(storage[process[1]], max(storage[process[2]], storage[process[3]]));
                for (int k = 1; k <= 3; k++)
                {
                    if (MAX == storage[process[k]])
                    {
                        memory[process[k]] = 0;
                        process[k] = page[i];
                        break;
                    }
                    storage[process[k]] = 0;
                }
                memory[page[i]] = 1;
            }
        }
        if (j < 4)
        {
            if (memory[page[i]] == 0)
            {
                temp = 1;
                process[j] = page[i];
                memory[page[i]] = 1;
                j++;
            }
        }
        if (temp == 1)
        {
            for (int i = 1; i < 4; i++)
                printf("%d ", process[i]);
        }
        cout << endl;
    }
}

void FIFO()
{
    for (int i = 1, j = 1; i <= 20; i++)
    {
        int temp = 0;
        if (j > 3)
        {
            if (memory[page[i]] == 0)
            {
                temp = 1;
                int MIN = min(storage[process[1]], min(storage[process[2]], storage[process[3]]));
                for (int k = 1; k < 4; k++)
                {
                    if (storage[process[k]] == MIN)
                    {
                        memory[process[k]] = 0;
                        process[k] = page[i];
                        storage[process[k]] = i;
                        
                    }
                }
                memory[page[i]] = 1;
            }
        }
        if (j < 4)
        {
            if (memory[page[i]] == 0)
            {
                temp = 1;
                process[j] = page[i];
                memory[page[i]] = 1;
                storage[process[j]] = i;
                j++;
            }
        }
        if (temp == 1)
        {
            for (int i = 1; i < 4; i++)
                printf("%d ", process[i]);
            cout << "     ";
            for (int k = 0; k < 10; k++)
                cout <<memory[k]<<" ";
        }
        cout << endl;
    }
}

void LRU()
{
    for (int i = 1, j = 1; i <= 20; i++)
    {
        int temp = 0;
        if (j > 3)
        {
            if (memory[page[i]] == 0)
            {
                temp = 1;
                int MIN = min(storage[process[1]], min(storage[process[2]], storage[process[3]]));
                for (int k = 1; k < 4; k++)
                {
                    if (storage[process[k]] == MIN)
                    {
                        memory[process[k]] = 0;
                        process[k] = page[i];
                        storage[process[k]] = i;
                    }
                }
                memory[page[i]] = 1;
            }
            if (memory[page[i]] == 1)
            {
                for (int k = 1; k < 4; k++)
                {
                    if (process[k] == page[i])
                    {
                        storage[process[k]] = i;
                    }
                }
            }
        }
        if (j < 4)
        {
            if (memory[page[i]] == 0)
            {
                temp = 1;
                process[j] = page[i];
                memory[page[i]] = 1;
                storage[process[j]] = i;
                j++;
            }
        }
        if (temp == 1)
        {
            for (int i = 1; i < 4; i++)
                printf("%d ", process[i]);
            cout << "     ";
            for (int k = 0; k < 10; k++)
                cout << memory[k] << " ";
        }
        cout << endl;
    }
}

void judge(int a)
{
    if (a == 1)
        Opt();
    if (a == 2)
        FIFO();
    if (a == 3)
        LRU();
}



int main(void)
{
    for (int i = 1; i <= 20; i++)
        scanf("%d", &page[i]);
    int m;
    scanf("%d", &m);
    judge(m);
}