Computers and Technology, 12.12.2019 02:31 chelsea1524
Apage-replacement algorithm should minimize the number of page faults. we can achieve this minimization by distributing heavily used pages evenly over all of memory, rather than having them compete for a small number of page frames. we can associate with each page frame a counter of the number of pages associated with that frame. then, to replace a page, we can search for the page frame wit the smallest counter.
define a page-replacement algorithm using this basic idea. specifically address these problems:
i. what is the initial value of the counters.
ii. when are counters increased
iii. when are counters decreased
iv. how is the page to be replaced selected?
b. how many pages faults occur for your algorithm for the following reference string with four page frames?
1,2,3,4,5,3,4,1,6,7,8,7,8,9,7,8,9,5 ,4,5,4,2
Answers: 2
Computers and Technology, 21.06.2019 16:00
A(n) is a small bit of text separated from the rest of the paragraph at the top of a column or page.
Answers: 2
Computers and Technology, 22.06.2019 15:30
When creating a budget, log fixed expenses before income. after income. after savings. at the top.
Answers: 1
Computers and Technology, 22.06.2019 16:30
Which of the following statements best describes it careers?
Answers: 2
Computers and Technology, 24.06.2019 06:30
Me and category do i put them in because this is science
Answers: 1
Apage-replacement algorithm should minimize the number of page faults. we can achieve this minimizat...
Chemistry, 01.05.2021 04:40
Mathematics, 01.05.2021 04:40
Geography, 01.05.2021 04:40
History, 01.05.2021 04:40
Mathematics, 01.05.2021 04:40
Mathematics, 01.05.2021 04:40
Mathematics, 01.05.2021 04:40
Physics, 01.05.2021 04:40
Mathematics, 01.05.2021 04:40