Communicating semaphores

  • Authors:
  • Harry J. Saal;William E. Riddle

  • Affiliations:
  • -;-

  • Venue:
  • Communicating semaphores
  • Year:
  • 1971

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper describes two extensions to the semaphore operators originally introduced by Dijkstra. These extensions can be used to reduce: 1) the number of semaphore references; 2) the time spent in critical sections; and 3) the number of distinct semaphores required for proper synchronization without greatly increasing the time required for semaphore operations. Communicating semaphores may be utilized not only for synchronization but also for message switching, resource allocation from pools and as general queueing mechanisms.