concept
active
concept:linda

Linda

The core parallel programming model introduced in this paper, based on tuple space operations and orthogonal to any base language.

Neighborhood — ranked by edge-count

Papers (1)

paper

Frameworks (5)

framework
  • C-Linda
    extendsimplements
    The C language embedding of Linda operations.
  • Concurrent Object-Oriented Programming
    contradicts
    A major competing approach to parallel programming based on instantiating objects with embedded active processes and monitors for synchronization.
  • Concurrent Logic Programming
    contradicts
    A parallel programming approach using guarded clauses and shared logical variables, exemplified by Parlog and Concurrent Prolog.
  • Pure Functional Programming
    contradicts
    A paradigm relying on recursion equations without assignment; Linda authors compare it on DNA sequence similarity problem.
  • Message Passing
    extends
    Traditional parallel programming model requiring explicit point-to-point communication; Linda generalizes this via tuple spaces.

Communities (1)

community

Claims (4)

claim

Concepts (18)

concept
  • Nicholas Carriero
    authoredimplements
    Co-author introducing Linda, a parallel programming model based on tuple spaces.
  • David Gelernter
    authoredimplements
    Co-author introducing Linda, a parallel programming model based on tuple spaces.
  • Dining Philosophers Problem
    aboutassociated_with
    A classic concurrency benchmark problem used to test expressivity of parallel programming primitives; second main example for Parlog-Linda comparison.
  • Uncoupled Programming Style
    associated_withimplements
    A programming paradigm where senders and receivers in Linda need not know anything about each other, reducing coupling in parallel programs.
  • Client-Server Paradigm
    aboutassociated_with
    A communication pattern where multiple client processes communicate with a single server; one of two main examples used to compare Parlog and Linda.
  • Ian Piumarta
    associated_with
    Author of the paper proposing n-way associative lookup as a unifying primitive for dynamic language semantics.
  • Smalltalk
    associated_with
    Canonical example throughout paper of dynamic dispatch and late-binding mechanisms that rely centrally on associative lookup; primary motivating language.
  • Tuple Space
    implements
    A region where processes deposit and retrieve persistent tuples; central to Linda's asynchronous coordination model.
  • Parlog86
    associated_with
    Concurrent logic language; Linda authors demonstrate simpler solutions to client-server and dining philosophers problems.
  • Generative Communication
    implements
    The principle underlying Linda where processes generate data objects (tuples) that drift into tuple space for other processes to discover and access.
  • Live Data Structures
    implements
    A structuring technique where each element of a result is computed by a separate process that turns into a data element; enables fine-grained parallelism.
  • Emerald
    associated_with
    State-of-the-art concurrent object system using monitors; Linda authors compare and critique its synchronous RPC-based communication.
  • DNA Sequence Similarity
    associated_with
    A matrix-computation problem ideal for functional languages; Linda's explicit live data structures match functional elegance with runtime control.
  • Message-Passing Model
    contradicts
    Traditional parallel programming model where processes send directed messages to each other; contrasted with Linda's generative communication.
  • Ehud Shapiro
    cites
    Proposed the three leading parallel-programming approaches (object-oriented, logic, functional); editor of Concurrent Prolog collected papers.
  • Mach
    associated_with
    A distributed operating system that uses message passing.
  • CSP
    associated_with
  • 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.
    about
    Foundational principle: Linda's orthogonality to base language and computation model is its core strength.

Institutes (2)

institute
  • Yale University
    cites
    Institutional affiliation of Antony Courtney, Department of Computer Science.
  • Sandia National Labs
    cites
    Institution using Linda in production for parameter sensitivity analysis of rocket plume simulations.

Artifacts (1)

artifact
  • Intel iPSC/2
    implements
    A distributed-memory multicomputer on which Linda has been implemented and tested; described as the largest machine used to date.

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.