Process Synchronization

rishi71662data4 asked Nov 16, 2017

612 views

0 votes

In a given synchronization construct, if there is no deadlock and no strict alternation between two process then is it always true that a process will starve ?

Operating System
process-synchronization
operating-system
critical-section

+ –

rishi71662data4 asked Nov 16, 2017

rishi71662data4

612 views

See all

0 Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

1 votes

here we cant say ALWAYS...a process may or may not be starve ....but just for worst case ..we can say yes a process may starve...if other all coming may get entry inside critical section...

SHUBHAM SHASTRI answered Nov 16, 2017

SHUBHAM SHASTRI

See all

0 Please log in or register to add a comment.

Voting & Accepting an answer helps improve the community

← Previous Next →

← Previous in category Next in category →

Related questions

0 votes

1 answer

N3314nch41 asked Sep 10, 2023

361 views

process synchronization
How to approach synchronization (specifically semaphore) question, there size are really intimidating and i’m unable to decode the code written? What to do??

How to approach synchronization (specifically semaphore) question, there size are really intimidating and i’m unable to decode the code written? What to do??

N3314nch41

361 views

N3314nch41 asked Sep 10, 2023

Operating System
process-synchronization
operating-system
semaphore
critical-section
self-doubt

+ –

0 votes

0 answers

Nirmal Gaur asked Dec 19, 2018

556 views

Process Synchronization
Does Progress implies freedom from Deadlock?

Does Progress implies freedom from Deadlock?

Nirmal Gaur

556 views

Nirmal Gaur asked Dec 19, 2018

Operating System
process-synchronization
critical-section
operating-system

+ –

2 votes

2 answers

Kalpataru Bose asked Nov 27, 2017

830 views

Process Synchronization
If there are n processes executing concurrently using binary semaphore S , (n-1) processes have the code do{ wait(S); <c.s> signal(s); <r.s> }while(1); the code for the n-th process i.e Pn is given by do{ signal(S); <c.s> signal(S); < ... (1); What is the max no. of processes that can be there in the critical section simultaneously? A. 2 B . 3 C. n-1 D. n

If there are n processes executing concurrently using binary semaphore S , (n-1) processes have the code do{ wait(S); <c.s signal(s); <r.s }while(1);the code for the n-th...

Kalpataru Bose

830 views

Kalpataru Bose asked Nov 27, 2017

Operating System
process-synchronization
operating-system
critical-section

+ –

2 votes

2 answers

Kalpataru Bose asked Nov 27, 2017

730 views

Process Synchronization
If there are n processes executing concurrently using binary semaphore S , (n-1) processes have the code do{ wait(S); <c.s> signal(s); <r.s>}while(1); the code for the n-th process i.e Pn is given by do{ signal(S); <c.s> wait(S); <r. ... ; a) What is the max no. of processes that can be there in the critical section simultaneosly ? A. 2 B . 3 C. n-1 D. n

If there are n processes executing concurrently using binary semaphore S , (n-1) processes have the codedo{ wait(S);<c.s>signal(s);<r.s>...

Kalpataru Bose

730 views

Kalpataru Bose asked Nov 27, 2017

Operating System
process-synchronization
operating-system
critical-section

+ –

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

0 reply

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

0 reply

Please log in or register to add a comment.

Related questions

0

0