
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
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. 560568, May, 1989.  
BibTex  x  
@article{ 10.1109/32.24705, author = {R.T. Jacob and I.P. Page}, title = {Synthesis of Mutual Exclusion Solutions Based on Binary Semaphores}, journal ={IEEE Transactions on Software Engineering}, volume = {15}, number = {5}, issn = {00985589}, year = {1989}, pages = {560568}, doi = {http://doi.ieeecomputersociety.org/10.1109/32.24705}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Software Engineering TI  Synthesis of Mutual Exclusion Solutions Based on Binary Semaphores IS  5 SN  00985589 SP560 EP568 EPD  560568 A1  R.T. Jacob, A1  I.P. Page, PY  1989 KW  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). VL  15 JA  IEEE Transactions on Software Engineering ER   
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 edgesolvable 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. 88108, 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. 7081.
[5] K. M. Chandy and J. Misra, "The drinking philosophers problem,"ACM Trans. Programming Lang. Syst., vol. 6, no. 4, pp. 632646, 1984.
[6] C. Berge,Graphs and Hypergraphs. Amsterdam, The Netherlands: NorthHolland, 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. 89102.
[8] E. W. Dijkstra, "Cooperating sequential processes," inProgramming Languages, F. Genuys, Ed. New York: Academic, 1968, pp. 43112.
[9] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NPCompleteness. San Francisco, CA: Freeman, 1979.
[10] J. M. Morris, "A starvationfree solution to the mutual exclusion problem,"Inform. Processing Lett., vol. 8, pp. 7680, Feb. 1979.