Concurrency with semaphores

  • Authors:
  • Ralph C. Hilzer, Jr.

  • Affiliations:
  • -

  • Venue:
  • ACM SIGCSE Bulletin
  • Year:
  • 1992

Quantified Score

Hi-index 0.00

Visualization

Abstract

Concurrency is introduced in most operating systems textbooks, but usually, only the basics of synchronization and mutual exclusion are presented. The more complicated examples are invariably canned code such as the producer/consumer or readers/writers problems. This paper explores semaphores at an intermediate level by using them to coordinate the activities of a barbershop. The obstacles encountered when attempting to provide tailored access to barbershop resources are similar to those encountered in a real operating system.