Purpose of the Modify Bit in a Page Table

In virtual memory, each page table entry contains not only an address mapping but also control and status metadata such as the present bit, protection bits, accessed bit, and the modify bit—also called the dirty bit. Its primary purpose is to record whether a page has been changed while resident in main memory.2

This bit is crucial because the operating system must know whether an evicted page needs to be written back to its backing store before reuse of the physical frame. If the page has not been modified, the copy already on disk is still valid, so the OS can discard the in-memory copy without an expensive disk write.3

In short, the modify bit exists to optimize page replacement, reduce unnecessary I/O, and preserve correctness during eviction.2

A useful way to frame its role is this:

$$\text{Eviction cost} = \begin{cases} \text{read replacement page only}, & \text{if modify bit} = 0 \\ \text{write old page} + \text{read replacement page}, & \text{if modify bit} = 1 \end{cases}$$

3

Footnotes

1. Dirty bit - Wikipedia - Defines the dirty/modified bit and explains its role in page replacement and write-back decisions. ↩ ↩² ↩³ ↩⁴

2. Page Table Design - CS 61C Course Notes - Explains valid bits, dirty bits, and write-back behavior in virtual memory. ↩ ↩²

3. Operating Systems: Virtual Memory - Describes how the modify bit reduces page replacement cost and why clean pages are attractive eviction targets. ↩ ↩² ↩³

4. Valid Bit and Dirty Bit in page tables - Stack Overflow - Concise explanation of why dirty bits prevent needless write-back and expensive comparisons. ↩

Where the Modify Bit Fits in a Page Table Entry

A page table maps a virtual page number to a physical frame number and stores status fields that guide access and memory-management policy.2 Common fields include:

The modify bit is typically set when a store operation targets the page. On many architectures, the hardware memory-management unit or related translation mechanism updates this status automatically when a write occurs.3 Linux kernel documentation similarly describes the dirty bit as indicating that the page has been modified since it was loaded into memory.

This distinction matters because a page can be:

1. Present and clean: in RAM, unchanged relative to disk.2
2. Present and dirty: in RAM, modified, so disk is stale.2
3. Not present: not currently in RAM, requiring a page fault to access.

The modify bit therefore acts as a compact synchronization signal between RAM and disk-backed state.2

Footnotes

1. Page Tables — The Linux Kernel documentation - Notes that the dirty bit is set when a page is written and indicates modification since load. ↩ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷

2. Page Table Management - Reviews page table entry fields, including protection and status bits such as dirty and accessed. ↩ ↩²

3. Page Table Design - CS 61C Course Notes - Explains valid bits, dirty bits, and write-back behavior in virtual memory. ↩ ↩² ↩³

4. Organization of Computer Systems: Processor & Datapath - Explains how reference and dirty bits are updated in TLB/page-table workflows. ↩ ↩²

5. Dirty bit - Wikipedia - Defines the dirty/modified bit and explains its role in page replacement and write-back decisions. ↩ ↩² ↩³ ↩⁴

6. Operating Systems: Virtual Memory - Describes how the modify bit reduces page replacement cost and why clean pages are attractive eviction targets. ↩ ↩²

Why the Modify Bit Improves Efficiency

The main optimization is avoidance of unnecessary write-back traffic.2 Suppose a page is loaded from disk, read several times, and then evicted without ever being written. Writing it back would waste time and I/O bandwidth because the disk already contains the same content.2

This is especially important because page-fault handling may already require significant latency. If the victim page is dirty, replacement may require both:

• writing the old page out, and
• reading the new page in.

That can effectively add an extra I/O step to page replacement. Therefore, systems often prefer clean pages as eviction victims when possible.

A conceptual cost table is:

This optimization aligns with a write-back policy rather than write-through. Virtual memory systems commonly rely on write-back behavior and use the dirty bit to make it safe.2

Footnotes

1. Dirty bit - Wikipedia - Defines the dirty/modified bit and explains its role in page replacement and write-back decisions. ↩ ↩² ↩³ ↩⁴

2. Operating Systems: Virtual Memory - Describes how the modify bit reduces page replacement cost and why clean pages are attractive eviction targets. ↩ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶

3. Valid Bit and Dirty Bit in page tables - Stack Overflow - Concise explanation of why dirty bits prevent needless write-back and expensive comparisons. ↩

4. Page Table Design - CS 61C Course Notes - Explains valid bits, dirty bits, and write-back behavior in virtual memory. ↩ ↩²

5. Page Tables — The Linux Kernel documentation - Notes that the dirty bit is set when a page is written and indicates modification since load. ↩

Relationship Between Modify Bit and Other Bits

The modify bit should not be confused with the valid bit or the accessed bit.3

• The valid/present bit answers: “Is this page currently in RAM?”
• The accessed/reference bit answers: “Has this page been used recently?”2
• The modify/dirty bit answers: “Has this page been written since it was loaded?”2

These bits support different operating-system decisions:

A page may be accessed many times but remain clean if all accesses are reads. Conversely, a single write is enough to make the page dirty.2

3

Footnotes

1. Page Table Design - CS 61C Course Notes - Explains valid bits, dirty bits, and write-back behavior in virtual memory. ↩ ↩² ↩³ ↩⁴

2. Page Tables — The Linux Kernel documentation - Notes that the dirty bit is set when a page is written and indicates modification since load. ↩ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶

3. Organization of Computer Systems: Processor & Datapath - Explains how reference and dirty bits are updated in TLB/page-table workflows. ↩ ↩² ↩³ ↩⁴

4. Dirty bit - Wikipedia - Defines the dirty/modified bit and explains its role in page replacement and write-back decisions. ↩ ↩² ↩³

5. Operating Systems: Virtual Memory - Describes how the modify bit reduces page replacement cost and why clean pages are attractive eviction targets. ↩ ↩²

A Precise Answer to the Question

The purpose of the modify bit in a page table is to indicate whether a page in physical memory has been altered since it was loaded from disk or other backing storage.2 The operating system uses this information during page replacement:

• if the bit is 0, the page is clean and can usually be discarded without writing it back;2
• if the bit is 1, the page is dirty and must be written back before eviction so that modifications are not lost.3

Therefore, the modify bit serves both correctness and performance:

• correctness, because modified data must not be lost;2
• performance, because unmodified pages should not trigger needless disk writes.3

Footnotes

1. Dirty bit - Wikipedia - Defines the dirty/modified bit and explains its role in page replacement and write-back decisions. ↩ ↩² ↩³ ↩⁴ ↩⁵

2. Page Tables — The Linux Kernel documentation - Notes that the dirty bit is set when a page is written and indicates modification since load. ↩ ↩² ↩³

3. Page Table Design - CS 61C Course Notes - Explains valid bits, dirty bits, and write-back behavior in virtual memory. ↩

4. Operating Systems: Virtual Memory - Describes how the modify bit reduces page replacement cost and why clean pages are attractive eviction targets. ↩ ↩²

5. Valid Bit and Dirty Bit in page tables - Stack Overflow - Concise explanation of why dirty bits prevent needless write-back and expensive comparisons. ↩