Explain drawbacks of fixed partitioning, Operating System

Assignment Help:

The drawbacks of fixed partitioning are:

The number of partitions are précised at system generation time limits the number of active processes in the system.
For the reason that partition sizes are preset at system generation time, small jobs will not make use of partition space efficiently. In an environment wherever the main storage requirement of all jobs is known beforehand, this perhaps reasonable, although in many cases, it is an incompetent technique.

The use of portioning is approximately unknown today. An instance of OS which use this technique was an IBM mainframe operating system OS/MFT.

Related Discussions:- Explain drawbacks of fixed partitioning

Find the number of drives in the jukebox, Q. In a disk jukebox what would b...

Q. In a disk jukebox what would be the result of having more open files than the number of drives in the jukebox? Answer: Two bad results could result. One likelihood is star

Define a layer that is not of an io management module, Define a layer that ...

Define a layer that is not of an IO management module MCS that is Management Control System is not of an IO management module

What is the main problem with the fcfs scheme, Question : a) Consider ...

Question : a) Consider table 1.0 below, assume the processes arrived in the order P 1 , P 2 , P 3 , P 4 at time shown and need the indicated burst time (both in milliseconds)

Deadlock involving only one single process, Is it probable to have a deadlo...

Is it probable to have a deadlock involving only one single process? Describe your answer. Answer: No This pursue directly from the hold-and-wait condition.

Packets and time division multiplexing (tdm), Broken data into small packet...

Broken data into small packets allow time division multiplexing. In TDM every packet leaves the sender and is switched on the shared interaction channel through a multiplexer. At t

Estimate the balking rate, People arrive at a barber shop at the rate of on...

People arrive at a barber shop at the rate of one every 4.5 minutes. If the shop is full (it can hold five people altogether), 30% of the potential customers leave and come back i

What are the various page replacement algorithms, What are the various page...

What are the various page replacement algorithms used for page replacement? FIFO page replacement Optimal page replacement LRU page replacement LRU approximat

Context switching, short note on context switching

short note on context switching

Explainoptimal page replacement in detail, Optimal page replacement An...

Optimal page replacement An optimal page replacement algorithm has the least page fault rate of all algorithms. The algorithm states that put back the page that will not be us

Mechanism for code and data sharing, Q. Consider a system in which a progr...

Q. Consider a system in which a program is able to be separated into two parts: code and data. The CPU recognizes whether it wants an instruction (instruction fetch) or data (data

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages