Linda achieves scalable performance on distributed-memory machines.

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

• Linda is portable across a wide range of parallel machines.claim0.848
  Claim supported by the list of implemented platforms.
• Linda is a simpler, more powerful and more elegant model than any of these four alternatives (message-passing, concurrent objects, logic languages, functional).claim0.824
  The central thesis of the paper, stated explicitly in the introduction.
• Linda can express fine-grained wavefront computations cleanly; future implementations on next-generation machines can support them efficiently.hypothesis0.817
• Linda runs on shared-memory (Encore Multimax, Sequent Balance/Symmetry, Alliant FX/8), distributed-memory (Intel iPSC/2, S/Net), and LAN (Vax/VMS) environments.finding0.817
  Lists the concrete systems on which Linda had been implemented.
• Linda is a model of process creation and coordination that is orthogonal to the base language in which it’s embedded.quote0.811
  Load-bearing definition of Linda's relation to the base language.
• 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.809
  Foundational principle: Linda's orthogonality to base language and computation model is its core strength.
• Linda is a more practical and a more elegant alternative to concurrent logic programming.claim0.795
  Overall comparison conclusion against concurrent logic.
• Linda wins the freedom to coexist peacefully with any number of base languages and computing models.concept0.791
  Load-bearing statement on Linda's orthogonal design principle: it doesn't meddle in computation, only coordination.