21.3.2. Allocation Schemes Types

Each process at any given point in time will require a minimum number of frames to be allocated to it, because these frames will contain the active pages that this process needs at any time.

Every executing process requires certain pages of memory to perform tasks. For instance, when a process is running, it needs to access instructions and data from memory. If a process doesn't have enough allocated frames, it won't have the necessary pages in memory, leading to frequent interruptions known as page-faults. Therefore, it's crucial that each process is allocated a minimum number of frames to ensure efficient execution without excessive delays due to memory access issues.

Imagine trying to cook a meal in a kitchen with only two plates when you need at least four for all the ingredients. If you keep running out of plates, you'll have to constantly wash them before you can continue cooking, which slows you down. Similarly, a process needs enough memory frames (like plates) to work efficiently.

Allocation schemes are typically of two types: fixed allocation and priority-based allocation, with many variations of each.

When it comes to allocating memory frames, two primary methods exist: fixed allocation and priority-based allocation. Fixed allocation involves giving a set number of frames to each process evenly, regardless of their needs. For instance, if there are 100 frames and 5 processes, each process might receive 20 frames. This can lead to inefficient use since larger processes might need more frames than smaller ones. On the other hand, priority-based allocation gives frames based on the priority of each process. Higher priority processes get more frames, ensuring they perform better.

Think of a bus service that has a fixed number of seats (fixed allocation). If 5 buses operate, each gets the same number of seats, regardless of how many passengers typically need to ride on each bus. If one bus is always full (a high-priority bus), it would benefit more from additional seats (priority-based allocation) to accommodate all passengers comfortably.

In a fixed allocation scheme, if you have 100 page frames and 5 processes, you allocate 20 frames to each process.

In the fixed allocation scheme, resources are divided equally among all processes, regardless of their specific needs. This is a straightforward approach, where the total number of frames is simply divided by the number of processes. While it sounds fair, this method can lead to issues. A process requiring more frames may struggle, while smaller, less demanding processes might have surplus frames, wasting memory resources.

Imagine a group of students sharing a limited number of laptops for a project. If each student is given an equal share of laptops, but one student requires more to work efficiently (e.g., video editing software), they may struggle to complete their task. Meanwhile, another student who only needs a simple text editor may have extra laptops that aren't needed.

In proportional allocation, frames are allocated based on the size of the processes, ensuring that larger processes receive the resources they need.

Proportional allocation is a more dynamic approach to frame distribution. Instead of dividing frames equally, it allocates them based on the size or demand of the process. This means that larger processes, which require more frames to operate efficiently, receive more frames. This method adapts to changes in process size and needs, leading to better overall performance and resource utilization.

Imagine a banquet where guests are provided food based on their appetites. Some guests can eat more, while others need less. If food (like memory frames) is distributed proportionally to appetite, everyone gets enough to enjoy their meal without waste. Larger appetites get more food while smaller ones are satisfied with less.

Using a priority-based allocation scheme, we can allocate higher numbers of frames to high-priority processes while making low-priority processes suffer.

Priority-based allocation focuses on giving more resources to processes that are deemed more important, often leading to improved performance for those high-priority tasks. This approach means that when a low-priority process runs out of frames, it may have to wait longer for resources compared to a high-priority process, which is favored in allocation. This system enhances the efficiency of critical applications, ensuring they run smoothly while potentially disadvantaging less critical tasks.

Consider a hospital emergency room where patients are treated based on the severity of their conditions. Critical patients receive immediate care (higher priority), while those with less serious issues wait longer. This prioritization ensures that those in dire need get help first, improving overall health outcomes.

In local frame allocation, page replacement considers only the frames allocated to the given process, while in global allocation, any frame in the system may be used for replacement.

Local frame allocation restricts frame replacement to only those allocated to a specific process, which can help avoid interfering with other processes. However, this can also lead to inefficiencies if a process is unable to quickly find a suitable frame for replacement. Conversely, in global frame allocation, the system allows any process to utilize any available frame for replacement, enhancing flexibility and potentially improving utilization but at the cost of increased complexity and shared resources.

Think of a library where each person (process) has a specific section of shelves (frames) for their books. In a local allocation, you can only remove books from your section, while in a global system, anyone can borrow books from any section as long as it's allowed. This can make finding the right book faster but might lead to conflicts if too many people are looking for the same book.

--