Anoperating system manages N (H)%.N) in order to execute properly. Device N is universal and can.be...

Transcribed Image Text:

Anoperating system manages N (H)%.N) in order to execute properly. Device N is universal and can.be allocated to y process n place of any other device. Thus, each process has an additional device to merent processes and N+1 storage devices (resources) vaicustypas. Because of the different needs of the processes, devices are numbered 0 t iS available, and so greater overlap can be achieved. The following four hene ard :10 errors in the code, Evaluate each algorithm and specify the most appropriate synihronizalion algorithms for process i, have been proposed for this situation. Assume ene of tric lollowing statements. An answer may be given more than once. Also state the casible, but less than maximum overlap among these solutions. I easible, with maximum overlap among these solutions. Dues not synchronize properly. i.e., Potential loss of integrity. May lead to indefinite wait by a process. May lead to deadlock among two or more processes. eason r choosing each answer. . Algorithms use the following variables and semaphores: Initial value Use Name Flag Device[i] 1, for 0<=j<=N M4utex Indicates which process has device N. binary semaphore array for N+1 devices. binary semaphore to protect Flag. -1 +1 :#1: P (sevice (i]); P (0vice ( (i+1) % N]); 1/0 Operation; v (pevice (i]); v (bevice ( (i+1) % N]); Algorithm # 2: P (Device [i]); P (Device (i+1]); I/0 Operation; V (Device[i]): V (Device[i+1]); ....... #3: f (D vice (i]) : 4l (Flag >= 0) P (Device( (i+1) % N]); else ( Flag i; P (Device (N]): 1: 1/0 Operation; V (Device (i]); if (Flag ! i) v (Device ( (i+1) N]); else ( Flag -1; V (Device (N]): Algorithm # 4: P (Device(i1l: "P (Mutex); if (Flag >= 0) ( V (Mutex) ; P (Device( (i+1) % N]); else ( Flag i; v (Mutex); I/0 Operation; V (Device [i]): P (Mutex) ; if (Flag ! i) V (Device ( (i+1) * N); else Flag = -1; V (Mutex); Anoperating system manages N (H)%.N) in order to execute properly. Device N is universal and can.be allocated to y process n place of any other device. Thus, each process has an additional device to merent processes and N+1 storage devices (resources) vaicustypas. Because of the different needs of the processes, devices are numbered 0 t iS available, and so greater overlap can be achieved. The following four hene ard :10 errors in the code, Evaluate each algorithm and specify the most appropriate synihronizalion algorithms for process i, have been proposed for this situation. Assume ene of tric lollowing statements. An answer may be given more than once. Also state the casible, but less than maximum overlap among these solutions. I easible, with maximum overlap among these solutions. Dues not synchronize properly. i.e., Potential loss of integrity. May lead to indefinite wait by a process. May lead to deadlock among two or more processes. eason r choosing each answer. . Algorithms use the following variables and semaphores: Initial value Use Name Flag Device[i] 1, for 0<=j<=N M4utex Indicates which process has device N. binary semaphore array for N+1 devices. binary semaphore to protect Flag. -1 +1 :#1: P (sevice (i]); P (0vice ( (i+1) % N]); 1/0 Operation; v (pevice (i]); v (bevice ( (i+1) % N]); Algorithm # 2: P (Device [i]); P (Device (i+1]); I/0 Operation; V (Device[i]): V (Device[i+1]); ....... #3: f (D vice (i]) : 4l (Flag >= 0) P (Device( (i+1) % N]); else ( Flag i; P (Device (N]): 1: 1/0 Operation; V (Device (i]); if (Flag ! i) v (Device ( (i+1) N]); else ( Flag -1; V (Device (N]): Algorithm # 4: P (Device(i1l: "P (Mutex); if (Flag >= 0) ( V (Mutex) ; P (Device( (i+1) % N]); else ( Flag i; v (Mutex); I/0 Operation; V (Device [i]): P (Mutex) ; if (Flag ! i) V (Device ( (i+1) * N); else Flag = -1; V (Mutex);

Answer rating: 100% (QA)

the solution of this problem is given below the reason as asked of each algorithm is given Algorithm 1 5 May Lead to deadlock among two or more proces... View the full answer