We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>
+ Click Here To Join also Our facebook study Group.+ How to Join Subject Study Groups & Get Helping Material? + How to become Top Reputation, Angels, Intellectual, Featured Members & Moderators?
.+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)
+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)+ Click Here to Search (Looking For something at vustudents.ning.com?)
Please Discuss here about this assignment.Thanks
Our main purpose here discussion not just Solution
We are here with you hands in hands to facilitate your learning and do not appreciate the idea of copying or replicating solutions. Read More>>
For Important Helping Material related to this subject (Solved MCQs, Short Notes, Solved past Papers, E-Books, FAQ,Short Questions Answers & more). You must view all the featured Discussion in this subject group.
For how you can view all the Featured discussions click on the Back to Subject Name Discussions link below the title of this Discussion & then under featured Discussion corner click on the view all link.
Or visit this link
koi soultion to upload kara
Busy waiting is a term of used in operating system Development and especially process synchronization. When two or more process wants to enter the same critical Section, something has to b done to prevent more than one process from entering it.
In general, yes busy waiting always less efficient then a blocking wait. But consider an event that always occurs with a few cycles of the action that triggered it (Such as an I/O Operation that simply read a control registers, but perfume no actual I/O). in the time to Perform a semaphore wait, block and then subsequently Release the block process, the event will have happened. More cycles are wasted in using the semaphore then if we had simply performed a busy wait, so in this case busy waiting is more efficient.
Question No. 2: (Marks 10)
Write code showing, how we can use Swap () instruction to provide mutual exclusion that satisfies the bounded waiting requirement
waiting[i] = TRUE;
while (waiting[i] && key)
key = Swap(&lock, &key);
waiting[i] = FALSE;
j = (i+1) % n;
while (j !=i) && !waiting[j])
j = (j+1) % n;
if (j == i)
lock = FALSE;
waiting[j] = FALSE;
Dear Students Don’t wait for solution post your problems here and discuss ... after discussion a perfect solution will come in a result. So, Start it now, replies here give your comments according to your knowledge and understandings....
Ans#1: Lecture#23 Page#110
Ans#2: Lecture#21 Page#106