claim
active
claim:interpretive-abstraction-is-a-fairly-simple-programming-technique-but-it-s-only-possible-if-the-parallelism-tools-are-under-the-programmer-s-control

Interpretive abstraction is a fairly simple programming technique, but it's only possible if the parallelism tools are under the programmer's control.

Contrasts with auto-parallelizing compilers; flexibility of Linda.

Source paper

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

Neighborhood — ranked by edge-count

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.