Memory Consistency Conditions for Self-Assembly Programming

Free registration required

Executive Summary

Perhaps the two most significant theoretical questions about the programming of self-assembling agents are: necessary and sufficient conditions to produce a unique terminal assembly, and error correction. The authors address both questions, by reducing two well-studied models of tile assembly to models of Distributed Shared Memory (DSM), in order to obtain results from the memory consistency systems induced by tile assembly systems when simulated in the DSM setting. The Abstract Tile Assembly Model (aTAM) can be simulated by a DSM system that obeys causal consistency, and the locally deterministic tile assembly systems in the aTAM correspond exactly to the concurrent-write free programs that simulate tile assembly in such a model.

  • Format: PDF
  • Size: 199.08 KB