concept
active
concept:live-data-structures

Live Data Structures

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.

Neighborhood — ranked by edge-count

Papers (1)

paper

Methods (1)

method
  • Programming technique to restructure a fine-grained Linda program for efficiency by replacing live data structures with passive ones and coarser-grain processes.

Concepts (2)

concept
  • Linda
    implements
    The core parallel programming model introduced in this paper, based on tuple space operations and orthogonal to any base language.
  • Data structures stored as collections of tuples in tuple space, accessible to many processes.

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.