Skip Navigation

The Computer Journal 1981 24(3):243-248; doi:10.1093/comjnl/24.3.243
© 1981 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 Wettstein, H.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Locking operations for maximum concurrency

H. Wettstein *

Institut fur Informatik III, Universitat Karlsruhe, Zirkel 2, Karlsruhe, Germany

Parallel access to data structures may in some cases cause serious congestion. Therefore, one is urged to ‘open’ the structure. This can be done by locking only part of it and moving such a locked environment with the process of a search procedure through the data structure. Another approach is to distinguish the access operation by types. This paper discusses the maximum concurrency to be gained by such mechanisms.

Received March 1980.

* Institut für Informatik III, Universität Karlsruhe, Zirkel 2, D-7500 Karlsruhe 1, FRG


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.