Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Computer Science and Artificial Intelligence Lab (CSAIL)
  3. LCS Publications
  4. LCS Technical Memos (1974 - 2003)
  5. Semaphore Primitives and Starvation-free Mutual Exclusion

Semaphore Primitives and Starvation-free Mutual Exclusion

Thumbnail Image
Download
Name

MIT-LCS-TM-158.pdf

Size

50.99 MB

Format

Adobe PDF

Checksum (MD5)

57781b6a6e78353cbe221e5e6acd3b79

Author(s)
Stark, Eugene William
Advisor(s)
Greif, Irene
Date Issued
March 1980
Series/Report no.
MIT-LCS-TM-158
Abstract
Most discussions of semaphore primitives in the literature provide only an informal description of their behavior, rather than a more precissde definition. These informal descriptions may be incorrect, incomplete, or subject to misinterpretation. As a result, the literature actually contains several different definitions of the semaphore primitives. The differences are important, since the particular choice of definition can affect whether a solution to the mutal exclusion problem using semaphore primitives allows the possibility of process starvation. This thesis attempts to alleviate some of the confusion by giving precise definitions of two varieties of semaphore primitives; here called weak and blocked-set primitives. It is then shown that under certain natural conditions, although it is possible to implement starvation-free mutual exclusion with blocked-set semaphores, it is not possible to do so with weak semaphores. Thus weak semaphores are strictly less "powerful" than block-set semaphores.
Persistent DSpace Link
https://hdl.handle.net/1721.1/148985
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.