1. For how many processes which are sharing common data, the Dekker's algorithm implements mutual exclusion?






Ask Your Doubts Here

Type in
(Press Ctrl+g to toggle between English and the chosen language)

Comments

  • By: guest on 01 Jun 2017 10.55 pm
    Dekker's algorithm is the first known correct solution to the mutual exclusion problem in concurrent programming. The solution is attributed to Dutch mathematician Th. J. Dekker by Edsger W. Dijkstra in his manuscript on cooperating sequential processes. It allows two threads to share a single-use resource without conflict, using only shared memory for communication. It avoids the strict alternation of a naive turn-taking algorithm, and was one of the first mutual exclusion algorithms to be invented. Source: http://en.wikipedia.org/wiki/Dekker's_algorithm
Show Similar Question And Answers
QA->Which common devices works on the basis of the principle of mutual induction?....
QA->What function displays row data in a column or column data in a row?....
QA->With which period do we associate the 'microlith' implements?....
QA->“The systematic exclusion of Indians from official employment of a supirior charector was an antiIndian policy which was a national factor of great importance”-The comment related to the Revolt of 1857 was made by?....
QA->Name the Governor General who adopted a policy of the Europeanisation of bureaucracy and an exclusion of Indians from higher posts?....
MCQ->For how many processes which are sharing common data, the Dekker's algorithm implements mutual exclusion?....
MCQ->interface Base { boolean m1 (); byte m2(short s); } which two code fragments will compile? interface Base2 implements Base {} abstract class Class2 extends Base { public boolean m1(){ return true; }} abstract class Class2 implements Base {} abstract class Class2 implements Base { public boolean m1(){ return (7 > 4); }} abstract class Class2 implements Base { protected boolean m1(){ return (5 > 7) }}....
MCQ->interface DoMath { double getArea(int rad); } interface MathPlus { double getVol(int b, int h); } / Missing Statements ? / which two code fragments inserted at end of the program, will allow to compile? class AllMath extends DoMath { double getArea(int r); } interface AllMath implements MathPlus { double getVol(int x, int y); } interface AllMath extends DoMath { float getAvg(int h, int l); } class AllMath implements MathPlus { double getArea(int rad); } abstract class AllMath implements DoMath, MathPlus { public double getArea(int rad) { return rad rad 3.14; } }....
MCQ->You enable the Routing and Remote Access Service (RRAS) on a computer running Windows 2000 Server. You configure the computer as a RAS server. You want to provide mutual authentication between the RAS server and RAS clients. You also want to ensure that data passing between the RAS server and RAS clients is encrypted. Which authentication method should you use for your incoming connections to support mutual authentication and data encryption?....
MCQ->Four necessary conditions for deadlock to exist are: mutual exclusion, no-preemption, circular wait and....
Terms And Service:We do not guarantee the accuracy of available data ..We Provide Information On Public Data.. Please consult an expert before using this data for commercial or personal use | Powered By:Omega Web Solutions
© 2002-2017 Omega Education PVT LTD...Privacy | Terms And Conditions
Question ANSWER With Solution