发布竞赛

Page Replacement Algorithms and Evaluation

状态: Closed
奖金: $50
参赛作品已收到: 2
获胜者: sudip20simkhada

Winner

竞赛简介

We need to recover the algorithms in python
1. Reference string: 1~1,200
2. Number of memory references: At least 300,000 times
3. Number of frames in the physical memory: 30, 60, 90, 120, 150
4. Three test reference strings:
(1) Random: Arbitrarily pick [1, 20] continuous numbers for each reference.
(2) Locality: Simulate procedure calls. Each procedure may refer a subset of 1/300~1/120
string (the length of string can be random)..
5. You can use both reference and dirty bits
implement Four algorithms for comparison:
(1) FIFO algorithm
(2) Optimal algorithm
(3) Additional-reference-bits algorithm
(4) Develop own algorithm
All algorithm need to print as below:
page fault
interrupts
disk writes