Entry Hilzer:1992:CS from sigcse1990.bib

Last update: Wed Sep 26 02:07:32 MDT 2018                Valid HTML 4.0!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Hilzer:1992:CS,
  author =       "Ralph C. {Hilzer, Jr.}",
  title =        "Concurrency with semaphores",
  journal =      j-SIGCSE,
  volume =       "24",
  number =       "3",
  pages =        "45--50",
  month =        sep,
  year =         "1992",
  CODEN =        "SIGSD3",
  DOI =          "https://doi.org/10.1145/142040.142071",
  ISSN =         "0097-8418 (print), 2331-3927 (electronic)",
  ISSN-L =       "0097-8418",
  bibdate =      "Sat Nov 17 18:57:20 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigcse1990.bib",
  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.",
  acknowledgement = ack-nhfb,
  fjournal =     "SIGCSE Bulletin (ACM Special Interest Group on
                 Computer Science Education)",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J688",
}

Related entries