When does race condition occur in inter process communication? What does busy waiting mean and how it can be handled using sleep and wakeup strategy?

Question

Bipin Tiwari · Accepted Answer

IPC is a capability supported by operating system that allows one process to communicate with another process. The processes can be running on the same computer or on different computers connected through a network . IPC enables one application to control another application, and for several application to share the same data without interfering with one another.   Race Conditions: The situation where two or more processes reading or writing some share data and the final results depends on who runs precisely when are called RACE CONDITIONS. Let's take an Example: A print spooler: When a process wants to print a file it enters the filename in a special spooler directly. Another process, the Printer Daemon, periodically checks to see if there are any files to be printed, and if there are, it prints them and removes their name from the directory. Imagine that our spooler directory has a large number of slots, numbered 0,1,2,..... each one capable of holding a filename. also imagine that there are two shared variables, out : points to next file to printed. in : points to next free slot in the directory. slots 0 to 3 files already printed. slots 4 to 6 files names which has to be printed. Now the main issue comes: Process A reads in and store the value, 7, in a local variable called next-free-slot. Just then a clock interrupt occurs and the CPU decides that process A has Run long enough, it switches to process B. Process B also reads in, and also gets a 7, so it stores the name of its in slot 7 and update into be an 8. Then it goes off and does other things. Eventually, process A once again, starting from the place at left off last time. It looks next free slot, finds a7 there, and writes its file name 7 in slot 7, erasing the name that process B just put there. Then it computes next-free-slot+1 , which is 8, and sets in to 8. The spooler directory is now internally consistent, so the printer daemon will not notice anything wrong, but process B will never receive any output. Busy waiting, also known as spinning, or busy looping is a process synchronization technique in which a process/task waits and constantly checks for a condition to be satisfied before proceeding with its execution. In busy waiting, a process executes instructions that test for the entry condition to be true, such as the availability of a lock or resource in the computer system. For resource availability, consider a scenario where a process needs a resource for a specific program. However, the resource is currently in use and unavailable at the moment, therefore the process has to wait for resource availability before it can continue. This is what is known as busy waiting as illustrated below: There are two general approaches to waiting in operating systems: firstly, a process/task can continuously check for the condition to be satisfied while consuming the processor – busy waiting. Secondly, a process can wait without consuming the processor. In such a case, the process/task is alerted or awakened when the condition is satisfied. The latter is known as sleeping, blocked waiting, or sleep waiting.

When does race condition occur in inter process communication? What does busy waiting mean and how it can be handled using sleep and wakeup strategy?

Leave your Answer:

Hits Counter

Question

When does race condition occur in inter process communication? What does busy waiting mean and how it can be handled using sleep and wakeup strategy?

Leave your Answer: