Distributed Agreement in Tile Self-assembly

Abstract. Laboratory investigations have shown that a formal theory of fault-tolerance will be essential to harness nanoscale self-assembly as a medium of computation. Several researchers have voiced an intuition that self-assembly phenomena are related to the field of distributed computing. This paper formalizes some of that intuition. We construct tile assembly systems that are able to simulate the solution of the wait-free consensus problem in some distributed systems. This potentially allows binding errors in tile assembly to be analyzed (and managed) with positive results in distributed computing, as a “blockage” in our tile assembly model is analogous to a crash failure in a distributed computing model. We also define a strengthening of the “traditional” consensus problem, to make explicit an expectation about consensus algorithms that is often implicit in distributed computing literature. We show that solution of this strengthened consensus problem can be simulated by ...

• Type: Conference
• Year: 2009
• Where: DNA
• Authors: Aaron Sterling
• Keywords: Computational Biology, Distributed Computing, DNA 2009, Tile Assembly, Tile Assembly Model