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?

Define approaches that require knowledge of the system state, Define approa...

Define approaches that require knowledge of the system state? Answer: Deadlock detection, Deadlock prevention, Deadlock Avoidance.

I have a multi threaded programing assignment , I need help

I need help

Describe internal layout of the file system in windows 2000, Describe the i...

Describe the internal layout of the file system in windows 2000. The basic entity in NTFS is a volume and a volume is created by the Windows 2000 disk administrator utility and

Page fault handling , Page Fault Handling conditions like, where the copy...

Page Fault Handling conditions like, where the copy on write bit of a page is set and that page is send by more than one process, the Kernel assign new page and copies the conten

Vybg, Vyvtvtn8

Vyvtvtn8

Estimation the number of input - output per second, Q. Remapping of bad bl...

Q. Remapping of bad blocks by sector sparing or else sector slipping could influence performance. Presume that the drive in Subsequent Exercise has a total of 100 bad sectors at r

Explain about error detection method, Q. Explain about Error detection meth...

Q. Explain about Error detection method? Error detection: error can occur in CPU, in I/O devices or in memory hardware. Operating system constantly needs to be aware of possi

Is it essential to bind a real-time thread to an lwp, Q. Presume an operati...

Q. Presume an operating system maps user-level threads to the kernel using the many-to-many model and the mapping is done through LWPs. Additionally the system allows developers to

Explain medium term scheduling, Medium term scheduling This is componen...

Medium term scheduling This is component of the swapping function. Usually the swapping in decision is based on the need to manage the degree of multiprogramming. At a system t

priority-based scheduling algorithm , Your task is to replace the round ro...

Your task is to replace the round robin CPU scheduling scheme you developed in Practical 6 with a priority-based scheduling algorithm. To simplify matters, you can maintain the ori

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages