Skip Navigation

The Computer Journal 1989 32(1):24-28; doi:10.1093/comjnl/32.1.24
© 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 arrowRequest Permissions
Google Scholar
Right arrow Articles by Freisleben, B.
Right arrow Articles by Keedy, J. L.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Priority Semaphores

B. Freisleben1 * and J. L. Keedy2 § ¶

1 Fachbereich Informatik, Technische Hochschule Darmstadt, Alexanderstr. 24, D-6100 Darmstadt, Germany, 2 Department of Computer Science, University of Newcastle, NSW 2308, Australia

Neither low-level mechanisms such as semaphores nor higher-level mechanisms such as path expressions provide a simple means of solving synchronisation problems involving the scheduling of processes or classes of processes according to different priorities. This paper presents a new set of primitives which are easy to use and simple to implement. Their use is described in terms of the familiar reader–writer problem and the general scheduling problem involving arbitrary levels of priority with support for pre-emption and shared access by certain process classes. An efficient implementation, which reduces to a minimum the number of calls required to the process scheduler, is then described.

Received May 1987.

* Fachbereich Informatik, Technische Hochschule Darmstadt, Alexanderstr. 24, D-6100 Darmstadt, F.R.G.

§ Department of Computer Science, University of Newcastle, NSW 2308, Australia

To whom correspondence 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.