Consider a swapping system in which memory consists of the following hole sizes in memory order: 10 MB, 4 MB, 20 MB, 18 MB, 7 MB, 9 MB, 12 MB and 15 MB. Which hole is taken for successive segment requests of (i) 12 MB (ii) 10 MB (iii) 9 MB for first fit? Now repeat the question for best fit and worse fit.

Consider a swapping system in which memory consists of the following hole sizes in memory order: 10 MB, 4 MB, 20 MB, 18 MB, 7 MB, 9 MB, 12 MB and 15 MB. Which hole is taken for successive segment requests of (i) 12 MB (ii) 10 MB (iii) 9 MB for first fit? Now repeat the question for best fit and worse fit.

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

With drawing Design a machine with a byte addressable main memory of 2¹6 bytes and block size of 8 byte. Assume that an associative mapping cache memory consisting of 32 lines is used with this machin. a- Show the format of cache memory addresser. b- Find tag, and word for the address (0001 0001 0001 1011) using an associative mapping.
Use Keil ARM assembly to check whether an N × N matrix is a magic square. A magic square is an N × N matrix in which the sums of all rows, column, and the two diagonals add up to N (N2 + 1)/2. All matrix entries are unique numbers from 1 to N2. Register r1 will hold N. The matrix starts at location 0x20000010 (Base address) and ends at location (Base address + N2). It is assumed that all numbers are bytes, consider the 4-byte size of integers.Use the included picture The numbers 16, 3, 2, 13 will be stored at first four addresses, respectively. The numbers 5, 10, 11, and 8 would be stored at next four addresses, etc. If the matrix is a magic square, register r8 will be set (R8 should have a value 1) upon completion; otherwise, it will be cleared to 0. Please don't make it too complicated, if you can, I want to learn what I am writing down, if possible. Thank you!
Partial Question 12 Fill in multiple blanks. Consider the snapshot of this memory starting from the top cell at Address 1E1AH. 10011000 00010101 11011010 10100000 11000111 01010101 When performing a read of the 4th cell from the top (the first cell is at Address 1E1AH): 1) The Read Data input must be set to 110110101 2) The Write Data input must be set to 10011000 3) The Address bus must be set to 11000111 In response, the memory will output on the 00010101 bus the binary number 10100000 corresponding to the hexadecimal number 01010101 h. Answer 1:
Q: Assume a swapping system in which memory consists of the following hole sizes in memory and in order of 12K, 16K, 8K, 10K, 22K, 8K, 11K, 14K, and 13K. Which memory hole is taken for successive segment requests of(a) 7K(b) 30K(c) 20K(d) 6k(e) 2kfor first fit, best fit, worst fit, and next fit.
Consider a DRAM chip of capacity 256 KB and each memory location contains 8 bits. The memory chip is organized in matrix form with equal number of rows and column for each memory location of 8 bits. This DRAM chip has a refresh interval of 64 ms, memory bus runs at 200 MHz, and the refresh cycle takes 4 clock cycle. a) Time required to refresh the DRAM chip. b) What is the minimum size of the refresh counter?
Q4 consider a computer with the following characteristics: total of 4 MB of a byte-addressable- main memory; block size of 64 bytes; and cache size of 256 kB. O a. For the main memory addresses of D0005, 512C7, and 7BAAA, give the O corresponding tag, cache line address, and word offsets for a direct-mapped cache. b. Give any two main memory addresses with different tags that map to the same cache slot for a direct-mapped cache.
a) In the SRAM region, what is the corresponding bit-band alias address for the bit [4] of the memory address of 0 * 2000008 b) In the Peripheral region, if the value in the alias address 0 * 4200 0088 to 0 * 4200 008B was set to 0x00000001, what is the bit # and the address in the peripheral region that wants to set to 1?
Consider we have two levels of cache, backed by a main memory (RAM). You are given with the following information about the access time for different level in the memory hierarchy L1 cache costs 1 cycle to access and has a miss rate of 8% L2 cache costs additional 5 cycles to access and has a miss rate of 4% RAM costs additional 40 cycles to access (and has a miss rate of 0%) What is the average memory access time (AMAT)?
For a system, RAM - 64KB, Block size - 4 bytes, Cache size - 128 bytes, Direct mapped cache. Function NSU-1 Calculate the Hit ratio while CPU runs program "Test_Cache". Also count how many blocks are replaced in cache memory assuming the cache is empty at the beginning. For the same RAM, block size and Cache memory, what would be the Hit ration in case of Fully Associative Mapping? For the same RAM, block size and Cache memory, what would be the Hit ration in case of 4-way Set Associative Mapping? Main Program"Test_Cache" Memory address (decimal) 6. Memory address (decimal) 0136 Instruction-1 0137 Instruction-2 0138 Instruction-3 0139 Instruction-4 (return to Instruction-8 of main program -. Test_Cache) Function NSU-2 Memory addresN (decimal) 0003 Instruction-1 0004 Instruction-2 0128 Instruction-1 0005 Instruction-3 (Call Function NSU-2) 0129 Instruction-2 0006 Instruction-4 0130 Instruction-3 0007 Instruction-7 (Call Function NSU-1) 0131 Instruction-4 0008 Instruction-8 0132…
Calculate the hit and miss ratios in the cache and in the main memory for the processor assuming if the processor performs (n) number of total memory references over a period of time. Out of which (m) references are hits in the cache and (K) references of which are hits in the main memory. Also, provide your own reflection when cache (hit and miss) and memory (hit and miss) occur. Note: use own values for n, m, and K.
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?