Unit-2: Concurrent Processes
Assignment-1
Q.1- Explain Principles of concurrency.
Answer:
Concurrency is the execution of multiple instruction sequences at the same time. It improves system
performance, resource utilization, and responsiveness. The key principles include:
- Mutual Exclusion: Ensures only one process accesses a shared resource at a time.
- Progress: If no process is in a critical section, any process that wishes to enter can proceed.
- Bounded Waiting: Each process gets a chance to enter its critical section within a finite time.
- Synchronization: Coordinates access to shared resources.
- Deadlock Avoidance: Prevents situations where two or more processes are waiting indefinitely for
each other.
Q.2- What is producer-consumer problem?
Answer:
The Producer-Consumer Problem is a classical example of a multi-process synchronization
problem. It involves two processes:
- Producer: Generates data and places it in a buffer.
- Consumer: Takes data from the buffer for processing.
Issues arise when the buffer is full (producer must wait) or empty (consumer must wait).
Semaphores or mutexes are typically used to manage buffer access and ensure synchronization.
Q.3- What is critical section? Explain Algorithm to solve it.
Answer:
A critical section is a code segment that accesses shared resources which must not be accessed by
more than one process at a time. Critical Section Problem involves ensuring:
- Mutual Exclusion
- Progress
- Bounded Waiting
Example Algorithm: Peterson's Algorithm
- Uses two shared variables: `flag[i]` (desire to enter) and `turn` (whose turn).
- Ensures no two processes enter the critical section simultaneously, preserving mutual exclusion.
Q.4- What is Dekker Solution?
Answer:
Dekker's Algorithm is a software-based mutual exclusion method for two processes. It uses flags to
indicate interest in entering the critical section and a turn variable to resolve conflict. It satisfies all
conditions of mutual exclusion, progress, and bounded waiting, but is complex and not scalable to
more than two processes.
Q.5- What is Peterson's Algorithm and its solution.
Answer:
Peterson's Algorithm is a classical software solution to the critical section problem for two
processes. It uses two variables:
- `flag[0]` and `flag[1]`: Each process sets its flag to true when it wants to enter.
- `turn`: Indicates whose turn it is.
The process enters only if either the other process is not interested or it's its turn. This guarantees
mutual exclusion, progress, and bounded waiting.
Assignment-2
Q.1- Write short note on semaphores.
Answer:
A semaphore is a synchronization tool used to control access to a common resource. It is an integer
variable that can be:
- Binary Semaphore: Acts as a lock (values 0 or 1).
- Counting Semaphore: Allows multiple resource accesses.
Semaphores support two atomic operations:
- wait(P): Decreases the semaphore value.
- signal(V): Increases the semaphore value.
They help prevent race conditions and ensure orderly execution of processes.
Q.2- What is race condition?
Answer:
A race condition occurs when multiple processes or threads access shared data and try to change it
at the same time. The final output depends on the timing of context switching. This can lead to
unpredictable and erroneous results. Proper synchronization techniques like semaphores or
mutexes are used to prevent race conditions.
Q.3- Explain Dining Philosopher Problem for synchronization.
Answer:
The Dining Philosopher Problem illustrates the challenges of resource allocation and deadlock in
concurrent systems. Five philosophers sit at a table with five chopsticks. Each philosopher needs
two chopsticks to eat. The problem arises when each picks up one chopstick and waits indefinitely
for the other.
Solutions:
- Limit the number of philosophers eating simultaneously.
- Use semaphores or resource hierarchies.
- Introduce an arbitrator to manage access to chopsticks.
Q.4- What is Inter Process Communication?
Answer:
Inter-Process Communication (IPC) allows processes to exchange data and signals. It enables
process synchronization and cooperation in multitasking environments. IPC methods include:
- Shared Memory: Fastest method but complex synchronization.
- Message Passing: Safer, used in distributed systems.
- Pipes, Sockets, and Signals: Other means to achieve IPC.
Proper IPC ensures data consistency and system reliability.
Q.5- What is a process? How it is generated?
Answer:
A process is a program in execution, comprising code, data, and system resources like open files
and memory. The operating system uses a Process Control Block (PCB) to manage processes.
Processes are created using system calls like:
- fork(): Duplicates the calling process (UNIX).
- exec(): Replaces process memory with a new program.
- Windows uses CreateProcess().
The OS assigns resources and schedules the process for execution.