Partition allocation scheme in OS

-

        Partition allocation scheme

  • when there is more than one partition freely available to accommodate a process’s request, a partition must be selected.
  •  To choose a particular partition, a partition allocation method is needed. A partition allocation method is considered better if it avoids internal fragmentation.

Below are the various partition allocation schemes :
1. First Fit: In the first fit, the partition is allocated which is first sufficient block from the top of Main Memory.
2. Best Fit Allocate the process to the partition which is the first smallest sufficient partition among the free available partition.
3. Worst Fit Allocate the process to the partition which is the largest sufficient among the freely available partitions available in the main memory.
4. Next Fit Next fit is similar to the first fit but it will search for the first sufficient partition from the last allocation point.
Is Best-Fit really best?
Although best fit minimizes the wastage space, it consumes a lot of processor time for searching the block which is close to the required size. Also, Best-fit may perform poorer than other algorithms in some cases. For example, see below exercise.

Exercise: Consider the requests from processes in given order 300K, 25K, 125K and 50K. Let there be two blocks of memory available of size 150K followed by a block size 350K.
Which of the following partition allocation schemes can satisfy above requests?
A) Best fit but not first fit.
B) First fit but not best fit.
C) Both First fit & Best fit.
D) neither first fit nor best fit.
Solution: Let us try all options.
Best Fit:
300K is allocated from block of size 350K. 50 is left in the block.
25K is allocated from the remaining 50K block. 25K is left in the block.
125K is allocated from 150 K block. 25K is left in this block also.
50K can’t be allocated even if there is 25K + 25K space available.
First Fit:
300K request is allocated from 350K block, 50K is left out.
25K is be allocated from 150K block, 125K is left out.
Then 125K and 50K are allocated to remaining left out partitions.
So, first fit can handle requests.
So option B is the correct choice.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above
Thank you viewers ..
Author - soumysinha1002@gmail.com

Comments

Post a Comment

Popular posts from this blog

Introduction of Digital computer

-
Image
INTRODUCTION Digital computer concept:- 1. Digital computers are designed to store, process and communicate information in digital form. 2. Digital computer is any of a class of digital devices capable of solving problems by processing information in discrete form. 3. It is used for processing data represented by discrete, localized physica signals, as the presence or electic current. 4.The main three components of digital computer:- >input:- The user gives a set of input data through input devices. >Processing :- The input data is processed with the help of CPU by well defined and finite sequence of step. >Output : - Some data available from the processing step are output to the user. TYPE OF DIGITAL COMPUTER :- 1.Microcomputer/Desktop computer 2.Minicomputer 3.Mainframe computer 4.Supercomputers Microcomputer :- 1.Microcomputer is also called a personal computer or desktop computer. 2.It includes a microprocessor, memory, and
Read more

INTRODUCTION OF DBMS

-
What is Database :- The database is a collection of inter-related data which is used to retrieve, insert and delete the data efficiently. It is also used to organize the data in the form of a table, schema, views, and reports, etc. For example: The college Database organizes the data about the admin, staff, students and faculty etc. Using the database, you can easily retrieve, insert, and delete the information. DBMS (Database Management System):- Database management system is a software which is used to manage the database. For example: MySQL, Oracle, etc are a very popular commercial database which is used in different applications.DBMS provides an interface to perform various operations like database creation, storing data in it, updating data, creating a table in the database and a lot more.It provides protection and security to the database. In the case of multiple users, it also maintains data consistency. DBMS allows users the following tasks:- Data Definition: I
Read more

Introduction to cache memory

-
Image
Cache Memory in Computer Organization Cache Memory  is a special very high-speed memory. It is used to speed up and synchronizing with high-speed CPU. Cache memory is costlier than main memory or disk memory but economical than CPU registers. Cache memory is an extremely fast memory type that acts as a buffer between RAM and the CPU. It holds frequently requested data and instructions so that they are immediately available to the CPU when needed. Cache memory is used to reduce the average time to access data from the Main memory. The cache is a smaller and faster memory which stores copies of the data from frequently used main memory locations. There are various different independent caches in a CPU, which stored instruction and data. Levels of memory: Level 1 or Register – It is a type of memory in which data is stored and accepted that are immediately stored in CPU. Most commonly used register is accumulator, Program counter, address register etc. Level 2 or Cac
Read more