This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Synthesis of Mutual Exclusion Solutions Based on Binary Semaphores
May 1989 (vol. 15 no. 5)
pp. 560-568

A graphical form of the mutual exclusion problem is considered in which each vertex represents a process and each edge represents a mutual exclusion constraint between the critical sections of the processes associated with its endpoints. An edge semaphore solution for mutual exclusion problems is defined, and those graphs which are edge solvable are characterized in terms of both a forbidden subgraph and a graph grammar. Finally, an efficient algorithm is given which generates the entry and exit sections for all processes in an edge-solvable problem.

[1] R. J. Lipton, "On synchronization primitive systems," Dep. Comput. Sci., Yale Univ., New Haven, CT, Tech. Rep. 22, 1973.
[2] P. B. Henderson and Y. Zalcstein, "A graph theoretic characterization of thePVchunkclass of synchronizing primitivies,"SIAM J. Comput., vol. 6, pp. 88-108, Mar. 1977.
[3] I. P. Page and R. T. Jacob, "The solution of mutual exclusion problems which can be described graphically,"Comput. J., to be published.
[4] N. A. Lynch, "Fast allocation of nearby resources in a distributed system," inProc. 12th Annu. ACM Symp. Theory Comput., New York, 1980, pp. 70-81.
[5] K. M. Chandy and J. Misra, "The drinking philosophers problem,"ACM Trans. Programming Lang. Syst., vol. 6, no. 4, pp. 632-646, 1984.
[6] C. Berge,Graphs and Hypergraphs. Amsterdam, The Netherlands: North-Holland, 1973.
[7] R. H. Campbell and A. N. Habermann. "The specification of process synchronization by path expressions." inLecture Notes in Computer Science vol. 16, Operating Systems, Apr. 1974, pp. 89-102.
[8] E. W. Dijkstra, "Co-operating sequential processes," inProgramming Languages, F. Genuys, Ed. New York: Academic, 1968, pp. 43-112.
[9] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
[10] J. M. Morris, "A starvation-free solution to the mutual exclusion problem,"Inform. Processing Lett., vol. 8, pp. 76-80, Feb. 1979.

Index Terms:
mutual exclusion solutions; binary semaphores; graphical form; mutual exclusion problem; vertex; mutual exclusion constraint; edge semaphore solution; edge solvable; forbidden subgraph; graph grammar; efficient algorithm; entry; exit sections; graph theory; operating systems (computers).
Citation:
R.T. Jacob, I.P. Page, "Synthesis of Mutual Exclusion Solutions Based on Binary Semaphores," IEEE Transactions on Software Engineering, vol. 15, no. 5, pp. 560-568, May 1989, doi:10.1109/32.24705
Usage of this product signifies your acceptance of the Terms of Use.