a page-replacement algorithm should minimize the number of page

Project Description:

a page-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 with the smallest counter._br_a. define a page-replacement algorithm using this basic idea. specifically address these problems: _br_i. what is the initial value of the counters? _br_ii. when are counters increased? _br_iii. when are counters decreased? _br_iv. how is the page to be replaced selected?_br_b. how many page faults occur for your algorithm for the following reference string with four page frames? _br_1, 2, 3, 4, 5, 3, 4, 1, 6, 7, 8, 7, 8, 9, 7, 8, 9, 5, 4, 5, 4, 2._br_c. what is the minimum number of page faults for an optimal page­ replacement strategy for the reference string in part b with four page frames?_br__br_
Skills Required:
Project Stats:

Price Type: Negotiable

Expired
Total Proposals: 6
1 Current viewersl
47 Total views
Project posted by:

Proposals

Proposals Reputation Price offered
  • 4.8
    546 Jobs 386 Reviews
    $12 in 0 Day
  • 4.5
    355 Jobs 236 Reviews
    $0 in 0 Day
  • 4.8
    60 Jobs 32 Reviews
    $0 in 0 Day
  • 4.7
    32 Jobs 9 Reviews
    $0 in 0 Day
  • 0.0
    4 Jobs 0 Reviews
    $35 in 0 Day