BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-71-202
       ENTRY:: November 01, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Communicating semaphores
        TYPE:: Technical Report
      AUTHOR:: Saal, Harry J.
      AUTHOR:: Riddle, William E.
        DATE:: February 1971
       PAGES:: 24
    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.
       NOTES:: [Adminitrivia V1/Prg/19951101]
         END:: STAN//CS-TR-71-202