Recent questions tagged process-synchronization / GATE Overflow for GATE CSE

1 votes

1 answer

91

Applied Test Series
It is given that in a system, processes P and C communicate by means of 3 semaphores and one buffer. The buffer size is given as 10. A semaphore M is used to implement mutual exclusion. Initial value of M is 1. The value of M is decremented by any process ... = 1, E = 7, F = 0 Out of the four combinations given above, the total number of combinations which cannot exist is ____

It is given that in a system, processes P and C communicate by means of 3 semaphores and one buffer. The buffer size is given as 10. A semaphore M is used to implement mu...

LRU

658 views

LRU asked Oct 17, 2021

4 votes

1 answer

92

Applied Test Series
Consider the following statements : Satisfies Mutual exclusion Satisfies Progress Satisfies Bounded wait Suffers from deadlock The number of above statements that is correct about disable interrupt for a uniprocessor system is ___.

Consider the following statements : Satisfies Mutual exclusionSatisfies Progress Satisfies Bounded waitSuffers from deadlockThe number of above statements that is correc...

LRU

1.3k views

LRU asked Oct 17, 2021

2 votes

2 answers

93

Applied Test Series
The solution for process synchronization is given below : Which of the following is correct about the above given solution? (A) Satisfies Mutual Exclusion (B) Satisfies Progress (C) Satisfies Bounded wait (D) Suffers from deadlock

The solution for process synchronization is given below : Which of the following is correct about the above given solution? (A) Satisfies Mutual Exclusion(B) Satisfies ...

LRU

578 views

LRU asked Oct 17, 2021

21 votes

4 answers

94

GATE CSE 2021 Set 1 | Question: 46
Consider the following pseudocode, where $\textsf{S}$ is a semaphore initialized to $5$ in line $\#2$ and $\textsf{counter}$ is a shared variable initialized to $0$ in line $\#1$. Assume that the increment operation in line $\#7$ ... is $0$ after all the threads successfully complete the execution of $\textsf{parop}$ There is a deadlock involving all the threads

Consider the following pseudocode, where $\textsf{S}$ is a semaphore initialized to $5$ in line $\#2$ and $\textsf{counter}$ is a shared variable initialized to $0$ in li...

Arjun

13.5k views

Arjun asked Feb 18, 2021

2 votes

1 answer

95

NIELIT 2016 DEC Scientist B (IT) - Section B: 50
Which of the following statements about semaphores is true? $P$ and $V$ operations should be indivisible operations. A semaphore implementation should guarantee that threads do not suffer indefinite postponement. If several threads attempt a $P(S)$ operation simultaneously, only one thread should be allowed to proceed. All of the above.

Which of the following statements about semaphores is true?$P$ and $V$ operations should be indivisible operations.A semaphore implementation should guarantee that thread...

admin

11.7k views

admin asked Mar 31, 2020

2 votes

1 answer

96

NIELIT 2016 DEC Scientist B (CS) - Section B: 51
A process that is based on IPC mechanism which executes on different systems and can communicate with other processes using message based communication is called _______. Local Procedure Call Remote Procedure Call Inter Process Communication Remote Machine Invocation

A process that is based on IPC mechanism which executes on different systems and can communicate with other processes using message based communication is called _______....

admin

1.4k views

admin asked Mar 31, 2020

6 votes

4 answers

97

ISRO2020-26
The operating system and the other processes are protected from being modified by an already running process because they run at different time instants and not in parallel they are in different logical addresses they use a protection algorithm in the scheduler every address generated by the CPU is being checked against the relocation and limit parameters

The operating system and the other processes are protected from being modified by an already running process becausethey run at different time instants and not in paralle...

Satbir

4.8k views

Satbir asked Jan 13, 2020

2 votes

1 answer

98

ISRO2020-28
Dispatch latency is defined as the speed of dispatching a process from running to the ready state the time of dispatching a process from running to ready state and keeping the CPU idle the time to stop one process and start running another one none of these

Dispatch latency is defined asthe speed of dispatching a process from running to the ready statethe time of dispatching a process from running to ready state and keeping ...

Satbir

4.3k views

Satbir asked Jan 13, 2020

0 votes

0 answers

99

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 62 (Page No. 179)
Write a producer-consumer problem that uses threads and shares a common buffer. However, do not use semaphores or any other synchronization primitives to guard the shared data structures. Just let each thread access them when ... Do not print more than one number every minute because the I/O could affect the race conditions.

Write a producer-consumer problem that uses threads and shares a common buffer. However, do not use semaphores or any other synchronization primitives to guard the shared...

admin

716 views

admin asked Oct 25, 2019

0 votes

0 answers

100

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 60 (Page No. 179)
Suppose that a university wants to show off how politically correct it is by applying the U.S. Supreme Court's Separate but equal is inherently unequal'' doctrine to gender as well ... : woman_wants_to_enter, man_wants_to_enter, woman_leaves, man_leaves. You may use whatever counters and synchronization techniques you like.

Suppose that a university wants to show off how politically correct it is by applying the U.S. Supreme Court’s ‘‘Separate but equal is inherently unequal’’ doct...

admin

779 views

admin asked Oct 25, 2019

0 votes

0 answers

101

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 56 (Page No. 178)
The readers and writers problem can be formulated in several ways with regard to which category of processes can be started when. Carefully describe three different variations of the problem, each one favoring (or not ... reader or a writer becomes ready to access the database, and what happens when a process is finished.

The readers and writers problem can be formulated in several ways with regard to which category of processes can be started when. Carefully describe three different varia...

admin

298 views

admin asked Oct 25, 2019

1 votes

1 answer

102

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 38 (Page No. 177)
The $CDC\: 6600$ computers could handle up to $10\: I/O$ processes simultaneously using an interesting form of round-robin scheduling called processor sharing. A process switch occurred after each instruction, so ... the absence of competition, how much time would it need if processor sharing was used with n processes?

The $CDC\: 6600$ computers could handle up to $10\: I/O$ processes simultaneously using an interesting form of round-robin scheduling called processor sharing. A process ...

admin

839 views

admin asked Oct 25, 2019

0 votes

1 answer

103

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 35 (Page No. 176)
Synchronization within monitors uses condition variables and two special operations, wait and signal. A more general form of synchronization would be to have a single primitive, waituntil, that had an arbitrary Boolean predicate as ... or Brinch Hansen, but it is not used. Why not? (Hint: Think about the implementation.)

Synchronization within monitors uses condition variables and two special operations, wait and signal. A more general form of synchronization would be to have a single pri...

admin

681 views

admin asked Oct 25, 2019

0 votes

1 answer

104

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 33 (Page No. 176)
If a system has only two processes, does it make sense to use a barrier to synchronize them? Why or why not?

If a system has only two processes, does it make sense to use a barrier to synchronize them? Why or why not?

admin

1.1k views

admin asked Oct 25, 2019

1 votes

2 answers

105

Doubt in Reader-Writer Problem's Solution
Why in reader section we are locking(I highlighted the locking) read_count-- and if section? If we don't use locking what problems might arise? I know that we should use locking whenever we access shared variable but in this particular case I don't see any problem if we don't use locking(highlighted). Please explain what I am missing

Why in reader section we are locking(I highlighted the locking) read_count and if section?If we don't use locking what problems might arise?I know that we should use loc...

Bhaskar Singh

1.5k views

Bhaskar Singh asked May 26, 2019

1 votes

2 answers

106

Made Easy Test Series: Synchronization
Consider the two processes need to access $P_{i}$ and $P_{j}$ need to access the C.S. The following synchronization construct used by both the processes. Process Pi While(true){ j=false; i=true; while(j==true); CRITICAL SECTION i=false; } ... true); CRITICAL SECTION j=false; } I got it is not satisfying M.E., but will it satisfying deadlock too?? Plz explain-

Consider the two processes need to access $P_{i}$ and $P_{j}$ need to access the C.S. The following synchronization construct used by both the processes.Process Pi While...

srestha

1.5k views

srestha asked May 20, 2019

0 votes

0 answers

107

Operating System - Galvin - Chapter 3
Galvin, 9th edition on page 146 states that Shared memory can be faster than message passing, since message-passing systems are typically implemented using system calls and thus require the more time-consuming task of kernel intervention. In ... that shared memory is bound to be faster, but aren't the mutex and semaphore calls require Kernel intervention?

Galvin, 9th edition on page 146 states that“Shared memory can be faster than message passing, since message-passing systems are typically implemented using system calls...

vinay chauhan

1.2k views

vinay chauhan asked May 5, 2019

0 votes

0 answers

108

Galvin Edition 9 Exercise 5 Question 35 (Page No. 248)
Design an algorithm for a monitor that implements an alarm clock that enables a calling program to delay itself for a specified number of time units (ticks). You may assume the existence of a real hardware clock that invokes a function $tick()$ in your monitor at regular intervals.

Design an algorithm for a monitor that implements an alarm clock that enables a calling program to delay itself for a specified number of time units (ticks). You may assu...

akash.dinkar12

539 views

akash.dinkar12 asked Mar 20, 2019

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true