Explain fixed partitioning techniques, Operating System

Assignment Help:

FIXED PARTITIONING

In a fixed partitioning, the operating system inhabiting some fixed portion of main memory is available for use of multiple processes

-Using fixed partitioning we are able to allocate the memory

-Here we can divide the memory into some fixed partitions

-Each partition may possibly not be of the size

-For every partition we have an input queue

-If we have the process enters

Analyze the process as well as choose the smallest partition in the memory for that to be properly fitted. That is the smallest portion in the memory which can fit that process in it properly.

Two difficulties: 

  1. The programmer may possibly have to rewrite a program in order to fit into even the largest available partition.  Overlaying may perhaps be used. 
  2. Internal fragmentation usually a result there's memory that is unused within every partition.

 


Related Discussions:- Explain fixed partitioning techniques

What is the basic function of assembler, Q. What is the basic function of A...

Q. What is the basic function of Assembler ? Input to an assembler is an assembly language program. Output is an object program and information which enables the loader to prep

Unix , A friend has promised to log in at a particular time. However, he ne...

A friend has promised to log in at a particular time. However, he needs to be contacted as soon as he logs in. The shell script checks after every minute whether he has logged in o

State in a deadlock-avoidance system, Question: In a deadlock, processe...

Question: In a deadlock, processes never finish executing and system resources are tied up, preventing other jobs from starting. Deadlocks can be characterised by a set of cond

Define an imperative statement, Determine an imperative statement Imper...

Determine an imperative statement Imperative statement points out an action to be carried out during execution of assembled program

Implementation of locks, How could we implement locks? No matter how we cho...

How could we implement locks? No matter how we choose to implement them, we must have some hardware support. One possibility for implementing locks on a uniprocessor machine is is

Memory management unit, When a program issues a memory load or store operat...

When a program issues a memory load or store operation, the virtual addresses (VAs) used in those operations have to be translated into "real" physical memory addresses (PAs). This

Mention some attractive properties of semaphore?, Mention some attractive p...

Mention some attractive properties of semaphore?              The Semaphores aren't provided by hardware. However they have numerous attractive properties: Machine indep

Real time operating system, PART A Question 1 Using your own words...

PART A Question 1 Using your own words, explain what a continuous random variable and a continuous probability density function are. Give examples. Question 2 Gi

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd