i. Consider the free memory layout shown below (the blocks are ordered from top to bottom). Draw to what the free memory layouts would be after satisfying requests for (in order) memory blocks of sizes 187KB, 329KB, 486KB, 407KB and 285KB. 445K 250K 395K 600K 290K 325K 355K a. Draw one memory layout for the Best-fit and Worst-fit. b. Which algorithm makes the efficient use of the memory? Why c. Is there any kind of fragmentation? ii. Given the following stream of page references by an application, calculate the number of page faults the application would incur with the following page replacement algorithms. Assume that all pages are initially free. Reference Stream: D A B FA E A E F DAB C A C F B AFDA BF A E Pages = 4 a. LRU page replacement. b. OPT page replacement.

i. Consider the free memory layout shown below (the blocks are ordered from top to bottom). Draw to what the free memory layouts would be after satisfying requests for (in order) memory blocks of sizes 187KB, 329KB, 486KB, 407KB and 285KB. 445K 250K 395K 600K 290K 325K 355K a. Draw one memory layout for the Best-fit and Worst-fit. b. Which algorithm makes the efficient use of the memory? Why c. Is there any kind of fragmentation? ii. Given the following stream of page references by an application, calculate the number of page faults the application would incur with the following page replacement algorithms. Assume that all pages are initially free. Reference Stream: D A B FA E A E F DAB C A C F B AFDA BF A E Pages = 4 a. LRU page replacement. b. OPT page replacement.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

draw memory page table for virtual memory for memory space 32K address space 1024 K with size of page 1K
Consider the RAM16X8 of SAP-1 whose contents are given (in hexadecimal) as following. Address (Hex) 8-bit Contents (In Hex) 0x0 0x0A 0x1 0x1B 0x2 0x1C 0x3 0x1D 0x4 0x2E 0x5 0x2F 0x6 0xCF 0x7 0xFF 0x8 0x00 0x9 0x01 0xA 0x07 0xB 0x01 0xC 0x02 0xD 0x02 0xE 0x01 0xF 0x01 Let's consider the first 8 memory locations are reserved for Instructions and remaining memory locations contain data operands. You are requested to present in Binary and Hexadecimal, the output of the program stored in memory.
Given six memory partitions of 250 KB, 60 KB, 115 KB, 300 KB, 460 KB and 570KB (in order). How would the first-fit, best-fit and worst-fit algorithms place process of size 300 KB? Select one: a. 300 KB, 460 KB, 570 KB b.300 KB, 300 KB, 570 KB c.250 KB + 50 KB from 60 KB, 300 KB, 570 KB d.250 KB + 50 KB from 60 KB, 300 KB, 460 KB
Design the memory mapping between the Cache memory of 512 MB to the mainmemory of 4 GB using 4 way set associative method where the block size is of 1 MB.Consider each memory location is byte addressable.
Create a memory mapping from the cache memory of 512 MB to the main memory of 4 GB using the four-way set associative approach with a block size of 1 MB. Consider that each memory location may be accessed using a byte address.
Suppose a byte-addressable computer using set-associative cache has 216 bytes of main memory and a cache of 32 blocks, and each cache block contains 8 bytes.Q.) If this cache is 2-way set associative, what is the format of a memory address as seen by the cache; that is, what are the sizes of the tag, set, and offset fields?
Suppose we have a 16-bit main memory address and 32 blocks of cache memory accessible on a byte-addressable computer using 2-way set associative mapping. Display your results after calculating the offset field size based on the fact that each block contains 8 bytes.
Given five memory partitions of 150Kb,550Kb,250Kb,350Kb,600Kb(inorder),how would the first-fit,best-fit,and worst-fit algorithm splace processes of 202Kb,427Kb,122Kb,and426Kb(inorder)?
Let's pretend for a moment that we have a byte-addressable computer with 16-bit main memory addresses and 32-bit cache memory blocks, and that it employs two-way set associative mapping. Knowing that each block has eight bytes, please calculate the size of the offset field and provide evidence of your calculations.
Given that a 4-way set associative cache memory has 64 KB data and each block contains 32 bytes. The main memory capacity is 4 GB. a. Find the number of bits for the main memory address. ANSWER: b. How many blocks are there in a set? ANSWER: c. How many sets the cache has? ANSWER: d. The main memory address format is => | Tag: bits | blocks sets bits | Set: e. Which set will be mapped by the main memory address 458195h. ANSWER: decimal) bits bits | Word: (in
Question 18 Suppose we have a byte-addressable computer using 2-way set associative mapping with 16-bit main memory addresses and 32 blocks of cache. Suppose also that each block contains 8 bytes. The size of the block offset field is bits, the bits. size of the set field is bits, and the size of the tag hield is
Suppose we have a byte-addressable computer using fully associative mapping with 16-bit main memory addresses and 32 blocks of cache. Supposed also that each block contains 16 bytes. The size of the offset field is 19 bits and the size of the block field is 0.625 bytes.