Consider a swapping system in which memory consists of the following hole sizes in memory in the following order: 20KB 4KB 21KB 15KB 8KB 9KB 25KB Show which of the holes are taken for each of the following requests using the following hole choosing algorithms: P1 needs 3KB P2 needs 18KB P3 needs 14KB a) FIRST FIT b) BEST FIT c) WORST FIT

Consider a swapping system in which memory consists of the following hole sizes in memory in the following order: 20KB 4KB 21KB 15KB 8KB 9KB 25KB Show which of the holes are taken for each of the following requests using the following hole choosing algorithms: P1 needs 3KB P2 needs 18KB P3 needs 14KB a) FIRST FIT b) BEST FIT c) WORST 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

Consider a 32-bit computer with the MIPS assembly set, that executes the following code fragment loaded in memory in the address 0x0000000. li $t0, 1000 li $t1, 0 li $t2, 0 loop: addi $t1, $t1, 1 addi $t2, $t2, 4 beq $t1, $t0, loop This computer has a 4-way associative cache memory of 32 KB and lines of 16 bytes. Calculate the number of cache miss of the previous code, and the hit ratio, assuming that no other program is executing and that the cache memory is initially empty.
Q3 Consider a swapping system in which main memory contains the following hole sizes in memory order: 10K, 4K, 20K, 18K, 7K, 9K, 12K, and 15K. Which hole is taken for successive segment requests of (a) 12K, (b) 10K and (c) 9K for Next-Fit? Assume the last allocated hole is 20K.
Let's pretend for a moment that we have a byte-addressable computer with fully associative mapping, 16-bit main memory addresses, and 32 blocks of cache memory. The following holds true if each block is 16 bits in size:a) Determine how many bytes the offset field is.Measure the tag field's width and height in pixels (b).
Consider a memory system with a cache access time of 100ns and a memory access timeof 1200ns. If the effective access time is 10% greater than the cache access time, what is thehit ratio H?
The overhead required to read an entry in a page table (including the time to access TIB) is 60 nanoseconds. To reduce this overhead, the computer has a TIB that can hold 16 entries and be accessed in 10 nanoseconds.a) Let B = TLB lookup time, T - memory cycle time, and p = hit ratio. Finda formula that expresses the effective access time.b) What hit ratio is needed to reduce the effective access time to 70 nanoseconds?
A computer has four page frames. The time of loading, time of last access, and the R and M bits for each page are as show (the times are in clock ticks): Page Loaded Last ref. R M 0 126 280 1 0 1 230 265 0 1 2 140 270 0 0 3 110 285 1 1 At the time of page fault which page will be replaced by following algorithms: 1. FIFO 2. LRU 3. Second chance
4. Consider a system which has logical address is 7 bits, physical address is 6 bits calculate the number of pages and no.of frames. 5. Given Memory partition of 110,510K,210K and310kand600kin that order show how each of the best-fit, worst-fit and first-fit algorithms place process of221,471,112and 426 in that order in memory.
A cache memory has a line size of eight 64-bit words and a capacity of 4K words. The main memory size that is cacheable is 1024 Mbits. Assuming 4-way set associative mapping and that the addressing is done at the byte level. What is the format of the main memory addresses (i.e s-d, d, and w)? For the hexadecimal main memory location 2BFACEDH, find the corresponding 4-way set-associative memory format
Consider a swapping system in which memory consists of the following hole sizes inmemory order: 12 MB, 4 MB, 20 MB, 12 MB,18 MB, 7 MB, 9 MB and 12 MB.Which hole is taken for successive segment requests of(a) 10MB(b) 15MB(c) 9 MBfor first fit, worst fit, and next fit?
Find the AMAT for a processor with a 1 ns clock cycle time, a miss penalty of 20 clock cycles, a miss rate of 0.05 misses per instruction, and a cache access time (including hit detection) of 1 clock cycle. Assume that the read and write miss penalties are the same and ignore other write stalls.
Consider a memory-management system based on paging. The total size of the physical address space 64 MB, Pages of size 4 KB, the Logical address space of 4GB. total number of pages are 16384, total number of frames are 16384 and the number of entries in a page table are 1048576.Now Calculate: a)Size of Page Table b) No of bits in Physical Address c) No of Bits in Logical Address
A certain microprocessor requires either 2, 3, 4, 8, or 12 machine cycles to perform various operations. A total of 25% of its instructions require 2 machine cycles, 20% require 3 machine cycles, 17.5% require 4 machine cycles, 12.5% require 8 machine cycles, and 25% require 12 machine cycles.Q) Suppose this system requires an extra 20 machine cycles to retrieve an operand from memory. It has to go to memory 40% of the time. What is the average number of machine cycles per instruction for this microprocessor, including its memory fetch instructions?