Skip to main content

Single partition allocation, Multiple-partition allocation and Fixed Equal-size partitions in operating system-computer world

 Single partition allocation, Multiple-partition allocation and Fixed Equal-size partitions in operating system


Single partition allocation

In this scheme operating system is residing in law memory and user process are executing in higher memory.

Advantages

  1. It is simple 
  2. It is easy to understand and use

Disadvantages

  1. User job is limited to the size of available memory.
  2. It leads to poor Utilization of processor and memory.

Multiple-partition allocation 

It is the simplest method for allocating  memory is divided memory into several fixed size partitions.

Fixed Equal-size partitions

It divides the main memory Into equal number of fixed sized partitions, operating system occupies some fixed portion and remaining portion of main memory is available for user processes.

Advantages

  1. It supports multi programming.
  2. A process whose size is less then or equal to the partitions size can be loaded into any available partition.

Disadvantages

  1. If a program is big to fit into a partition use overlay technique.
  2. Memory use is efficient.
  3. Fixed variable size partitions
  4. By using fixed variable size petitions we can overcome the disadvantage present in fixed equal size petitioning. With unequal-size partitions, there are two ways to assign processes to partitions.

Use multiple queues

One queue is present in each and every process. When a new process is to arrive it will put in the queue it is able to fit without wasting the memory space, irrespective of other blocks queues.

Use single queue

In this method only one ready queue is present for scheduling the jobs for all the blocks irrespective of size. 

Comments

Post a Comment

Popular posts from this blog

Deadlock in operating system-computer world

  Deadlock in operating system-computer world Deadlock :  In a multi-programming environment, many process may complete for a minute number of resources. A process make a request for a resource and if the resource is not available at that time, the process enter In a waiting state. A waiting state process is never again-able to change state because the resource it has requested is held by other waiting process. This situation is called deadlock. So we can say that a process is said to be deadlock when it is waiting for an event or resources which will never occurs.   so we can say that in this situation none of the process gets executed  since the resource it needs, is held by some other process which is also waits for some other resource to be released.  Let's assume that there are three process P1, P2, p3 and three different resources R1, R2 and R3. R1 is assigned to p1, R2 is assigned to P2 and R3 is assigned to P3.   After sometime P1 demands for R1 which is being used by  P2.
9 comments
Read more

CPU scheduling in operating system-computer world

  CPU scheduling in operating system CPU scheduling :  Whenever the CPU becomes idle, the operating system must select one of the processes. The selection process is carried by the short-term scheduler. The scheduler selects a process from the processes in memory that that are ready to execute and allocate the CPU to that process. The objective of time sharing is to skip the CPU among processes that user interact with each program while the program is in running position. As we discuss above the process scheduler selects an process for execution on the CPU. There will never more then one running process for a single processor system. If there are many processes, the process will have to wait until the CPU is free CPU Scheduling is basis of multi-programming operating system. In CPU scheduling many processes are kept in memory at a time. The CPU scheduler select a process from the many processes. The process scheduler scheduled different processes to be assigned to the CPU based on part
3 comments
Read more