Skip Navigation

The Computer Journal 1979 22(2):146-150; doi:10.1093/comjnl/22.2.146
© 1979 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 Keedy, J. L.
Right arrow Articles by Rosenberg, J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

On implementing semaphores with sets

J. L. Keedy *, K. Ramamohanarao and J. Rosenberg

Department of Computer Science, Monash University, Clayton, Victoria, Australia

It is proposed that semaphores should in some circumstances be extended by associating with each semaphore, in addition to the usual integer, a set (bit string). There are two separate uses for this set, which are considered separately and which can be implemented independently of each other. The first, the available resources set, has a bit identifying each resource controlled by the semaphore, which will indicate when the resource is free. When no resources are free the set may then be used to identify those processes waiting on a resource. The advantages and disadvantages of both sets are discussed, including the possibility of eliminating MUTEX semaphores from situations such as producer/consumer activities, and the possibility of entirely ‘automating’ (i.e. controlling by hardware semaphore instructions) the synchronisation and scheduling of processes.

Received February 1977.

* At Technische Hochschule Darmstadt, Institut für Praktische Informatik, Fachbereich 20, 61 Darmstadt, Steubenplatz 12, West Germany, until May 1979.

§ Department of Computer Science, Monash University, Clayton, Victoria 3168, Australia


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.