C语言中的最佳页面替换算法

Here you will get program for optimal page replacement algorithm in C.

在这里，您将获得C中最佳页面替换算法的程序。

Optimal page replacement algorithm says that if page fault occurs then that page should be removed that will not be used for maximum time in future.

最佳页面替换算法表示，如果发生页面错误，则应删除该页面，该页面将不会在未来的最大时间内使用。

It is also known as clairvoyant replacement algorithm or Bélády’s optimal page replacement policy.

它也被称为透视替换算法或Bélády的最佳页面替换策略。

Also Read: LRU Page Replacement Algorithm in C

另请参见：C语言中的LRU页面替换算法

Video Tutorial

影片教学

Below program shows how to implement this algorithm in C.

下面的程序显示了如何在C中实现此算法。

C中最佳页面替换算法的程序 (Program for Optimal Page Replacement Algorithm in C)

#include<stdio.h>
  
 int main()
 {
     int no_of_frames, no_of_pages, frames[10], pages[30], temp[10], flag1, flag2, flag3, i, j, k, pos, max, faults = 0;
     printf("Enter number of frames: ");
     scanf("%d", &no_of_frames);
     
     printf("Enter number of pages: ");
     scanf("%d", &no_of_pages);
     
     printf("Enter page reference string: ");
     
     for(i = 0; i < no_of_pages; ++i){
         scanf("%d", &pages[i]);
     }
     
     for(i = 0; i < no_of_frames; ++i){
         frames[i] = -1;
     }
     
     for(i = 0; i < no_of_pages; ++i){
         flag1 = flag2 = 0;
         
         for(j = 0; j < no_of_frames; ++j){
             if(frames[j] == pages[i]){
                    flag1 = flag2 = 1;
                    break;
                }
         }
         
         if(flag1 == 0){
             for(j = 0; j < no_of_frames; ++j){
                 if(frames[j] == -1){
                     faults++;
                     frames[j] = pages[i];
                     flag2 = 1;
                     break;
                 }
             }    
         }
         
         if(flag2 == 0){
         	flag3 =0;
         	
             for(j = 0; j < no_of_frames; ++j){
             	temp[j] = -1;
             	
             	for(k = i + 1; k < no_of_pages; ++k){
             		if(frames[j] == pages[k]){
             			temp[j] = k;
             			break;
             		}
             	}
             }
             
             for(j = 0; j < no_of_frames; ++j){
             	if(temp[j] == -1){
             		pos = j;
             		flag3 = 1;
             		break;
             	}
             }
             
             if(flag3 ==0){
             	max = temp[0];
             	pos = 0;
             	
             	for(j = 1; j < no_of_frames; ++j){
             		if(temp[j] > max){
             			max = temp[j];
             			pos = j;
             		}
             	}            	
             }
 			
 			frames[pos] = pages[i];
 			faults++;
         }
         
         printf("\n");
         
         for(j = 0; j < no_of_frames; ++j){
             printf("%d\t", frames[j]);
         }
     }
     
     printf("\n\nTotal Page Faults = %d", faults);
     
     return 0;
 }

Output

输出量

Enter number of frames: 3 Enter number of pages: 10 Enter page reference string: 2 3 4 2 1 3 7 5 4 3

输入帧数：3 输入页数：10 输入页面参考字符串：2 3 4 2 1 3 7 5 4 3

2 -1 -1 2 3 -1 2 3 4 2 3 4 1 3 4 1 3 4 7 3 4 5 3 4 5 3 4 5 3 4

2 -1 -1 2 3 -1 2 3 4 2 3 4 1 3 4 1 3 4 7 3 4 5 3 4 5 3 4 5 3 4

Comment below if you have doubts or found anything incorrect in above optimal page replacement algorithm in C.

如果您对以上C语言中的最佳页面替换算法有疑问或发现任何错误，请在下面评论。

翻译自: https://www.thecrazyprogrammer.com/2016/11/optimal-page-replacement-algorithm-c.html