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

What is the difference b/w multiprocessing and multitasking, What is the di...

What is the difference between multiprocessing and multitasking? Multi programming means implementing more than one program but here whenever the processor is idle during execu

Model, list trhe various classification of model and types?

list trhe various classification of model and types?

File system versus swap space, Q. What are the tradeoffs concerned in rerea...

Q. What are the tradeoffs concerned in rereading code pages from the file system versus using swap space to store them? Answer: If codes pages are accumulate in swap space th

Determine the value to be loaded in relocation register, Refer a program wi...

Refer a program with a linked origin of 5000. Suppose the memory area allocated to it have the start address of 70000. Determine the value to be loaded in relocation register?

Protection scheme in unix, Q. Consider a system that holds 5000 users. Pre...

Q. Consider a system that holds 5000 users. Presume that you want to allow 4990 of these users to be able to access one file. a. How would you denote this protection scheme in

Explain threads for executing concurrent application code, Explain Threads ...

Explain Threads for Executing Concurrent Application Code The thread has been introduced in many operating systems as an efficient mechanism for executing concurrent applicatio

Define seek time and latency time, Define seek time and latency time. T...

Define seek time and latency time. The time taken by the head to move to the appropriate cylinder or track is known as seek time. Once the head is at right track, it must wait

Develop the material requirements plan, The following information is availa...

The following information is available for three MPS (Master Product Scheduling) items: Product A An 80 unit order is to be started in Week 3.

Timers could be utilized to compute the current time, Q. Timers could be ut...

Q. Timers could be utilized to compute the current time. Provide a little description of how this could be accomplished. Answer: A program could utilize the following ap

Explain hashed page table method, Hashed page table method A general ap...

Hashed page table method A general approach for managing address spaces larger than 32 bits is to use a hashed page table with the hash values being the virtual-page number.

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages