How is memory management done using bit maps?, Operating System

Assignment Help:

How is memory management done using bit maps?

A bit map is here in this we signify the bit value as 0 or 1.

1-hole

0-process

In this we are able to represent the process and hole separately. In one line of this bit map will have eight spaces

!!!

!!!

!!!

!!!

!!!

!!!

!!!

!!!

!!!

!!!

!!!

!!!

!!!

!!!!

!!!

!!!

!!!

1         2       3     4     5     6        7       8      9       10      11     12    13    14    15    16    17      

Here the red colored shows free holes in he bit map we are able to represent this as follows

1

1

1

1

1

0

0

0

1

1

1

0

0

0

1

1

1

 

 

 

 

 

 

 

1-represents a process

0-repressents a hole


Related Discussions:- How is memory management done using bit maps?

Networking tidbits, There is a very small amount of networking background r...

There is a very small amount of networking background required for Project 2. In Project 2, we want our computer (or our "host") to request information over the Internet from a rem

File system, what are disadvantages of using single directory

what are disadvantages of using single directory

Explain lru enhanced second chance algorithm, Enhanced Second chance algori...

Enhanced Second chance algorithm In this a modify bit is as well used. Now if the ordered pair of reference and modify is (0,0) neither recently used nor modified - the best

Explain the various methods for handling deadlocks, Explain the various met...

Explain the various methods for handling deadlocks.      A set of processes is deadlocked if every process in the set is waiting for an event that only a process in the

Define the tlsfree(tlsindex) function, Define the TlsFree(TLSIndex) Functio...

Define the TlsFree(TLSIndex) Function This function should be called to free a TLSindex allocated by TlsAlloc. It would be executed when there are no more threads in a process

Explain about memory-management scheme, Q. In the IBM/370 memory protectio...

Q. In the IBM/370 memory protection is offered through the use of keys. A key is a 4-bit quantity every 2K block of memory has a key (the storage key) associated with it. The CPU

THREADS, advantage and dis advantage of threads

advantage and dis advantage of threads

Define lru page replacement policy, Define ‘LRU’ page replacement policy ...

Define ‘LRU’ page replacement policy LRU is Least Recently Used page replacement policy.

What are the different methods for handling deadlocks?, What are the differ...

What are the different methods for handling deadlocks? Deadlock detection and recovery: Permit the system to enter a deadlock state, detect it and after that rec

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