Computer Science - Operating Systems Concepts - Discussion
Discussion Forum : Operating Systems Concepts - Section 3 (Q.No. 15)
15.
For how many processes which are sharing common data, the Dekker's algorithm implements mutual exclusion?
Answer: Option
Explanation:
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.
Discussion:
2 comments Page 1 of 1.
Chandan jena said:
1 decade ago
Dekker's algorithm can be applied for 2 processes.
Manali said:
1 decade ago
Ya Dekker algorithm works for only two process 1 which is in the critical section and another one is in waiting state.
Post your comments here:
Quick links
Quantitative Aptitude
Verbal (English)
Reasoning
Programming
Interview
Placement Papers