concept
active
concept:linda-tuple-space-modelLinda (tuple space model)
A model of process creation and coordination based on generative communication and tuple spaces; the central topic of the paper.
Neighborhood — ranked by edge-count
Frameworks (3)
framework
- Actors ModelcontradictsA message-passing concurrency model where processes (actors) communicate via messages (talks) and generate new processes; related to concurrent objects.
- C-LindaimplementsThe C language embedding of Linda operations.
- Monitor model (Hoare)contradictsConcurrency control using monitors with condition queues; compared to Linda's tuple space.
Communities (1)
community
- Generative Communicationimplementsmembers_of
Methods (4)
method
- eval() OperationimplementsLinda primitive that creates a live tuple (new process); it turns into a data tuple upon termination.
- in() OperationimplementsLinda primitive that withdraws a tuple matching a template; blocks if no match.
- out() OperationimplementsLinda primitive to generate a new data object (tuple) in tuple space.
- rd() OperationimplementsLinda primitive that reads a tuple without removing it; blocks if no match.
Concepts (4)
concept
- Tuple SpaceimplementsA region where processes deposit and retrieve persistent tuples; central to Linda's asynchronous coordination model.
- Nicholas Carrieroassociated_withCo-author introducing Linda, a parallel programming model based on tuple spaces.
- David Gelernterassociated_withCo-author introducing Linda, a parallel programming model based on tuple spaces.
- Generative CommunicationimplementsThe principle underlying Linda where processes generate data objects (tuples) that drift into tuple space for other processes to discover and access.
Artifacts (3)
artifact
- Linda in Context (1989)introducesThe source article that introduces and argues for the Linda parallel programming model, comparing it to message-passing, concurrent objects, logic programming, and functional programming.
- Linda MachineimplementsHardware prototype that supports tuple space operations directly.
- Linda system (Yale implementation)implementsThe actual Linda implementation from the Yale group, including C and Fortran versions, running on various parallel machines.
Related by similarity (8)
cosine ≥ 0.65 · no typed edgeEntities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.
- Comment on the conceptual elegance of the model, used in conclusion.
- Key advantage: the same operations handle all three aspects of parallel coordination.
- The central thesis of the paper, stated explicitly in the introduction.
- The core parallel programming model introduced in this paper, based on tuple space operations and orthogonal to any base language.
- Load-bearing definition of Linda's relation to the base language.
- Claim supported by the list of implemented platforms.
- The Actors model covers fewer programming patterns than Linda, but in a more complicated way.claim0.713Critique that Actors is less expressive yet more complex.