The world’s Largest Sharp Brain Virtual Experts Marketplace Just a click Away
Levels Tought:
Elementary,Middle School,High School,College,University,PHD
| Teaching Since: | Jul 2017 |
| Last Sign in: | 304 Weeks Ago, 1 Day Ago |
| Questions Answered: | 15833 |
| Tutorials Posted: | 15827 |
MBA,PHD, Juris Doctor
Strayer,Devery,Harvard University
Mar-1995 - Mar-2002
Manager Planning
WalMart
Mar-2001 - Feb-2009
I have this question on my homework. I have no idea where to begin. any help would be appreciated.
Â
5. A process has a memory reference pattern as follows:Â Â Â
Â
1 3 1 2 3 4 2 3 1 2 3 4
The above pattern (which represents the virtual page numbers of the process) repeats
throughout the execution of the process. Assume that there are 3 physical frames.
Show the paging activity for a True LRU page replacement policy. Show an LRU
stack and the page that is replaced (if any) for the first 12 accesses. Clearly indicate
which accesses are hits and which are page faults.
Â
Solution:
Â
----------- Â ----------- H-----------ell-----------o S-----------ir/-----------Mad-----------am ----------- Th-----------ank----------- yo-----------u f-----------or -----------you-----------r i-----------nte-----------res-----------t a-----------nd -----------buy-----------ing----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n. -----------Ple-----------ase----------- pi-----------ng -----------me -----------on -----------cha-----------t I----------- am----------- on-----------lin-----------e o-----------r i-----------nbo-----------x m-----------e a----------- me-----------ssa-----------ge -----------I w-----------ill----------- be----------- qu-----------ick-----------ly