-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathLeast_Recently_Used_Page_Replacement.java
82 lines (76 loc) · 1.82 KB
/
Least_Recently_Used_Page_Replacement.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
import java.util.*;
class Least_Recently_Used {
int p[], n, fr[], m, fs[], index, k, l, flag_1 = 0, flag_2 = 0, page_faults = 0, frame_size = 3, i, j;
Scanner sc = new Scanner(System.in);
void read() {
System.out.println("Enter page table size : ");
n = sc.nextInt();
p = new int[n];
System.out.println("Enter the Reference String : ");
for(int i = 0; i < n; i++)
p[i] = sc.nextInt();
System.out.println("Enter the Number of frames : ");
m = sc.nextInt();
fr = new int[m];
fs = new int[m];
}
void display() {
System.out.println("\n");
for(i = 0; i < m; i++) {
if(fr[i] == -1)
System.out.println("[ ]");
else
System.out.println("[" + fr[i] + "]");
}
}
void lru() {
for(i = 0; i < m; i++) {
fr[i] =- 1;
}
for(j = 0; j < n; j++){
flag_1 = 0;
flag_2 = 0;
for(i = 0; i < m; i++){
if(fr[i] == p[j]) {
flag_1 = 1;
flag_2 = 1;
break;
}
}
if(flag_1 == 0){
for(i = 0; i < m; i++){
if(fr[i] == -1){
fr[i] = p[j];
flag_2 = 1;
break;
}
}
}
if(flag_2 == 0){
for(i = 0; i < 3; i++)
fs[i] = 0;
for(k = j - 1, l = 1; l <= frame_size - 1; l++, k--){
for(i = 0; i < 3; i++){
if(fr[i] == p[k])
fs[i] = 1;
}
}
for(i = 0; i < 3; i++){
if(fs[i] == 0)
index = i;
}
fr[index] = p[j];
page_faults++;
}
System.out.print("Page : " + p[j]);
display();
}
System.out.println("\n Number of page faults : " + page_faults);
}
public static void main(String args[]){
Least_Recently_Used a = new Least_Recently_Used();
a.read();
a.lru();
a.display();
}
}