In a 1024KB segment, memory is allocated using the Buddy System. The following memory allocations are requested. What are the allocated memory for each? (Do not enter K in the answer. Just the numbers) 1. Request 5 KB Requst5KB 2. Request 135 KB Requst135KB = 3. Request 14 KB Requst14KB 4. Request 3 KB Requst3KB 5. Request 12 KB Requst12KB 6. Request 257KB Requst257KB = The following releases of memory happened. Perform coalescing whenever possible: Release 3 KB Release 5 KB • Release 14 KB • Release 12 KB What is the available memory after coalescing? available = [Hint: No need to draw the tree. Looking at the numbers, you can find the answers)

In a 1024KB segment, memory is allocated using the Buddy System. The following memory allocations are requested. What are the allocated memory for each? (Do not enter K in the answer. Just the numbers) 1. Request 5 KB Requst5KB 2. Request 135 KB Requst135KB = 3. Request 14 KB Requst14KB 4. Request 3 KB Requst3KB 5. Request 12 KB Requst12KB 6. Request 257KB Requst257KB = The following releases of memory happened. Perform coalescing whenever possible: Release 3 KB Release 5 KB • Release 14 KB • Release 12 KB What is the available memory after coalescing? available = [Hint: No need to draw the tree. Looking at the numbers, you can find the answers)

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

We have a full associative mapping cache memorywith globally 65536 = 2^16 lines. Each line is hosting32 data. How many bits are necessary for the TAG fora 24 bits address bus?3 A19 B21 CNone of previous answers solve this question in great detail explaining every single bit of info as i'm a complete beginner and i need to understand how to solve questions of this type. also provide small examples of how the solution would differ if the question was slightly altered. THANK YOU!
We have a fully associative cache memory with 216entries). Each entry is hosting 32 data. How manybits are necessary for the TAG for a 28 bits address?5 A12 B23 C None of previous answers D , also is there a difference if it was fully associative mapping cache memory or no? solve this question in great detail explaining every single bit of info as i'm a complete beginner and i need to understand how to solve questions of this type. also provide small examples of how the solution would differ if the question was slightly altered.
Let the cache size be k=3 the initial cache a,b,c and the request a,a,d,e,b,b,a,c,f,d,e,a,f,b,e,c:Request a a d e b b a c f d e a f b e ccache 1 a a d e e e e e e e e e e e e ccache 2 b b b b b b a a a a a a f f f fcache 3 c c c c c c c c f d d d d b b bcache miss x x x x x x x xEight cache misses is a lot better.Selftest: Do the example for LIFO, LFU, RFU and look what happend. code in c++
Consider the following page address stream: 2 1 4 3 5 3 2 4 5 2 1 2 4 3 1 Which of the following causes the most page faults to occur on a machine with 3 frames? Scheme that causes the most faults: a) First in First out b) LRU and FIFO are the same number of faults c) FIFO and Opitimal are the same number of faults d) All have the same number of faults e) Least Recently Used f) No faults occurs g) LRU and Optimal are the same number of faults h) Optimal NUMBER OF FAULTS CAUSED: a)
We have a 4-way-set associative mapping cachememory with globally 65536 = 216 lines. Each line ishosting 128 data. How many bits are necessary for theTAG for a 28 bits address bus?5 A6 B7 CNone of previous answers D solve this question in great detail explaining every single bit of info as i'm a complete beginner and i need to understand how to solve questions of this type. also provide small examples of how the solution would differ if the question was slightly altered
Suppose a computer system uses 16-bit addresses for both its virtual and physical addresses. In addition, assume each page (and frame) has size 256 bytes. 8 bits are used for offset, 8 bits are used for page # and the max number of pages a process can have is 256. e. Translate the following virtual addresses to physical addresses, and show how you obtain the answers. (Hint: You do not need to convert hexadecimal numbers to decimal ones.) 0x0389 0xDF78 0x0245 0x8012 f) Now, suppose that the OS uses a two-level page table. Draw the page table. (Assume that frames 7 through 221 are free, so you can allocate space for the page table there.) In addition, suppose that the page-table directory storage comprises a whole number of consecutive full frames. (For examples: if the directory entry is 2 bytes, the entry’s storage comprises 1 frame; if the directory entry is 260 bytes, the entry’s storage comprises 2 consecutive frames.) g)What is the size of the two-level page table…
Assume the following parameters for Go-Back-N: a) N = 4b) Round Trip Time (RTT) = 10 msc) Timeout period = 40 msd) Segment Size = 1700 bytesSuppose that Bob sent 10 data segments, numbered 1 through 10, to Aliceusing the Go-Back-N mechanism. Suppose that data segment 4 and datasegment 8 were lost the first time the segments were sent to Alice (butreached Alice correctly when retransmitted). There were no other segmentlosses apart from the aforementioned. What is the average throughputobtained in sending all the data segments (in bytes/sec)? Draw a diagramto show the communication process in detail.
a. Compute CBC-MAC for a message of 16 bits, “8642” (in Hexa). Assume a block size of 8 bits with an IV=F1 (in hexa). For simplicity, assume the encryption to be a simple XOR of the key with the plaintext. Let the encryption key be B4 (in Hexa). (Hint: Divide the message into blocks of 8 bits each; XOR each block with the previous cipher output; then encrypt this with the key. For the first block, XOR it with IV. Details in pages 325-326 Ch.12 of the textbook) b. Suppose Alice computes the Secret prefix MAC (page 322: secret prefix MAC(x) = h(key || x)) for the message ”AM” (in ASCII) with key “G” (in ASCII) that both Alice and Bob know. The hash function that is used is h(x1x2x3)= g(g(x1 XOR x2) XOR x3 ) where each xi is a character represented as 8 bits, and g(x) is a 8-bit string that is equal to the complement of bits in x. For example, g(10110011) = 01001100. The MAC is 8 bits. (8-bit ASCII representation of the characters is given below.) What is the Secret prefix MAC…
Suppose we have a byte-addressable computer using direct mapping with 16-bit main memory addresses and 32 blocks of cache. If each block contains 16 bytes. a. Determine the number of bits of the offset field. b. Determine the number of bits of the block (or slot) field. c. Determine the number of bits of the tag field. d. To which cache block would the hexadecimal address 0x2468 map? e. What is the tag of the hexadecimal address 0x2468 f.To which cache block would the hexadecimal address 0x864A map? g. What is the tag of the hexadecimal address 0x864A?
Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is currently serving a request at cylinder 2,150, and the previous request was at cylinder 1,805. The queue of pending requests, in FIFO order, is:2,069 1,2122,2962,8005441,6183561,5234,9653681a. FCFSb. SSTFc. SCANd. LOOKe. C-SCANf. C-LOOK
In the previous answers:Isn't 1 is supposed to be subtracted from the 64 as well? Malloc for x: Requested size: 10k Address returned to the caller: 32k + 1k = 33k (since x will be placed after the header of 1k) Address returned to the program: 33k Remaining free memory: 54k (64k - 10k) (here) Address of the remaining free memory: 43k andHere, the requested size is 20, why is 10 subtracted? Malloc for y (again): Requested size: 20k Address returned to the caller: 44k (previous address) Address returned to the program: 44k (previous address) Remaining free memory: 54k (64k - 10k) (here) Address of the remaining free memory: 64k
For a microprocessor the code segment starts at 20000H, and stack segment starts at 21000H.Physical addresses from 21000H to 2FFFFH are accessible from both code and stack segment.These are the physical addresses.● If a location has CS: IP=2000H: 3000H, can we access this location with SS: SP? If yes,what is the SS: SP for this location? If no, why is it not accessible?● If another location has CS: IP=2000H: 0030H, can we access this location with SS: SP? Ifyes, what is the SS: SP for this location? If no, why is it not accessible?