Linda is portable across a wide range of parallel machines.

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

• Linda achieves scalable performance on distributed-memory machines.claim0.848
  Supported by reported speedup through 64 nodes on iPSC/2.
• Linda is a simpler, more powerful and more elegant model than any of these four alternatives (message-passing, concurrent objects, logic languages, functional).claim0.839
  The central thesis of the paper, stated explicitly in the introduction.
• Linda applications show good speedup through 64 nodes on shared-memory and distributed-memory multicomputers.finding0.806
  Empirical evidence of Linda's practical viability across diverse hardware platforms.
• Linda is a more practical and a more elegant alternative to concurrent logic programming.claim0.794
  Overall comparison conclusion against concurrent logic.
• Linda is a model of process creation and coordination that is orthogonal to the base language in which it’s embedded.quote0.784
  Load-bearing definition of Linda's relation to the base language.
• Linda can express fine-grained wavefront computations cleanly; future implementations on next-generation machines can support them efficiently.hypothesis0.780
• Linda programming language exemplifies bringing craft principles into computational systems.claim0.765
• The Linda model doesn't care how the multiple execution threads in a Linda program compute what they compute; it deals only with how these execution threads are created and organized into a coherent program.concept0.765
  Foundational principle: Linda's orthogonality to base language and computation model is its core strength.