Question

3. Assume a virtual memory system with the following properties: • The physical memory available to an application consists o

0 0
Add a comment Improve this question Transcribed image text
Answer #1


@ 02413502413.5024 FIFO 02 12,1315lol 12 221255 10 33 334 114422 44/4000 x whern whoto Anone x x x x x x {age Roux Total No.to No vun A012141 212) 4113151 sssssss 19 4 4 4 4 3 313. 222 222 2222112 010101010000000 o page status; x x x x x x x x Torelolila 0 11 01412101430410 TTT 1331314144 SSS 1212121212121212121212 TUL ololooooo001010 010 x x x x x x total page fault = FIMIN Coptimal ole12131112 1121313 SerNw w xels amants - 1 121 olololol4 4 7 4 4 Tom X X X X stofus. Trofal page fault=1

Add a comment
Know the answer?
Add Answer to:
3. Assume a virtual memory system with the following properties: • The physical memory available to...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Consider the following virtual page reference sequence: page 1, 2, 3, 4, 2, 1, 5, 6,...

    Consider the following virtual page reference sequence: page 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3. This indicates that these particular pages need to be accessed by the computer in the order shown. Consider each of the following 4 algorithm-frame combinations: LRU with 3 frames FIFO with 3 frames LRU with 4 frames FIFO with 4 frames . For each of the 4 combinations, below, move from left to right as the virtual page numbers are...

  • Answer the following questions based on the Memory Management tasks of an Operating System. 5 Consider...

    Answer the following questions based on the Memory Management tasks of an Operating System. 5 Consider the following sequence of page references: 5, 6, 7, 6, 8, 7, 9, 5, 9, 6, 8, 9 Assuming that all frames are initially empty, indicate the contents of memory after each reference, and how many page faults are found for each of the following page replacement algorithms: First In First Out (FIFO):                                   [2 .5 M]                                               Reference String 5 6 7 6 8 7...

  • Implement the frame replacement algorithm for virtual memory Assume a computer system have 10 memory frames available inside the physical memory and is required to execute a process containing 20 pa...

    Implement the frame replacement algorithm for virtual memory Assume a computer system have 10 memory frames available inside the physical memory and is required to execute a process containing 20 pages. Assume a process P has been executed in the system and produced a sequence of 40 page demands as follows: Page demands trace of process P Demand 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 cont. Page...

  • Consider the following page reference string for a three-frame memory: 6 3 1 5 3 4...

    Consider the following page reference string for a three-frame memory: 6 3 1 5 3 4 3 2 5 4 3 4 5 1 5 3 1 6 3 1 Apply LRU, Clock and FIFO algorithms What will be the number of page faults for each replacement algorithm note that page faults at the beginning are counted?

  • Name Olbinna COSC414/514 Quiz3 (1) Suppose a computer has 4 physical pages, and a process referen...

    Name Olbinna COSC414/514 Quiz3 (1) Suppose a computer has 4 physical pages, and a process references its virtual pages (page o through page 7) in the following order: 021354637473355311172341 Also suppose the first four pages have been loaded in the physical memory as the following figure: Frame 0 Frame 1 Frame 2 Frame 3 a. Suppose the kernel uses First-In-First-Out (FIFO) page replacement algorithm. How many page faults would the process have? Which page references are page faults? b. Suppose...

  • Operating Systems Virtual Memory Management question Given the reference string of page accesses below, and an...

    Operating Systems Virtual Memory Management question Given the reference string of page accesses below, and an allocation of 3 page frames, and the Least-Frequently Used page replacement algorithm. Show the content of the frames as the references are processed, and indicate which references cause page faults. Record the #page faults. ref 1 2 3 5 4 2 5 3 4 5 1 1 3 1 4 frame1 frame2 frame3 fault(X) #faults =

  • Problem 6 (13 points) The page table below is for a system with 16-bit virtual as well as physica...

    Problem 6 (13 points) The page table below is for a system with 16-bit virtual as well as physical addresses and with 4,096-byte pages. The reference bit is set to 1 when the page has been referenced. Periodically, a thread zeroes out all values of the reference bit. A dash for a page frame indicates the page is not in memory. The LRll pagg-replacement algorithm is used. The numbers are given in decimal Page Frame eferepceit 14 10 13 15...

  • Which of the following about virtual memory is not true? A) Virtual memory needs paging hardware...

    Which of the following about virtual memory is not true? A) Virtual memory needs paging hardware B)Virtual Memory uses storage device to extend the physical main memory C)The optimal replacement strategy is the most practical strategy D)Multiple process can share pages What should we do when having a page fault (Multiple answers)? A)Skip the machine instruction causing the page fault. B)Update the page table after loading the missing page C) Switch to a process that does not have page faults...

  • 3. Virtual Memory (20 points) An ISA supports an 8 bit, byte-addressable virtual address space. The...

    3. Virtual Memory (20 points) An ISA supports an 8 bit, byte-addressable virtual address space. The corresponding physical memory has only 256 bytes. Each page contains 32 bytes. A simple, one-level translation scheme is used and the page table resides in physical memory. The initial contents of the frames of physical memory are shown below. VALUE address size 8 bit byte addressable each byte of addressing type memory has its own address 32 B page size physical memory size 256...

  • Question 7 30 pts Consider the following page reference string: {1,2,3,4,1,5,6,2,1,2,3,7,6,3} Assume that the system has...

    Question 7 30 pts Consider the following page reference string: {1,2,3,4,1,5,6,2,1,2,3,7,6,3} Assume that the system has 4 page frames allocated to these 7 pages. Follow the page placement and replacement using the following three replacement algorithms: • LRU replacement • FIFO replacement • Optimal replacement How many page faults will occur for these three algorithms? Assume that all frames are initially empty, so your first unique pages will all cost one fault each USE ENCLOSED TABLES! Show all calculations in...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT