framework
active
framework:message-passing

Message Passing

Traditional parallel programming model requiring explicit point-to-point communication; Linda generalizes this via tuple spaces.

Neighborhood — ranked by edge-count

Papers (1)

paper

Concepts (1)

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

Frameworks (2)

framework
  • Algorithm for approximate Bayesian inference based on mean-field approximation.
  • A message-passing concurrency model where processes (actors) communicate via messages (talks) and generate new processes; related to concurrent objects.

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.

  • Traditional parallel programming model where processes send directed messages to each other; contrasted with Linda's generative communication.
  • Algorithmic framework for probabilistic inference in graphical models.
  • Message passing algorithm for approximate Bayesian inference using mean-field factorisation.
  • Message Busframework0.789
    Pattern enabling backplane to alert applications of state changes via decoupled messaging rather than direct calls.
  • Levin proposes viewing memories as stigmergic notes left by past Selflets; parallelizes vertical (temporal) communication with horizontal (social) communication.
  • Branching Textconcept0.739
  • processesconcept0.732
    Represented by boxes in process theory; transformations that take systems as inputs/outputs
  • Inference mechanism underlying active inference; updates posterior beliefs via gradient descent on free energy.