concept
active
concept:distributed-hash-tablesdistributed hash tables
Implementation technique used in Linda ports for distributed-memory machines like the Intel hypercube.
Neighborhood — ranked by edge-count
Papers (1)
paper
- Linda in contextcites
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.
- Data structures stored as collections of tuples in tuple space, accessible to many processes.
- Key notion where alignment map ϕ maps neurons block-wise to latent variables before constructive abstraction
- Idea that information is spread across many neurons; superposition is a subtype.
- The core method introduced in this paper: finds alignments between high-level causal variables and distributed neural representations via gradient descent.
- Cognitive process spread across human and non-human agents; a goal of Pask’s and Friedman’s cybernetic diagrams.
- The challenge of assigning reward to individual parts in a distributed system; central to collective intelligence.
- Practical method by Geiger et al. for finding distributed causal abstractions using gradient descent