Consider a swapping system in which memory consists of the holes as shown in Fig.A. Note that A to I represent processes in memory, and H1 to Hs are eight holes. Process P1. P2. .. Ps are generated sequentially, and their sizes are as follows: i Pi requests 8 KB. i Pz requests 10KB. 111. P3 requests 13KB. iv. Pa requests 5KB V. Ps requests 4KB Answer the following questions: Hị_ A 4KB H: | 10KB H3 в 5KB H4 | 16KB Hs D 8KB He E 9KB Hs 13КВ G 15КВ Fig. A (a) When using First-fit algorithm, (1) which hole will P1 will be loaded into? (2) which hole will P5 will be loaded into? (b) When using Best-fit algorithm, (3) which hole will P1 will be loaded into? (4) which hole will P5 will be loaded into? (c) When using worst-fit algorithm, (5) which hole will P1 will be loaded into? (6) which hole will P4 will be loaded into? (7) which hole will P5 will be loaded into? (d) When using Next-fit algorithm, (8) which hole will P2 will be loaded into? (9) which hole will P3 will be loaded into? (10) which hole will P4 will be loaded into?

Consider a swapping system in which memory consists of the holes as shown in Fig.A. Note that A to I represent processes in memory, and H1 to Hs are eight holes. Process P1. P2. .. Ps are generated sequentially, and their sizes are as follows: i Pi requests 8 KB. i Pz requests 10KB. 111. P3 requests 13KB. iv. Pa requests 5KB V. Ps requests 4KB Answer the following questions: Hị_ A 4KB H: | 10KB H3 в 5KB H4 | 16KB Hs D 8KB He E 9KB Hs 13КВ G 15КВ Fig. A (a) When using First-fit algorithm, (1) which hole will P1 will be loaded into? (2) which hole will P5 will be loaded into? (b) When using Best-fit algorithm, (3) which hole will P1 will be loaded into? (4) which hole will P5 will be loaded into? (c) When using worst-fit algorithm, (5) which hole will P1 will be loaded into? (6) which hole will P4 will be loaded into? (7) which hole will P5 will be loaded into? (d) When using Next-fit algorithm, (8) which hole will P2 will be loaded into? (9) which hole will P3 will be loaded into? (10) which hole will P4 will be loaded into?

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

Related questions

Q: Let's pretend for a moment that we have a byte-addressable computer with fully associative mapping,…

A: Mapping associations: Associative mapping uses associated memory to hold both memory words. Each…

Q: Consider a mini virtual memory system. It has a virtual address space of 2°. Each page is 2 bytes.…

A: Please refer to the following step for the complete solution to the problem above.

Q: Consider a computer with byte-addressable main memory of size 1 GB and page size of 4 KB. Assume a…

Q: (1) When using First-Fit algorithm, which hole will P1, P2, P3, P4 and P5 will be loaded into,…

A: “Since you have posted a question with multiple sub parts, we will provide the solution only to the…

Q: A swapping system eliminates holes by compaction.Assuming a random distribution of many holes and…

A: 4096 x 2^20 / 4 = 2^30 memory address compaction time = (read + write) * # of memory access…

Q: sable расе, ge size ge tabl orh

Q: A computer system has 6 page frames. The table below shows the time of loading, the time of last…

A: Understanding Page ReplacementPurpose: When a program needs a page that's not currently in the main…

Q: 4 Consider a microprocessor that has a block I/O transfer instruction such as that found on the…

Q: tes are stored in memory locations from 8050h to 805Fh. Write 8085 ALP to transfer the the locations…

Q: Now suppose the system from problem 17 has 8Kb of physical memory. Process P1 has the following page…

A: Here in this question we have given Virtual address = 16 bit (from previous question) Page size =…

Q: Suppose your system has a memory of size 100 MB using contiguous memory allocations and there are 4…

A: we are using ASCII code for size of process we are taking s = 115 u = 117 f = 102 y = 121 a = 97…

Q: Consider a system with N bytes of physical RAM, and M bytes of virtual address and frames are K…

A: Here the virtual memory size = M bytes And page size is K bytes. The virtual address is divided…

Q: 4. A system holds memory as shown in the figure below. (units in bytes) H P2 P3 150 50 100 P4 200 75…

A: First Fit It is appropriate to distribute the first requesting process to free or a whole large…

Q: Let's pretend for a moment that we have a byte-addressable computer with fully associative mapping,…

A: The Associative Map: The affiliated memory is used to store information and addresses both memory…

Q: e memory acc

A: The average memory access time is the sum of the hit time and the miss rate times the miss penalty.…

Q: For instance, a systolic array is a kind of array that may be thought of as a MISD device. Systolic…

A: The systolic array will be present when all of the arrays have been transmitted to all of the nodes,…

Q: Given process 1 page table consisting of 6-bit page number and 10-bit offset. Process 1 Page Table…

A: Here is explanation regarding the physical address of both.

Q: Translate the following virtual addresses to physical addresses, and show how you obtain the…

A: - We need to get the physical address for the virtual addresses provided.

Question

Consider a swapping system in which memory consists of the holes as shown in Fig.A. Note that A to I represent processes
in memory, and Hj to Hg are eight holes. Process Pj, P. ... , Ps are generated sequentially, and their sizes are as follows:
i Pi requests 8 KB.
P2 requests 10KB.
i.
111.
P3 requests 13KB.
iv.
P4 requests 5KB
Ps requests 4KB
V.
Answer the following questions:
Н. А На в На с
10KB
H4
16KB
D Hs
8KB
E
He
G
9KB
H: I
15KВ
Hs
13KB
4KB
5KB
Fig. A
(a) When using First-fit algorithm,
(1) which hole will P1 will be loaded into?
(2) which hole will P5 will be loaded into?
(b) When using Best-fit algorithm,
(3) which hole will P1 will be loaded into?
(4) which hole will P5 will be loaded into?
(c) When using worst-fit algorithm,
(5) which hole will P1 will be loaded into?
(6) which hole will P4 will be loaded into?
(7) which hole will P5 will be loaded into?
(d) When using Next-fit algorithm,
(8) which hole will P2 will be loaded into?
(9) which hole will P3 will be loaded into?
(10) which hole will P4 will be loaded into?

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

Step 2

Step 3

Step 4

Trending now

This is a popular solution!

Step by step

Solved in 4 steps with 4 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

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?
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 the following example and perform complete working of paging, generate the logical and physical addresses too. Let us consider the main memory size 16 Kb and Framesize is 2 KB therefore the main memory will be divided into the collection of 8 frames of 2KB each. There are 3 processes in the system that is P1, P2 and P3 of 4 KB each. Each process is divided into pages of 2 KB each so that one page can be stored in one frame. Cpuwants 2nd kb of 3rd process for processing
Consider a hypothetical computer having instruction length 32 bit and Byte addressable memory. You need to run a program P having 10 Q.4 CO4 instructions 11,12,13...10. All the instructions are stored in consecutive memory locations started from 1000. To run an instruction li, you have to complete four operations: Fetch, Decode, Execute, and Store. The content of Program Counter will be after the completion of fetch operation of instruction 12. There are no jump or branch instruction in program P