framework
active
framework:message-passingMessage 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
- Linda in contextcites
Concepts (1)
concept
- LindaextendsThe core parallel programming model introduced in this paper, based on tuple space operations and orthogonal to any base language.
Frameworks (2)
framework
- Variational Message Passingrelated_toAlgorithm for approximate Bayesian inference based on mean-field approximation.
- Actors ModelextendsA 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 edgeEntities 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.
- 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.
- 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.