Skip to main content

Frame Allocation Algorithm In Operating System

In this post we learn the basic algorithms of frame allocation.There are basically two algorithms for frame allocation :-
 1. Equal allocation.
 2. Proportional alloccation.

 1. Equal allocation :-
   The easiest way to split m number of frames among n processes is to give everyone an equal share, m/n frames ( ignoring frames needed by the O/S for that moment). As, if there is 93 frames and 5 processes, each process will get 18 frames. The 3 leftover frames can be used as a free-frame buffer pool. This scheme is called equal allocation.

DISADVANTAGE :-
 In a system with processes varying sizes, it does not make such sense to give each processes equal frames.
  Allocation of large number of frames to a small process will eventually lead to the wastage of large number of allocated unused frames.


2. Proportional alloccation.
    Consider a system with 1KB frame. If a smalll student process of 10KB and an interactivedatabase of 127KB are the inly two processes running in the system with 62 free frames, it does not make much sense to give each process 31 frames. the student process does not need more than 10 frames. So the other 21 are strictly speaking waste.
  To solve this problem we use a algorithm in which we allocate available memory to each process accoprding to its size.

For process Pi of size Si the number of allocated frames is
ai = ( Si / S) * m

where S is the sum of size of all processes and m is the number of frames in the system.
For above dicussed problem :-
S = 10 KB + 127 KB = 137 KB
Si = 10 KB
m = 62

ai = (10 / 137) *  62 = 4 frames.

and for other procss.
ai = (127 / 137) * 62 = 57 frames

ADVANTAGES :-
 All  the processes share the available frames according to their needs rather than equally.

Share, Follow and please comment if you find anything incorrect or to share more information about the topic discussed above.



Labels:

Comments

Post a Comment

Please comment.

Popular posts from this blog

Process Scheduling And Types of Process Schedular :-

        ⇰ PROCESS SCHEDULING Process Scheduling  is a task  of Operating System that schedules processes of different states like new, ready, waiting, terminated  and running.This scheduling helps in allocation of CPU time for each process, and Operating System allocates the CPU time for each procss. And the process scheduling plays important role to keep the CPU busy all the time.  ⏩   Followings are some objectives of Process Scheduling :-  i > To increase the amount of users within acceptable response times.  ii > To maintain the balance between response and utilization of system. iii > To decrease the enforce priorities and  give reference to the processes holding the key resources.      ⇰  PROCESS SCHEDULAR A scheduler carries out the pro cess scheduling work. Schedulers are often implemented so they keep all computer resources busy and  allows multiple users to share system resources  to achieve  multiprogramming .  There are  mainy three types of pro
8 comments
Read more

Process & Its state And process control block :-

                ⇰  PROCESS :- A process can be thought of as a program in execution. Means when any program is executed it becomes process. A processwill need certain resources such as CPU time , memory, files and I/O devices to complete its task. These resources are allocated to the process either when it is created or at the time of execution.             A process is the unit of work in most systems. A system consistes of a collection of processes. All these processes may execute concurrently. Traditionally a process contained only a single thread. Most modern operating ststems now supports processes that have multiple threads.         The operating system is responsible for several important works of process management as - the creation and deletion of process, the schrduling of process, communication and deadlock handling of process. Process is broudly divided into two types:-  i> System  Process. ii> User Process. Early computers allowed only one program be ex
Post a Comment
Read more

Semaphores In Process Synchronization

   ⇰  Semaphores :-   Semaphore is actually a method or tool to prevent race condition. Race condition can cause loss of data or even deadlock situation. For prevention from these conditions, the semaphore is one of the method.  Semaphore was proposed by Dijkstra in 1965. Simaphore    is a very significant technique to manage concurrent processes.  Semaphore is useful tool in the prevention of race condition. But the use of semaphore never means a guarantee that a program is free from these problems.     Semaphore is an integer variable which is used in mutual exclusive manner by various concurrent cooperative processes in order to acheive synchronization. Hence semaphore is one of the way to achieve synchronization.  Semaphore is basically  a variable which is non-negative and shared between threads. This variable is used to solve the critical section problem and to achieve process synchronization in the multiprocessing environment. Semaphore contains some operations as f
Post a Comment
Read more