Mutex locks in Operating Systems - Time & Space Complexity

Time Complexity: Mutex locks

O(n)

Understanding Time Complexity

When using mutex locks, it is important to understand how the time to complete tasks changes as more threads try to access shared resources.

We want to know how locking affects the speed when many threads compete for the same lock.

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

mutex_lock(&lock);
// critical section code
for (int i = 0; i < n; i++) {
  // perform operation
}
mutex_unlock(&lock);
    

This code locks a mutex before running a loop of n operations, then unlocks it after.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: The loop inside the locked section runs n times.
• How many times: The loop runs once per lock acquisition, but the lock blocks other threads until it is released.

How Execution Grows With Input

As n grows, the time spent inside the locked section grows linearly because the loop runs n times.

Input Size (n)	Approx. Operations
10	About 10 operations inside the lock
100	About 100 operations inside the lock
1000	About 1000 operations inside the lock

Pattern observation: The time inside the lock grows directly with n, so doubling n roughly doubles the time.

Final Time Complexity

Time Complexity: O(n)

This means the time to complete the locked section grows in a straight line as the number of operations increases.

Common Mistake

[X] Wrong: "Mutex locks add no delay regardless of how many threads wait."

[OK] Correct: When many threads wait for the lock, they queue up and wait their turn, which adds waiting time and slows overall progress.

Interview Connect

Understanding how mutex locks affect time helps you explain thread synchronization and performance in real systems, a key skill for many roles.

Self-Check

What if the critical section code inside the lock was replaced with a constant-time operation? How would the time complexity change?

Practice

1. What is the main purpose of a mutex lock in operating systems?

easy

A. To store data permanently on the disk

B. To speed up the execution of multiple processes simultaneously

C. To allow only one process to access a shared resource at a time

D. To create multiple copies of a resource for each process

Solution

1. Step 1: Understand the role of mutex locks

   Mutex locks are used to control access to shared resources so that only one process can use the resource at a time.

2. Step 2: Identify the correct purpose

   The main goal is to prevent conflicts and errors by ensuring exclusive access, which matches To allow only one process to access a shared resource at a time.

3. Final Answer:

   To allow only one process to access a shared resource at a time -> Option C

4. Quick Check:

   Mutex = exclusive access [OK]

Hint: Mutex means one user at a time [OK]

Common Mistakes:

• Thinking mutex speeds up all processes
• Confusing mutex with data storage
• Believing mutex duplicates resources

2. Which of the following is the correct sequence when using a mutex lock?

easy

A. Acquire the lock, use the resource, then release the lock

B. Release the lock, use the resource, then acquire the lock

C. Use the resource, acquire the lock, then release the lock

D. Use the resource, release the lock, then acquire the lock

Solution

1. Step 1: Recall the correct mutex usage order

   To safely use a shared resource, a process must first acquire the mutex lock before accessing it.

2. Step 2: Complete the sequence

   After using the resource, the process must release the lock so others can access it. This matches Acquire the lock, use the resource, then release the lock.

3. Final Answer:

   Acquire the lock, use the resource, then release the lock -> Option A

4. Quick Check:

   Acquire -> Use -> Release [OK]

Hint: Always lock before use, unlock after [OK]

Common Mistakes:

• Releasing before acquiring
• Using resource without locking
• Locking after using resource

3. Consider this pseudocode using a mutex lock:

mutex.lock()
shared_counter = shared_counter + 1
mutex.unlock()

If two threads run this code simultaneously starting with shared_counter = 5, what is the final value of shared_counter?

medium

A. 6

B. 5

C. Error

D. 7

Solution

1. Step 1: Understand mutex effect on shared_counter

   The mutex lock ensures only one thread increments the counter at a time, preventing race conditions.

2. Step 2: Calculate final value after two increments

   Starting at 5, each thread adds 1 safely, so final value is 5 + 2 = 7.

3. Final Answer:

   7 -> Option D

4. Quick Check:

   Mutex prevents race, count increments twice [OK]

Hint: Mutex ensures both increments count [OK]

Common Mistakes:

• Assuming only one increment happens
• Ignoring mutex effect causing race
• Expecting an error without reason

4. A programmer wrote this code snippet:

mutex.unlock()
use_shared_resource()
mutex.lock()

What is the main problem with this code?

medium

A. The mutex is unlocked before it is locked

B. The code will cause a deadlock

C. The mutex is locked twice without unlocking

D. There is no problem; the code is correct

Solution

1. Step 1: Analyze the order of mutex operations

   The code calls mutex.unlock() before any mutex.lock(), which is incorrect because you cannot release a lock you don't hold.

2. Step 2: Identify the error

   This misuse can cause runtime errors or undefined behavior, matching The mutex is unlocked before it is locked.

3. Final Answer:

   The mutex is unlocked before it is locked -> Option A

4. Quick Check:

   Unlock before lock is wrong [OK]

Hint: Lock first, unlock later; never reverse [OK]

Common Mistakes:

• Unlocking before locking
• Ignoring lock before resource use
• Assuming double lock is okay

5. In a system with multiple threads, which scenario best shows why mutex locks are essential?

hard

A. Two threads perform calculations independently without sharing data

B. Two threads write to the same file simultaneously without locking, causing data corruption

C. A single thread writes to a file without any other threads running

D. Two threads read different files at the same time without any locks

Solution

1. Step 1: Identify when mutex locks are needed

   Mutex locks are essential when multiple threads access and modify the same shared resource to avoid conflicts.

2. Step 2: Match scenario with mutex necessity

   Two threads write to the same file simultaneously without locking, causing data corruption describes simultaneous writes causing corruption, which mutex locks prevent by serializing access.

3. Final Answer:

   Two threads write to the same file simultaneously without locking, causing data corruption -> Option B

4. Quick Check:

   Shared write needs mutex [OK]

Hint: Mutex needed when sharing writable resource [OK]

Common Mistakes:

• Thinking mutex needed for independent reads
• Assuming single thread needs mutex
• Confusing calculation with shared resource access