Q4.. Consider a system with 4 MB contiguous memory. Show the buddy system structure after allocating the kernel memory requests of 1.4 MB, 700 KB, 450 KB, 230 KB, 110 KB, 85 KB. For each allocated memory block, calculate the internal fragmentation. For example, the following buddy system structure shows how to allocate a 300 KB kernel memory request within 1 MB system memory (red for allocated memory, orange for block internal fragmentation, and green for the free memory block). Allocating 300 KB 300 KB Initial Memory ➤ Allocating 1.4 MB ➤ Allocating 700 KB ➤ Allocating 450 KB ➤ Allocating 230 KB ➤ Allocating 110 KB ➤ Allocating 85 KB 212 KB 4 MB 512 KB

Q4.. Consider a system with 4 MB contiguous memory. Show the buddy system structure after allocating the kernel memory requests of 1.4 MB, 700 KB, 450 KB, 230 KB, 110 KB, 85 KB. For each allocated memory block, calculate the internal fragmentation. For example, the following buddy system structure shows how to allocate a 300 KB kernel memory request within 1 MB system memory (red for allocated memory, orange for block internal fragmentation, and green for the free memory block). Allocating 300 KB 300 KB Initial Memory ➤ Allocating 1.4 MB ➤ Allocating 700 KB ➤ Allocating 450 KB ➤ Allocating 230 KB ➤ Allocating 110 KB ➤ Allocating 85 KB 212 KB 4 MB 512 KB

Name: Q4..Consider a system with 4 MB contiguous memory. Show the buddy sys
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Q4..Consider a system with 4 MB contiguous memory. Show the buddy systemstructure after allocating the kernel memory requests of 1.4 MB, 700 KB, 450 KB, 230 KB, 110KB, 85 KB. For each allocated memory block, calculate the internal fragmentation.For

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 the following scenario: we have a byte-addressable computer that employs fully associative mapping and has 16-bit main memory addresses and 32 blocks of cache memory. If each block has 16 bytes, the following is true:(a) Calculate the size of the offset field in bytes.(b) Calculate the size of the tag field in pixels.
1. Consider a 128-word L2 memory and a 16-word direct mapped L1 cache. (2 points each) a. How many bits wide is the L2 address? b. How many index bits are in the L2 address? c. How many tag bits are in the L2 address? d. How many words from the L2 memory will map to the same word in L1? 2. Consider a 65,536 word L2 memory and a 4,096 word L1 direct mapped cache with block sizes of 512 words. (2 points each) a. How many blocks are in L1? b. How many block bits are in the L2 address? c. How many index bits are in the L2 address? d. How many tag bits are in the L2 address? e. How many address ranges in L2 will map to the same block in L1? 3. Consider a 65,536 word L2 memory and a 4,096 word L1 2-way associative cache with block sizes of 512 words. Since L1 consists of two sets, each set will be 2,048 words large. (2 points each) a. How many blocks are in each set in L1? b. How many block bits are in the L2 address? c. How many index bits are in the L2 address? d. How many tag bits are in…
Consider a direct-mapped cache memory with 12-bit addresses. The cache is byte-addressable. We have B = 16 bytes per block and S = 8 sets. For the address shown below. Indicate which bits correspond to the cache set index, tag bits, and block offset. Bit 11 Bit 10 Bit 9 Bit 8 Bit 7 Bit 6 Bit 5 Bit 4 Bit 3 Bit 2 Bit 1 Bit 0
Consider a system with 8192 byte pages, a page table entry (PTE) size of 8 bytes, 40-bit virtual addresses, and 56-bit physical addresses. Considering the size you calculated in the last question, is it realistic to use a single page table in the real world? Explain why or why not. A- BI U - How many PTES could fit on a single page? Answer: How many levels of page tables would you need, if you ensure that each (smaller) page table fits on a page. Answer: Explain how you arrived at your answer for the previous question.
Question 16 Suppose we have a virtual address space of 8 kilobytes (KB), a physical memory size of 6 kilobytes (KB) that uses byte addressing, and a page. size of 3 kilobytes (KB). There is no cache in the system. What are the sizes of the page and offset fields in the virtual address? a. page field; 3 bits and offset field: 10 bits b. page field: 2 bits and offset field: 11 bits c page field: 10 bits and offset field: 3 bits d. page field: 8 bits and offset field: 4 bits e. None of the other answers.
Consider a memory of size 8KB (8192 bytes) that allows dynamic, variable sized partitioning among processes and uses a linked list to keep track of free spaces (hereafter referred to as the free list) in the memory at any given time. Assume that there are 6 processes and assume that their memory size requirements (in bytes) are as given below: Р1: 500, Р2: 600, Р3: 1300, Р4: 2000, Р5: 100, Р6: 200 Assume that the initial state of the free list is as shown below (BA is the base address and Sz is the size of each free space): ВА: 0; Sz: 1100 — ВА: 1200; Sz: 600 > BА: 2000; Sz: 1800> ВА: 6000%; Sz 400
A system with simple paged memory management has addresses of B bits and pages of size P KiB. If all memory is pageable, what is the maximum number of items contained in a process's page table? What if K KiB are reserved for the kernel and are not pageable? Also suppose that the page table is organized in 2 levels, so that the page directory (first level) is addressed by D bits. How many bits will be used to address the second level? How many entries will there be, at most, among all the tables of the pages (first and second level) of a process?
Given a computer using a byte-addressable virtual memory system with a two-entry TLB, a 2-way set associative cache, and a page table for a process P. Assume cache blocks of size 8 bytes. Assume pages of size 16 bytes and a main memory of 4 frames. Assume the following TLB and page table for Process P: TLB Page Table Valid f 3. 1. 1 2. 2. 1 4 0. 6. 0. 7. How many bits are in a virtual address for process P? Click Save amd Submit to save and submit. Click Save All Answers to save all answers. 56° hp
Consider a processor that uses a 48-bit virtual memory address. The main memory installed onthe system is 4GB. Page size is set to be 32KB. Determine the following:I. Address space of virtual memory and physical memory. II. Total Number of virtual pages and the total physical pagesIII. How many bits are necessary to store (i) Page Table entry and (ii) TLB entry, consideringthe TLB entry stores valid, reference and dirty bits.IV. What is the size of the page table? And how many pages of memory is needed to storethe entire Page table? What fraction of physical memory is needed to store the entirepage table?
Suppose that a block is 1K Byte and that a disk address is 4 bytes. Suppose that files are implemented using i-nodes, and that an i-node has the following structure: the last address in the inode is a third-level indirect block; the second-to-last address is a second-level indirect block; the third-to-last address is an indirect block; and the remaining addresses are data blocks. Approximately how large a file can this system support?
Below is a series of byte addresses in a system with 32 bit words. Assuming a direct-mapped cache with 4-word blocks and a total size of 32 words that is initially empty, (a) label each reference in the list as a hit or a miss and (b) show the entire history of the cache, including tag and data. Byte Address Byte Address (Hexadecimal) (Binary) Hit/Miss 76 0000 0000 0111 0110 1E3 0000 0001 1110 0011 815 0000 1000 0001 0101 141 0000 0001 0100 0001 170 0000 0001 0111 0000 5E1 0000 0101 1110 0001 320 0000 0011 0010 1100 B10 0000 1011 0001 0000 175 0000 0001 0111 0101 583 0000 0101 1000 0011 1FF 0000 0001 1111 1111 7A 0000 0000 0111 1010 2B2 0000 0010 1011 0010 5E4 0000 0101 1110 0100 816 0000 1000 0001 0110 438 0000 0100 0011 1000
Suppose a computer using fully associative cache has 224 words of main memory and a cache of 512 blocks, where each cache block contains 16 words. How many blocks of main memory are there? What is the format of a memory address as seen by the cache, i.e., what are the sizes of the tag and offset fields? To which cache block will the memory reference 17042416 map?