5C789 9 Sept Unit 2

What is mutual exclusion in process synchronization?

• Mutual exclusion allows multiple processes to access a shared resource simultaneously.

• Mutual exclusion is a synchronization mechanism that prevents multiple processes from accessing a shared resource at the same time.

• Mutual exclusion is a method for increasing the speed of process execution.

• Mutual exclusion is a technique for prioritizing processes based on their resource needs.

Describe a software solution to the mutual exclusion problem.

• Implement a busy-wait loop to check access to the critical section.

• Use semaphores to control access to the critical section.

• Use mutexes to allow multiple threads in the critical section.

• Use message passing to synchronize access to shared resources.

What are the hardware solutions to the mutual exclusion problem?

• Condition variables

• Spinlocks

• Mutex locks

• Test-and-set locks, compare-and-swap (CAS) instructions, hardware semaphores

Explain the concept of semaphores in process synchronization.

• Semaphores are programming languages that help in writing concurrent code.

• Semaphores are synchronization tools that control access to shared resources in concurrent programming by using a counter to manage resource availability.

• Semaphores are hardware components that manage memory allocation in a computer system.

• Semaphores are used to increase the speed of processes by allowing multiple threads to run simultaneously.

What are the two types of semaphores?

• Binary semaphore and counting semaphore

• Static semaphore and dynamic semaphore

• Simple semaphore and complex semaphore

• Integer semaphore and float semaphore

Define the critical section problem.

• The critical section problem only occurs in single-threaded applications.

• The critical section problem is a method for optimizing CPU usage.

• The critical section problem is a synchronization issue that arises when multiple processes access shared resources concurrently, requiring mechanisms to ensure mutual exclusion.

• The critical section problem is a type of hardware failure.

What are the necessary conditions for the critical section problem?

• Mutual exclusion, progress, and bounded waiting

• Deadlock prevention, starvation, and infinite waiting

• Mutual exclusion, fairness, and indefinite postponement

• Progress, starvation, and unbounded waiting

How does the Bakery Algorithm ensure mutual exclusion?

• Processes take turns in a round-robin fashion to enter the critical section.

• The algorithm uses timestamps to determine which process can enter next.

• The Bakery Algorithm ensures mutual exclusion by assigning unique numbers to processes and allowing the one with the lowest number to enter the critical section.

• All processes can enter the critical section simultaneously without restrictions.

What is the Dining Philosophers problem and its significance in synchronization?

• The Dining Philosophers problem demonstrates synchronization issues in concurrent programming, particularly deadlock and resource contention.

• It illustrates the importance of table manners in dining etiquette.

• The problem focuses on optimizing single-threaded applications.

• The Dining Philosophers problem is a cooking technique for chefs.

What is the difference between logical and physical address space?

• Logical address space is generated by the CPU; physical address space is the actual memory addresses.

• Logical address space is fixed; physical address space can change dynamically.

• Logical address space is the total memory available; physical address space is the memory used by applications.

• Logical address space refers to the physical memory; physical address space is generated by the CPU.