Skip Navigation

The Computer Journal 1989 32(1):45-54; doi:10.1093/comjnl/32.1.45
© 1989 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (3)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Page, I. P.
Right arrow Articles by Jacob, R. T.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

The Solution of Mutual Exclusion Problems which can be Described Graphically

I. P. Page1 * and R. T. Jacob2 §

1 Department of Computer Science, University of Texas at Dallas, Box 830688, Richardson, TX 75083-0688, USA, 2 Computer Systems Laboratory, Department of Computer Sciences, North Texas State University, Denton, TX 76203-3886, USA

This paper describes a general method for classifying and solving graphical mutual exclusion problems in a potentially automatic way. We show how to compile undirected graph representations into code for the associated processes. Starvation-prone solutions are based on Dijkstra's weak binary semaphores, while starvation-free solutions employ blocked-queue binary semaphores. Both solutions take the form of simulations of problem-space specifications which prescribe queue disciplines amongst blocked processes. The Hoare monitor is also considered since it is easily implemented in semaphores and can simulate any reasonable queue discipline. All proofs are presented in English with the minimum of formality in order to attract the greatest readership. Some of the necessarily more formal proofs underlying the results given here have been collected into a separate paper.

Received June 1986. revised June 1987.

* Department of Computer Science, University of Texas at Dallas, Box 830688, Richardson, Tx 75083-0688, USA

§ Computer Systems Laboratory, Department of Computer Sciences, North Texas State University, Denton, Tx 76203-3886, USA


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.