concept
active
concept:dining-philosophers-problem

Dining Philosophers Problem

A classic concurrency benchmark problem used to test expressivity of parallel programming primitives; second main example for Parlog-Linda comparison.

Neighborhood — ranked by edge-count

Papers (1)

paper

Thinkers (2)

thinker
  • Author of the Parlog86 article in Communications of the ACM used as the main comparison point for concurrent logic programming.
  • Edsger W. Dijkstra
    associated_with
    Originator of the dining philosophers problem, used as a concurrency benchmark.

Frameworks (1)

framework
  • Parlog
    about
    A concurrent logic language featured prominently in recent ACM literature; used as a primary comparison point for Linda.

Concepts (2)

concept
  • Linda
    aboutassociated_with
    The core parallel programming model introduced in this paper, based on tuple space operations and orthogonal to any base language.
  • Parlog86
    associated_with
    Concurrent logic language; Linda authors demonstrate simpler solutions to client-server and dining philosophers problems.

Related by similarity (8)

cosine ≥ 0.65 · no typed edge

Entities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.