9Question 7If P6 is allocated, what is the BA?The updated free list is:BA:Question 8; Sz:→ BA:; Sz→ BA:; Sz:; Sz:→BA: iz Instructionsthrough the questions for each of the sections. You may submit this exercise twice.Consider a memory of size 8KB (8192 bytes) that allows dynamic, variable sized partitioning amongprocesses and uses a linked list to keep track of free spaces (hereafter referred to as the free list) inthe memory at any given time. Assume that there are 6 processes and assume that their memorysize requirements (in bytes) are as given below:P1: 500, P2: 600, P3: 1300, P4: 2000, P5: 100, P6: 200Assume that the initial state of the free list is as shown below (BA is the base address and Sz is thesize of each free space):BA: 0; Sz: 1100 BA: 1200: Sz: 600 BA: 2000; Sz: 1800→BA: 6000; Sz 400in its initial state Assume that the next fit policy

Answered: If P6 is allocated, what is the BA? ||

Engineering

Computer Science

If P6 is allocated, what is the BA? ||

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

Given the following information:Free Space ListPartition Size (KB) Queuing Processes Process Size (KB)A 500 P1 170B 350 P2 420C 150 P3 280D 400 P4 90E 350 P5 220F 200 P6 200 List of partitions and processes Show how these SIX (6) processes are allocated into memory partitions when the following allocation algorithms are applied. Give your answer using the following table format. Partition Partition Size Process Process size Internal Fragmentation…
In this exercise, we will examine space/time optimizations for page tables. The following list provides parameters of a virtual memory system. Virtual Address (bits) Physical DRAMInstalled Page Size PTE Size (byte) 43 16 GiB 4 KiB 4 For a single-level page table, how many page table entries (PTEs) are needed? How much physical memory is needed for storing the page table? Using a multilevel page table can reduce the physical memory consumption of page tables, by only keeping active PTEs in physical memory. How many levels of page tables will be needed in this case? And how many memory references are needed for address translation if missing in TLB? An inverted page table can be used to further optimize space and time. How many PTEs are needed to store the page table? Assuming a hash table implementation, what are the common case and worst case numbers of memory references needed for servicing a TLB miss?
In the working set model, the idea is to examine the most recent delta page referances. It is also known as an approximation of the Program's Locality. If the total demand is greater than the total number of available frames (D>m) then it will cause thrashing, because in this case, some processes will not have enough frames. Below you see 3 processes and their excepted memory references during their execution. When will the thrashing happen to occur according to the working set model? Assume total memory(m) is 10 and Delta is 5
Suppose the head of a moving head disk with 200 tracks numbered 0-199 is currently servinga request at track 143. It has just finished a request at track 125. If the queue of requests iskept in the FIFO order,86,147,85,177,94,150,102,175,130What is the total head movement to satisfy these requests for the following disk schedulingalgorithms? First Come First Served Shortest Seek Time First SCAN
Now, we consider a 16-byte, four-way, fully-associative cache. Since the capacity of the cache is 16 bytes, the array "a" in our example (does/does not) fit inside the cache. We can deduce that the block size for this cache is ( ？ ) bytes per block. So the block index size b=2 bits. For a memory trace record such as: L 1fff000116,2 the 2-bit block offset is (0b01/0b10/0b11/0b00). The tag bits are all the rest of the bits not part of the block offset.
Consider the dynamic memory layout shown below (the shaded blocks are already allocated). Draw to what the free memory layouts would be after satisfying requests for (in order) memory blocks of size 195K, 410K, 262K, and 385K. 500 KB 600 KB 590 KB 700 KB 480 KB Draw one memory layout for the worst-fit, best-fit algorithm, and one for first-fit. [02 Marks] Which algorithm makes the efficient use of the memory? Why? [01 Marks] Also indicate which type of fragmentation will occur and why? [01 Marks]
A computer uses virtual memory, and a new solid-state drive (SSD) as space for paging. Refer to the last ppt file. In the case presented there, the hard disk drive (HDD) required 25 ms to read in a page, and a rate of 1 page fault per 1000 references introduced a 250 slowdown. If the SSD offers a time of only 80 µs, what is the slowdown in performance caused by 1 pf per 1000 references (you are not concerned with dirty vs. clean pages). What is the maximum rate of page faults you can accept if you want no more than a 5% slowdown in execution using virtual memory? Know your metric prefixes and symbols for time: s for seconds, ms for milliseconds, µs for microseconds, ns for nanoseconds.
Figure 2 shows available free list in a heap of memory management scheme. Show the memoryallocation of process requests of size 90KB, 39KB, 27KB, 16KB and 36KB which will bereceived in order using:a) Best-Fit memory allocation methodb) Worst-Fit memory allocation method solve a & b
Transcribed Image Text Consider the following set of processes, with arrival times and the length of the CPU burst time given in milliseconds. a. Draw a Gantt chart that illustrates the execution of these processes using the Shortest-Remaining Time First (SRTF) scheduling algorithm. b. Give the average waiting time of Shortest-Remaining Time First (SRTF) scheduling algorithm. Note: Preempted processes are added to the end of the ready queue. Process Arrival Time Burst Time A 4 B 1 3 1 D 3 4 3
Consider the FCFS, SJF, and RR (quantum = 8 milliseconds) scheduling algorithms for this set of processes. Process Burst Time P1 8 P2 25 P3 3 P4 7 P5 11 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0. a) Draw Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, and RR. b) What is the waiting time of each process for each of these scheduling algorithms? c) Which of the algorithms results in the minimum average waiting time (overall processes)? d) Derive the Need (max-Alloc) matrix. It should be presented like the Allocation or Maximum matrices above. e) If the request from process P1 arrives for (0,1,2,0), can the request be granted? Why?
1.In the Readers-Writers problem, more than one writer can access the buffer at the same time to write True False 2.Given that processes P1 and P2 are using semaphores to lock resources, determine whether or not the following sequence of requests results in a deadlock. Initially, all resources are available. P1: P2: wait(A) wait(C) wait(B) wait(B) ... .... signal(A) signal(B) signal(B) signal(C) Yes No Insufficient information 3.If no process is executing in its critical section and there exist some processes that wish to enter their critical section, then the selection of the processes that will enter the critical section next cannot be postponed indefinitely. Which option describe best Mutual Exclusion Progress Bounded Waiting None of the above 4.In the producer-consumer problem, the "out" will be used to point to the index in the buffer where a producer can produce next. True False 5.Entry section and Exit section in the code together are referred to as a solution for…
Consider the swapping system below with the memory blocks in the following order. Assume that the following segment requests arrive in the order given 13K 10K 5K 9K consider the following as our memory block: 12K 4K 8K 16K 9K 5K 12K 17K 19K Which blocks will be taken for the above requests for the algorithms we covered in the class. Fit the above requests for (i) first fit, (ii) best fit, and (iii) worst fit. Provide your answers step by step for each of these algorithms. For example, for First fit, create a section in your report where you will have the block sequence with the block highlighted per request. Once the block is selected for a request, also indicate remaining capacity of the blocks on the right (e.g., if the request (a) is 4K and the first fit finds the first block (i.e., 12K), then highlight the block with 12K for option (a) and write your answer 8K as the remaining block capacity.