Question

A page daemon in an operating system will swap out memory even if some memory is...

A page daemon in an operating system will swap out memory even if some memory is still available. Will it do this when the amount of available memory is -- above (a), or below (b) -- the low watermark?

What do you call the piece of OS software that is run when it is discovered that a page of memory is on disk, and not in memory? a) the overlay, b) the background process, or c) the page-fault handler.

Swapping takes advantage of a ‘present bit’ to decide whether a page is in memory or in the swap space on disk. Where is the present bit? a) in the page table, b) in the process control block, or c) in the translation lookaside buffer.

In an 80/20 workload, which of these page replacement policies tends to work the best: a) random, b) FIFO, or c) LRU ?

Using the LRU replacement policy, fill in the blanks in the table below. The cache size is 3.

                access        hit?                evict                resulting cache

                  0                no                 -                0

                  1                no                 -                0,1

                  1                yes                 -                0,1

                  2                no                 -                0,1,2

                  0                yes                 -                1,2,0

                  3                no                1                2,0,3

                  1                ____                ____                ____

                  0                ____                ____                ____

                  2                ____                ____                ____

Using the FIFO replacement policy, fill in the blanks in the table below. The cache size is 3.

                access                hit?                evict                resulting cache

                  0                no                 -                0

                  1                no                 -                0,1

                  1                yes                 -                0,1

                  2                no                 -                0,1,2

                  0                yes                 -                0,1,2

                  3                no                0                1,2,3

                  1                ____                ____                ____

                  0                ____                ____                ____

                  2                ____                ____                ____

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

alow 2 0.966 ty 112r 12 ín Thecda of P

Add a comment
Know the answer?
Add Answer to:
A page daemon in an operating system will swap out memory even if some memory is...
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 system: Byte addressable 16-bit addresses 256B pages Single level Page Table System The...

    Consider the following system: Byte addressable 16-bit addresses 256B pages Single level Page Table System The system utilizes a fully-associative TLB with 4 entries and an LRU replacement policy. Given the access pattern and timings below, complete the following table. Assume the TLB begins initially empty and the cache is physically addressed NOTE: Access times are not inclusive and components are accessed sequentially. Time to update the TLB is negligible, everything else that needs to be updated will require a...

  • Assume you have: 32-bit addresses, 4KB Page size, 4MB Physical Memory Space, 4KB Cache with 4-way...

    Assume you have: 32-bit addresses, 4KB Page size, 4MB Physical Memory Space, 4KB Cache with 4-way set associative and LRU replacement, 32 Byte Cache block size, 4-entry fully associative TLB. A program to be run on this machine begins as follows:   double A[1024]; int i, j; double sum = 0; for( i = 0; i < 1024; i++ )       // first loop      A[i] = i; for( j = 0; j < 1024; j += 16 )   // second loop     ...

  • Please answer the following questions about paged memory... A) How much space needs to be allocated...

    Please answer the following questions about paged memory... A) How much space needs to be allocated in the minimum and maximum cases for a two-level page table for a machine with a 32-bit virtual memory address, a 1K page size, and which has four times as many inner pages as outer pages? Assume any stored page table value requires 32 bits. B) For the two-level paging approach above, if a Translation Lookaside Buffer (TLB) is used and can cache both...

  • Question 9 Which of the following statements is true about memory system? Put the answer in...

    Question 9 Which of the following statements is true about memory system? Put the answer in the box. A. Cache memories are usually built by SRAMs, which have higher density and faster access speed than DRAM-based main memories. B. Secondary storages such as hard disk drive and solid-state drive are typically volatile memories. C. Compared to the associative cache mapping function, direct mapping function has more flexibility. D. Due to locality of reference, the basic transfer unit between cache and...

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

    3. Assume a virtual memory system with the following properties: • The physical memory available to an application consists of four-page frames, with frame numbers 0, 1, 2, and 3. The application has six pages of data in its virtual address space, using page numbers 0, 1, 2, 3, 4, and 5. Build a table showing which frame is used to bring in each page for the following sequences of page references using FIFO, MIN, and LRU as page replacement...

  • Given that main memory is composed of four page frames for public use, use the following...

    Given that main memory is composed of four page frames for public use, use the following table to answer all parts of this problem: Page Frame   Time When Loaded Time When Last Referenced Referenced BIT      Modified BIT 0 09 307 0 0 1 17 362 1 0 2 10 294 0 1 3 160 369 1 1 The contents of which page frame would be swapped out by FIFO? The contents of which page frame would be swapped out by...

  • Consider a hypothetical machine with 1K words of cache memory. They are iin direct-mapped organiz...

    Consider a hypothetical machine with 1K words of cache memory. They are iin direct-mapped organization, with cache block size of 128 words, using LRU replacement algorithm. Suppose the cache hit time is 8ns, the time to transfer the first word from main memory to cache is 50ns, while subsequent words require 10ns/word. Consider the following read pattern (in blocks of 128 words, and block id starts from 0): 1 2 3 5 6 2 3 4 9 10 11 6...

  • As described in 5.7, virtual memory uses a page table to track the mapping of virtual...

    As described in 5.7, virtual memory uses a page table to track the mapping of virtual addresses to the physical addresses. This exercise shows how this table must be updated as addresses are accessed. The following data constitutes a stream of virtual addresses as seen on a system. Assume 4 KiB pages, a 4-entry fully associative TLB, and true LRU replacement. If pages must be brought in from disk, increment the next largest page number. 4669, 2227, 13916, 34587, 48870,...

  • Operating Systems Questions (Please help if you can) 1. A computer has cache, main memory, and...

    Operating Systems Questions (Please help if you can) 1. A computer has cache, main memory, and a disk used for virtual memory. If a referenced word is in the cache, 20ns are required to access it. If it is in main memory but not in the cache, 60ns are required to load it into the cache (this includes the time to originally check the cache), and then, the reference is started again. If the word is not in main memory,...

  • 1. (4 pt) Circle True or False. Each is 2 pts. t Recently Used (LRU) replacement...

    1. (4 pt) Circle True or False. Each is 2 pts. t Recently Used (LRU) replacement policy generates better miss penalty than FIFO for fully- associative caches ngger b me rna 2. (8 pt) Find the Average Memory Access Time (AMAT) for a machine with following configuration: The machine has the hit rate of 95% with the hit time of 2 ns. A miss costs 30 ns to fetch the desired ume that the read and write miss penalties are...

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