Edsger Wybe Dijkstra

The Origin of Concurrent Programming: From Semaphores to Remote Procedure Calls, Ch. 2, pages 65-138
 2002
Springer
Per Brinch Hansen (eds.)
Reprinted. 1st edition: 1965

Preface. 

  1. Introduction
  2. On the Nature of Sequential Processes.
  3. Loosely Connected Processes.
    1. A Simple Example.
    2. The Generalized Mutual Exclusion Problem.
    3. A Linguistic Interlude.
  4. The Mutual Exclusion Problem Revisited.
    1. The Need for a More Realistic Solution.
    2. The Synchronizing Primitives.
    3. The Synchronizing Primitives Applied to the Mutual Exclusion Problem.
  5. The General Semaphore.
    1. Typical Uses of the General Semaphore.
    2. The Superfluity of the General Semaphore.
    3. The Bounded Buffer.
  6. Cooperation via Status Variables.
    1. An Example of a Priority Rule.
    2. An Example of Conversations
      1. Improvements of the Previous Program.
      2. Proving the Correctness.
  7. The Problem of the Deadly Embrace.
    1. The Banker's Algorithm.
    2. The Banker's Algorithm Applied
  8. Concluding Remarks.
 @incollection{diningphilo2002,
Author = {Dijkstra, Edsger Wybe},
Booktitle = {The Origin of Concurrent Programming: From Semaphores to Remote Procedure Calls},
Chapter = 2,
Editor = {Hansen, Per Brinch},
Isbn = {0-387-95401-5},
Note = {Reprinted. 1st edition: 1965},
Pages = {65--138},
Publisher = {Springer},
Title = {Co-operating Sequential Processes},
Url = {http://portal.acm.org/citation.cfm?id=762974},
Year = 2002
Tags:

Publication

— authors

Edsger Wybe Dijkstra

— editors

Per Brinch Hansen

— status

published

— sort

book chapter

Venue

— volume

The Origin of Concurrent Programming: From Semaphores to Remote Procedure Calls

— chapter

2

— pages

65-138

— publication date

2002

URLs

original page

Identifiers

— print ISBN

0-387-95401-5

BibTeX

— BibTeX ID
diningphilo2002
— BibTeX category
incollection

Partita IVA: 01131710376 - Copyright © 2008-2022 APICe@DISI Research Group - PRIVACY