Consider a memory of size 16KB. This memory is allocated in increments of 1KB and the memory is initially empty. Use the various contiguous allocation schemes (First-fit, Best-fit, an Worst-fit) for satisfying the memory allocation/deallocation requests for processes requesting the sizes shown in the table below. Process ABCDEFGHIJK Size (in KB) 4.27.2 2.5 4.5 3 2.7 1.5 23.62.21 Allocate(P) represents an allocation request by process P for the size shown in the above table Deallocate(P) is used to indicate deallocating the memory allocated to process P To represent memory, in square brackets, we use P to indicate a memory segment allocated to P and we use an integer to indicate a contiguous free part of memory. For example, after the following sequence of requests: Allocate(B), Allocate(G), Allocate(H), Deallocate(G) memory will look like this: B 8KB We represent this memory by [B,2,H,4]. free H 2KB 2KB For each of the following sequence of requests, apply the First-fit, Best-fit, and Worst-fit allocation schemes. Assume that for each algorithm, you always start at the beginning of the list and if there are multiple possible equal-size holes that can be selected by an algorithm, the first one is selected. Show the following: i. If all the requests can be satisfied, indicate the memory representation at the end of the sequence. If a request cannot be satisfied by an algorithm, indicate which request is this and the memory representation at this point. For example, consider adding the request Allocate(X) to the previous example. The following are answer examples If X is requesting 6 KB the answer will be: [B,2,H,4] and Allocate(X) cannot be satisfied free 4KB If X is requesting 3 KB, the answer will be [B,2,H,X,1] ii. Which method is the best for this particular sequence, and the amount (in KB) of internal fragmentation at the end of the sequence for this best method.
Consider a memory of size 16KB. This memory is allocated in increments of 1KB and the memory is initially empty. Use the various contiguous allocation schemes (First-fit, Best-fit, an Worst-fit) for satisfying the memory allocation/deallocation requests for processes requesting the sizes shown in the table below. Process ABCDEFGHIJK Size (in KB) 4.27.2 2.5 4.5 3 2.7 1.5 23.62.21 Allocate(P) represents an allocation request by process P for the size shown in the above table Deallocate(P) is used to indicate deallocating the memory allocated to process P To represent memory, in square brackets, we use P to indicate a memory segment allocated to P and we use an integer to indicate a contiguous free part of memory. For example, after the following sequence of requests: Allocate(B), Allocate(G), Allocate(H), Deallocate(G) memory will look like this: B 8KB We represent this memory by [B,2,H,4]. free H 2KB 2KB For each of the following sequence of requests, apply the First-fit, Best-fit, and Worst-fit allocation schemes. Assume that for each algorithm, you always start at the beginning of the list and if there are multiple possible equal-size holes that can be selected by an algorithm, the first one is selected. Show the following: i. If all the requests can be satisfied, indicate the memory representation at the end of the sequence. If a request cannot be satisfied by an algorithm, indicate which request is this and the memory representation at this point. For example, consider adding the request Allocate(X) to the previous example. The following are answer examples If X is requesting 6 KB the answer will be: [B,2,H,4] and Allocate(X) cannot be satisfied free 4KB If X is requesting 3 KB, the answer will be [B,2,H,X,1] ii. Which method is the best for this particular sequence, and the amount (in KB) of internal fragmentation at the end of the sequence for this best method.
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
Related questions
Question
Transcribed Image Text:ii. Which method is the best for this particular sequence, and the amount (in KB) of internal
fragmentation at the end of the sequence for this best method.
a)
Request Sequence: Allocate(D), Allocate(B), Allocate(F), Deallocate(D), Deallocate(F),
Allocate(G), Allocate (I)
First-fit
The best algorithm for this sequence of requests is:
The amount of internal fragmentation (in KB) for this algorithm is
Best-fit
First-fit
b)
Request Sequence: Allocate(C), Allocate(E), Allocate(D), Allocate(A), Deallocate(C),
Deallocate(D), Allocate(H), Allocate(F), Allocate(J)
Best-fit
The best algorithm for this sequence of requests is:
The amount of internal fragmentation (in KB) for this algorithm is
First-fit
Worst-fit
c)
Request Sequence: Allocate(1), Allocate(H), Allocate(G), Allocate(F), Allocate(D), Deallocate(1),
Deallocate(G), Deallocate(D), Allocate(K), Allocate(E), Allocate(G), Allocate(A)
Best-fit
Worst-fit
The best algorithm for this sequence of requests is:
The amount of internal fragmentation (in KB) for this algorithm is
Worst-fit
![Consider a memory of size 16KB. This memory is allocated in increments of 1KB and the memory is initially empty. Use the various contiguous allocation schemes (First-fit, Best-fit, and
Worst-fit) for satisfying the memory allocation/deallocation requests for processes requesting the sizes shown in the table below.
Process
ABCDEFGHIJK
Size (in KB) 4.2 7.22.5 4.5 3 2.7 1.5 23.62.21
Allocate(P) represents an allocation request by process P for the size shown in the above table
Deallocate(P) is used to indicate deallocating the memory allocated to process P
To represent memory, in square brackets, we use P to indicate a memory segment allocated to P and
we use an integer to indicate a contiguous free part of memory. For example, after the following
sequence of requests: Allocate(B), Allocate(G), Allocate(H), Deallocate(G) memory will look like
this:
B
8KB
We represent this memory by [B,2,H,4].
free H
2KB 2KB
For each of the following sequence of requests, apply the First-fit, Best-fit, and Worst-fit allocation
schemes. Assume that for each algorithm, you always start at the beginning of the list and if there are
multiple possible equal-size holes that can be selected by an algorithm, the first one is selected. Show
the following:
i. If all the requests can be satisfied, indicate the memory representation at the end of the sequence.
If a request cannot be satisfied by an algorithm, indicate which request is this and the memory
representation at this point. For example, consider adding the request Allocate(X) to the
previous example. The following are answer examples
If X is requesting 6 KB the answer will be:
[B,2,H,4] and Allocate(X) cannot be satisfied
free
4KB
If X is requesting 3 KB, the answer will be
[B,2,H,X,1]
ii. Which method is the best for this particular sequence, and the amount (in KB) of internal
fragmentation at the end of the sequence for this best method.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fbbc8a687-c0f0-429c-86f1-046930399c86%2F6842f312-e07f-48ad-90d1-3a2236166bd5%2Fnizseol_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Consider a memory of size 16KB. This memory is allocated in increments of 1KB and the memory is initially empty. Use the various contiguous allocation schemes (First-fit, Best-fit, and
Worst-fit) for satisfying the memory allocation/deallocation requests for processes requesting the sizes shown in the table below.
Process
ABCDEFGHIJK
Size (in KB) 4.2 7.22.5 4.5 3 2.7 1.5 23.62.21
Allocate(P) represents an allocation request by process P for the size shown in the above table
Deallocate(P) is used to indicate deallocating the memory allocated to process P
To represent memory, in square brackets, we use P to indicate a memory segment allocated to P and
we use an integer to indicate a contiguous free part of memory. For example, after the following
sequence of requests: Allocate(B), Allocate(G), Allocate(H), Deallocate(G) memory will look like
this:
B
8KB
We represent this memory by [B,2,H,4].
free H
2KB 2KB
For each of the following sequence of requests, apply the First-fit, Best-fit, and Worst-fit allocation
schemes. Assume that for each algorithm, you always start at the beginning of the list and if there are
multiple possible equal-size holes that can be selected by an algorithm, the first one is selected. Show
the following:
i. If all the requests can be satisfied, indicate the memory representation at the end of the sequence.
If a request cannot be satisfied by an algorithm, indicate which request is this and the memory
representation at this point. For example, consider adding the request Allocate(X) to the
previous example. The following are answer examples
If X is requesting 6 KB the answer will be:
[B,2,H,4] and Allocate(X) cannot be satisfied
free
4KB
If X is requesting 3 KB, the answer will be
[B,2,H,X,1]
ii. Which method is the best for this particular sequence, and the amount (in KB) of internal
fragmentation at the end of the sequence for this best method.
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!
Trending now
This is a popular solution!
Step by step
Solved in 5 steps with 17 images
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.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education