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