Explain variable partitioning in memory management, Operating System

Assignment Help:

VARIABLE PARTITIONING

We can differ the partitions and change the location according to the size of the process.

50k

40k

30k

20k

10k

Here if a 10k process enters we are able to make a space of 10k for that process. According to the process enters we are able to divide the memory into several partitions If one process is over the space for that will be free. This free space is called as hole. If another process come of smaller than the size of the free space that will move to the free space.

Related Discussions:- Explain variable partitioning in memory management

Linux, shell script that accepts two directory names as arguments and delet...

shell script that accepts two directory names as arguments and delete those file in the second directory that are identical to the file in the first

Describe the file system architecture, Describe the file system architectur...

Describe the file system architecture. File System Architecture contains the subsequent components:- Device Driver 1 Device Driver 2 Device Driver 3 Basic fi

Named pipes, What is named pipes?

What is named pipes?

Explain types of file allocation- linked list allocation, Linked list alloc...

Linked list allocation: At this time the blocks are stored using linked lists. The block size require not be the same. Thus internal fragmentation is avoided. Consider

Write a short note on disk structure, Write a short note on disk structure ...

Write a short note on disk structure Modern disk drives are initiate as large one dimensional array of logical blocks where the logical block is the smallest unit of transfer.

Explain resource allocation graph, RESOURCE ALLOCATION GRAPH When a pro...

RESOURCE ALLOCATION GRAPH When a process Pi wishes an instance of resource type Rj, a request edge is inserted in the resource allocation graph. When this request is able to be

What is segmentation?, What is segmentation? In a segmented memory mana...

What is segmentation? In a segmented memory management scheme a programmer views a program to be collection of program components called as segments. Every segment is a logical

Objective, what are the objective of operating system assignment

what are the objective of operating system assignment

Explain two-phase locking protocol, Q. Show that a few schedules are possib...

Q. Show that a few schedules are possible under the two-phase locking protocol however not possible under the timestamp protocol and vice versa. Answer: A schedule that is auth

Address binding at load time, address binding at load time

address binding at load time

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages