Paging concept and page tables in Operating Systems - Time & Space Complexity

Time Complexity: Paging concept and page tables

O(1)

Understanding Time Complexity

When using paging in operating systems, we want to know how the time to find data grows as the memory size increases.

We ask: How does looking up a page in the page table change when the number of pages grows?

Scenario Under Consideration

Analyze the time complexity of the following page table lookup process.

function getPhysicalAddress(virtualAddress) {
  pageNumber = Math.floor(virtualAddress / pageSize);
  offset = virtualAddress % pageSize;
  frameNumber = pageTable[pageNumber];
  physicalAddress = frameNumber * pageSize + offset;
  return physicalAddress;
}
    

This code finds the physical memory address by looking up the page number in the page table and adding the offset.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Accessing the page table array at the index of the page number.
• How many times: Exactly once per address translation.

How Execution Grows With Input

Looking up a page number in the page table takes the same steps no matter how many pages there are.

Input Size (number of pages)	Approx. Operations
10	1 lookup
100	1 lookup
1000	1 lookup

Pattern observation: The time to find a page does not increase as the number of pages grows.

Final Time Complexity

Time Complexity: O(1)

This means the time to translate a virtual address to a physical address stays constant, no matter how big the memory is.

Common Mistake

[X] Wrong: "Looking up a page takes longer as the number of pages grows because the page table gets bigger."

[OK] Correct: The page table is an array, so accessing any page number is done directly by index, which takes the same time regardless of size.

Interview Connect

Understanding that page table lookups are constant time helps you explain how operating systems manage memory efficiently, a key skill in system design discussions.

Self-Check

"What if the page table was implemented as a linked list instead of an array? How would the time complexity change?"

Practice

1. What is the main purpose of paging in an operating system?

easy

A. To encrypt data in memory

B. To increase the CPU clock speed

C. To manage input/output devices

D. To divide memory into fixed-size blocks called pages

Solution

1. Step 1: Understand the concept of paging

   Paging divides the computer's memory into fixed-size blocks called pages to simplify memory management.

2. Step 2: Identify the main purpose

   The main goal is to break memory into pages, not to affect CPU speed, encryption, or device management.

3. Final Answer:

   To divide memory into fixed-size blocks called pages -> Option D

4. Quick Check:

   Paging = dividing memory into pages [OK]

Hint: Paging means splitting memory into equal blocks [OK]

Common Mistakes:

• Confusing paging with CPU speed improvement
• Thinking paging encrypts memory data
• Mixing paging with device management

2. Which of the following correctly describes a page table?

easy

A. A table that stores the mapping from virtual pages to physical frames

B. A list of all running processes in the system

C. A table that stores CPU instructions

D. A list of input/output devices connected to the system

Solution

1. Step 1: Define the role of a page table

   A page table maps virtual memory pages to physical memory frames, helping the OS locate data.

2. Step 2: Eliminate incorrect options

   Page tables do not list processes, CPU instructions, or devices.

3. Final Answer:

   A table that stores the mapping from virtual pages to physical frames -> Option A

4. Quick Check:

   Page table = virtual to physical mapping [OK]

Hint: Page tables map virtual pages to physical memory [OK]

Common Mistakes:

• Confusing page tables with process lists
• Thinking page tables store CPU instructions
• Mixing page tables with device lists

3. Consider a system with a page size of 4 KB and a virtual address 0x1A3F. Which part of the address identifies the page number?

medium

A. The lower 12 bits

B. The middle 8 bits

C. The higher bits except the lower 12 bits

D. The entire 16 bits

Solution

1. Step 1: Calculate bits for page offset

   Page size is 4 KB = 2^12 bytes, so lower 12 bits represent the offset within a page.

2. Step 2: Identify page number bits

   The page number is given by the higher bits of the address excluding the lower 12 bits (offset).

3. Final Answer:

   The higher bits except the lower 12 bits -> Option C

4. Quick Check:

   Page number = address bits above offset bits [OK]

Hint: Page offset = log2(page size) bits; rest is page number [OK]

Common Mistakes:

• Confusing offset bits with page number bits
• Using entire address as page number
• Selecting wrong bit segments

4. A page table entry is missing for a virtual page, causing a page fault. What is the most likely cause?

medium

A. The CPU clock speed is too low

B. The page is not currently loaded in physical memory

C. The virtual address is invalid

D. The page size is too large

Solution

1. Step 1: Understand what causes a page fault

   A page fault occurs when the page table does not have an entry for the requested virtual page, meaning it is not in physical memory.

2. Step 2: Eliminate unrelated causes

   CPU speed, invalid address, or page size do not directly cause missing page table entries.

3. Final Answer:

   The page is not currently loaded in physical memory -> Option B

4. Quick Check:

   Page fault = missing page in physical memory [OK]

Hint: Page fault means page not in physical memory [OK]

Common Mistakes:

• Blaming CPU speed for page faults
• Assuming invalid address always causes page fault
• Confusing page size with page fault cause

5. In a system with 32-bit virtual addresses and 4 KB page size, how many entries does a single-level page table have?

hard

A. 1,048,576 entries

B. 4,096 entries

C. 65,536 entries

D. 16,384 entries

Solution

1. Step 1: Calculate number of pages

   Page size = 4 KB = 2^12 bytes, virtual address size = 32 bits.

2. Step 2: Calculate entries in page table

   Number of pages = 2^(32 - 12) = 2^20 = 1,048,576 entries.

3. Final Answer:

   1,048,576 entries -> Option A

4. Quick Check:

   Entries = 2^(address bits - offset bits) [OK]

Hint: Entries = 2^(virtual bits - page offset bits) [OK]

Common Mistakes:

• Using page size directly as number of entries
• Confusing total address bits with offset bits
• Calculating entries incorrectly as 2^16 or 2^14