Skip Navigation

The Computer Journal 1991 34(4):345-348; doi:10.1093/comjnl/34.4.345
© 1991 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 (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Yue, K.
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?

An Efficient Starvation-Free Semaphore Solution for the Graphical Mutual Exclusion Problem

K. Yue1 * ¶ and R. T. Jacob2 §

1 Department of Computer Science, University of Houston - Clear Lake, 2700 Bay Area Boulevard, Houston, TX 77058-1098, USA, 2 Department of Computer Science, University of North Texas, Denton, TX 76203-3886, USA

A fast method for constructing efficient solutions for graphical mutual exclusion problems based on semaphores associated with processes is described. The number of semaphores used is equal to the number of processes in the mutual exclusion problem. The solution is both deadlock-free and starvation-free, and allows a reasonable degree of concurrency. This method can be generalised to deal with generalised semaphore systems such as the PVchunk.

Received April 1989. revised July 1989.

* Department of Computer Science, University of Houston - Clear Lake, 2700 Bay Area Boulevard, Houston, TX 77058-1098, USA

§ Department of Computer Science, University of North Texas, Denton, TX 76203-3886, USA

To whom Correspondance should be addressed.


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.