Bhlp Qj 21so12 - Lecture Notes

Network Design and Management (Nueva Vizcaya State University)

Studocu is not sponsored or endorsed by any college or university

Downloaded by DATU AL-ANSARI UKO (ansariuko26@gmail.com)
 BSIT301
Instructions: Analyze the illustrations and answer the corresponding questions for each. Use 3-5 sentences in answering. (6 items x 5
points)

Part I: Fixed Partitioning

Figure 1. An illustration of fixed partitioning with an (a) equal and

(b) unequal sized memory partitions – 64MB memory. Questions:
1. Which partitioning setup could possibly reduce internal fragmentation and how?
➢ The Dynamic Partitioning can possibly reduce internal fragmentation because these partitions are created
dynamically, wherein each process is loaded into a partition of exactly the same size as the process. This
technique has no internal fragmentation. Which results in a more efficient use of the main memory. The first
partition is reserved for the operating system. The remaining space is divided into parts. The size of each
partition will be equal to the size of the process. There are three ways to implement dynamic partitioning,
bestfit, first-fit, and next-fit.

2. Based on the two partitioning setup above, wouldyou recommend the implementation of the fixed
partitioning technique in developing automated machines? Why or why not?
➢ Yes, I can suggest the use of fixed partitioning in automated machines because the fault can be easily detected in
this partitioning, and it is very easy to implement. It can prevent data loss during power outages or when
software fails. Fixed partitions also increase the chances of data recovery in critical situations.

3. In your perspective, what are the possible downside of utilizing an equally sized memory partitions?
Rationalize your answer.
Downloaded by DATU AL-ANSARI UKO (ansariuko26@gmail.com)
 ➢ A program may be too big to fit in a partition, it needs to be designed with the use of overlays. Also, main
memory utilization is inefficient. Any program, regardless of size occupies an entire partition. Internal
fragmentation wasted space due to the block of data loaded being smaller than the partition. Now, In every
partition only one process will be accommodated, therefore the degree of multiprogramming is restricted by a
number of partition. The maximum size of the process is restricted by the size of the partition therefore large
size process cannot be accommodated.

Part II: Dynamic Partitioning

Figure 2. A sequence of memory allocation of four processes, implementing the dynamic partitioning technique – 64MB memory.

Questions:
4. What do you think is the possible reason why Process 2 was pulled/swapped out (e) of the memory?
➢ Possible reasons can be
a. As memory is full and some high priority tasks are needed the CPU, therefore, process 2 is pulled out and
replaced by process 4. That is why it is suspended.
b. Process 2 may have completed his entire execution and no longer needed the CPU time. But in option (h) it
again arrives therefore this option is not true.
c. Process 2 has been temporarily suspended because of the time-sharing mode of execution CPU.

5. When Process 1 finishes the execution (g) and Process 2 is swapped back in the memory (h), what
possible condition or phenomenon can occur within the memory? Rationalize your answer.
➢ All the updates for the memory block of process 1 have been saved on the hard disk, the context of process 1 is
then cleared and memory is marked free. Then the context of process 2 is loaded and memory is allocated to
process 2. If the process finishes its burst before the time quantum timer expires, then it is swapped out of the
CPU just like the normal FCFS algorithm. If the timer goes off first, then the process is swapped out of the CPU
and moved to the back end of the ready queue.

6. If you are to develop a file management system, would you suggest the implementation of the
dynamic partitioning technique in memory management? Why or why not?
➢ If we have only two options Fixed and Dynamic partitioning scheme, then I would suggest implementing the
dynamic partitioning scheme. But if we can implement the more advanced technique of memory management
then there is no need for dynamic memory management as for files things require to be loaded from a hard
Grading Rubric: Downloaded by DATU AL-ANSARI UKO (ansariuko26@gmail.com)
 disk.

Grading Rubric: Downloaded by DATU AL-ANSARI UKO (ansariuko26@gmail.com)

 Criteria Performance Indicator Points
Content Correct ideas, concepts, and/or 3
examples were included.
Organization The presentation of idea was 2
generally organized.
TOTAL 5

05 Activity 1
Page 1 of 1

Powered by TCPDF (www.tcpdf.org)

Downloaded by DATU AL-ANSARI UKO (ansariuko26@gmail.com)