claim
active
claim:linda-is-a-simpler-more-powerful-and-more-elegant-model-than-any-of-these-four-alternatives-message-passing-concurrent-objects-logic-languages-functional

Linda is a simpler, more powerful and more elegant model than any of these four alternatives (message-passing, concurrent objects, logic languages, functional).

The central thesis of the paper, stated explicitly in the introduction.

Source paper

extracted_from
Linda in context
(1989) · Carrier, Nicholas · Gelernter, David

Neighborhood — ranked by edge-count

Findings (1)

finding

Communities (2)

community

Frameworks (4)

framework
  • A major competing approach to parallel programming based on instantiating objects with embedded active processes and monitors for synchronization.
  • Crystal
    contradicts
    Pure functional language with compiler-directed parallelism; Linda authors compare it on DNA sequence similarity computation.
  • A parallel programming approach using guarded clauses and shared logical variables, exemplified by Parlog and Concurrent Prolog.
  • One of the three major competing approaches to parallel programming mentioned in the paper; used for comparison with Linda.

Concepts (2)

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

Questions (2)

question

Artifacts (1)

artifact
  • The source article that introduces and argues for the Linda parallel programming model, comparing it to message-passing, concurrent objects, logic programming, and functional programming.

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.