A process contains eight virtual pages on disk and is assigned a fixed allocation of four page frames in main memory. The following page trace occurs: 1,0, 2, 2, 1, 7, 6, 7, 0, 1, 2, 0, 3, 0, 4, 5, 1, 5, 2, 4, 5, 6, 7, 6, 7, 2, 4, 2, 7, 3, 3, 2, 3 a. Show the successive pages residing in the four frames using the LRU replacement policy. Compute the hit ratio in main memory. Assume that the frames are initially empty. b. Repeat part (a) for the FIFO replacement policy. c. Compare the two hit ratios and comment on the effectiveness of using FIFO to approximate LRU with respect to this particular trace.

A process contains eight virtual pages on disk and is assigned a fixed allocation of four page frames in main memory. The following page trace occurs: 1,0, 2, 2, 1, 7, 6, 7, 0, 1, 2, 0, 3, 0, 4, 5, 1, 5, 2, 4, 5, 6, 7, 6, 7, 2, 4, 2, 7, 3, 3, 2, 3 a. Show the successive pages residing in the four frames using the LRU replacement policy. Compute the hit ratio in main memory. Assume that the frames are initially empty. b. Repeat part (a) for the FIFO replacement policy. c. Compare the two hit ratios and comment on the effectiveness of using FIFO to approximate LRU with respect to this particular trace.

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Q: Suppose a byte-addressable memory with 4 frames of size 32 bytes each and a paged virtual memory…

A: I will explain it in details,

Q: Suppose a computer using direct mapped cache has 4M byte of byte-addressable main memory, and a…

A: Computer memory is a device that stores data and allows us to retrieve it when needed. Primary…

Q: Assume that there are two types of memories: the smaller, more expensive, faster memories and the…

A: Given: T1 (time to access faster memory) = 0.1us T2 (time to access slower memory) = 1us The time…

Q: A computer system has 6 page frames. The table below shows the time of loading, the time of last…

A: Understanding Page ReplacementPurpose: When a program needs a page that's not currently in the main…

Q: Consider a disk that rotates at 3600 rpm. The seek time to move the head between ad- jacent tracks…

A: Given data, Disk rotation speed: 3600rpm Seek time: 2ms Sectors per track: 32 Read/write…

Q: A computer system with paging-based memory management, whose architecture allows for a 4GB virtual…

A: According to the information provided in the initial question, we must determine the amount of space…

Q: tes are stored in memory locations from 8050h to 805Fh. Write 8085 ALP to transfer the the locations…

Q: Suppose your system has a memory of size 100 MB using contiguous memory allocations and there are 4…

A: we are using ASCII code for size of process we are taking s = 115 u = 117 f = 102 y = 121 a = 97…

Q: Suppose we have a 16-bit main memory address and 32 blocks of cache memory accessible on a…

A: Organisation of virtual memory: The RAM and caches that make up the memory hierarchy in modern…

Q: Consider a system with N bytes of physical RAM, and M bytes of virtual address and frames are K…

A: Here the virtual memory size = M bytes And page size is K bytes. The virtual address is divided…

Q: Show at what points in time page replacements occur, and which pages are evicted, using the…

Q: mplements a E The maximu ах

A: 1>virtual address=1524 To get virtual page number, we perform integer division by pagesize,…

Q: A process contains 8 virtual pages on the disk, and is assigned a fixed allocation of 4 page frames…

Q: For a 100-cylinder disk, compute the total number of head movements for the request queue provided…

A: In FCFS, the request which arrives first will we served first.

Q: Suppose that an MMU has page table entries like the ones shown at right (formatted as in the slides…

A: The solution of the above question is:

Q: Consider a program that accesses a single I/O device and compare unbuffered I/O to the use of a…

Q: A machine has a memory of 64 frames, with each frame being 1K bytes. Current free-frame list is:…

Q: Translate the following virtual addresses to physical addresses, and show how you obtain the…

A: - We need to get the physical address for the virtual addresses provided.

Q: Suppose a process page table contains the entries shown below. Using the format shown in Figure…

A: A process is the case of a PC program that is being executed by one or numerous strings. It contains…

Question

8.6. A process contains eight virtual pages on disk and is assigned a fixed allocation of
four page frames in main memory. The following page trace occurs:
1, 0, 2, 2, 1, 7, 6, 7, 0, 1, 2, 0, 3, 0, 4, 5, 1, 5, 2, 4, 5, 6, 7, 6, 7, 2, 4, 2, 7, 3, 3, 2, 3
a. Show the successive pages residing in the four frames using the LRU replacement
policy. Compute the hit ratio in main memory. Assume that the frames are initially
empty.
b. Repeat part (a) for the FIFO replacement policy.
c.
Compare the two hit ratios and comment on the effectiveness of using FIFO to
approximate LRU with respect to this particular trace.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step 3

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Similar questions

Given a computer using a byte-addressable virtual memory system with a two-entry TLB, a 2-way set associative cache, and a page table for a process P. Assume cache blocks of size 8 bytes. Assume pages of size 16 bytes and a main memory of 4 frames. Assume the following TLB and page table for Process P: TLB 0 Vali d 0 1 1 1 2 0 3 1 4 1 5 0 6 0 7 0 Assume process P generates a memory request with virtual address Ox12. What is its corresponding physical address? You may represent the address in binary or hexadecimal notation. 3 3 0 2 1 4 Page Table f 1
Giventhe following assignment of some program’s virtual pages to physical pages in a system with 4 KiB byte pages, what physical memory address corresponds to virtual address 20000? (All values are given in decimal.)
Suppose a byte-addressable memory with 4 frames of size 8 bytes each and a paged virtual memory using a three-entry TLB. Suppose a process P has 8 pages of virtual memory space. Assume the following TLB and page table for process P: TLB Page Framell Framet Valid 1. 12 1. Page Table Assume process P generates a memory request with virtual address 0X3A. What is its corresponding physical address? You may represent the address in binary or hexadecimal notation (if hexadecimal notation, prefix with Ox). If the request causes a page fault, enter page fault.
Consider a demand-paging system with a paging disk that has an average access/transfer time of 50 ms. Addresses are translated through a page table in main memory, with an access time of 500 ns per memory access. Thus, each memory reference through the page table takes two accesses. To improve this time, we have added a TLB that reduces access time to one memory reference if the page-table entry is in the TLB. Assume that 80% of the accesses are in the TLB and that, of those remaining, 15% (or 3% of the total) cause page faults. We assume that the TLB access time is 20 ns. What is the effective access time?