27 January 2023 in Nature Communications
The fundamental energy cost of irreversible computing is given by the Landauer bound of $$kT\ln 2$$ /bit, where k is the Boltzmann constant and T is the temperature in Kelvin. However, this limit is only achievable for infinite-time processes. We here determine the fundamental energy cost of finite-time parallelizable computing within the framework of nonequilibrium thermodynamics. We apply these results to quantify the energetic advantage of parallel computing over serial computing. We find that the energy cost per operation of a parallel computer can be kept close to the Landauer limit even for large problem sizes, whereas that of a serial computer fundamentally diverges. We analyze, in particular, the effects of different degrees of parallelization and amounts of overhead, as well as the influence of non-ideal electronic hardware. We further discuss their implications in the context of current technology. Our findings provide a physical basis for the design of energy-efficient computers.
14 March 2017 in Bioconjugate Chemistry
9 August 2022 in Nano Futures
Network-based biocomputation (NBC) is an alternative, parallel computation approach that can potentially solve technologically important, combinatorial problems with much lower energy consumption than electronic processors. In NBC, a combinatorial problem is encoded into a physical, nanofabricated network. The problem is solved by biological agents (such as cytoskeletal filaments driven by molecular motors) that explore all possible pathways through the network in a massively parallel and highly energy-efficient manner. Whereas there is currently a rapid development in the size and types of problems that can be solved by NBC in proof-of-principle experiments, significant challenges still need to be overcome before NBC can be scaled up to fill a technological niche and reach an industrial level of manufacturing. Here, we provide a roadmap that identifies key scientific and technological needs. Specifically, we identify technology benchmarks that need to be reached or overcome, as well as possible solutions for how to achieve this. These include methods for large-scale production of nanoscale physical networks, for dynamically changing pathways in these networks, for encoding information onto biological agents, for single-molecule readout technology, as well as the integration of each of these approaches in large-scale production. We also introduce figures of merit that help analyze the scalability of various types of NBC networks and we use these to evaluate scenarios for major technological impact of NBC. A major milestone for NBC will be to increase parallelization to a point where the technology is able to outperform the current run time of electronic processors. If this can be achieved, NBC would offer a drastic advantage in terms of orders of magnitude lower energy consumption. In addition, the fundamentally different architecture of NBC compared to conventional electronic computers may make it more advantageous to use NBC to solve certain types of problems and instances that are easy to parallelize. To achieve these objectives, the purpose of this roadmap is to identify pre-competitive research domains, enabling cooperation between industry, institutes, and universities for sharing research and development efforts and reducing development cost and time.
2 October 2022 in Advanced Intelligent Systems
CMChristoph Robert Meinecke
Christoph Robert Meinecke
+5
The 3‐satisfiability Problem (3‐SAT) is a demanding combinatorial problem that is of central importance among the nondeterministic polynomial (NP) complete problems, with applications in circuit design, artificial intelligence, and logistics. Even with optimized algorithms, the solution space that needs to be explored grows exponentially with the increasing size of 3‐SAT instances. Thus, large 3‐SAT instances require excessive amounts of energy to solve with serial electronic computers. Network‐based biocomputation (NBC) is a parallel computation approach with drastically reduced energy consumption. NBC uses biomolecular motors to propel cytoskeletal filaments through nanofabricated networks that encode mathematical problems. By stochastically exploring possible paths through the networks, the cytoskeletal filaments find possible solutions. However, to date, no NBC algorithm for 3‐SAT has been available. Herein, an algorithm that converts 3‐SAT into an NBC‐compatible network format is reported and four small 3‐SAT instances (with up to three variables and five clauses) using the actin–myosin biomolecular motor system are experimentally solved. Because practical polynomial conversions to 3‐SAT exist for many important NP complete problems, the result opens the door to enable NBC to solve small instances of a wide range of problems.
23 June 2022 in ACS Nanoscience Au
CMChristoph Robert Meinecke
Christoph Robert Meinecke
+5
Information processing by traditional, serial electronic processors consumes an ever-increasing part of the global electricity supply. An alternative, highly energy efficient, parallel computing paradigm is network-based biocomputation (NBC). In NBC a given combinatorial problem is encoded into a nanofabricated, modular network. Parallel exploration of the network by a very large number of independent molecular-motor-propelled protein filaments solves the encoded problem. Here we demonstrate a significant scale-up of this technology by solving four instances of Exact Cover, a nondeterministic polynomial time (NP) complete problem with applications in resource scheduling. The difficulty of the largest instances solved here is 128 times greater in comparison to the current state of the art for NBC.