Dekker's Algorithm for Critical Section
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 an unpublished paper on sequential process descriptions and his manuscript on cooperating sequential processes. <code> flag1=1; if(flag2==0) printf(" Program 1 wins "); </code> <code> flag2=1; if(flag1==0) printf(" Program 2 wins "); </code> _________________________________________________________________________