Abstract
Abstract
All known algorithms to solve nondeterministic polynomial (NP) complete problems, relevant to many real-life applications, require the exploration of a space of potential solutions, which grows exponentially with the size of the problem. Since electronic computers can implement only limited parallelism, their use for solving NP-complete problems is impractical for very large instances, and consequently alternative massively parallel computing approaches were proposed to address this challenge. We present a scaling analysis of two such alternative computing approaches, DNA computing (DNA-C) and network biocomputing with agents (NB-C), compared with electronic computing (E-C). The Subset Sum Problem (SSP), a known NP-complete problem, was used as a computational benchmark, to compare the volume, the computing time, and the energy required for each type of computation, relative to the input size. Our analysis shows that the sequentiality of E-C translates in a very small volume compared to that required by DNA-C and NB-C, at the cost of the E-C computing time being outperformed first by DNA-C (linear run time), followed by NB-C. Finally, NB-C appears to be more energy-efficient than DNA-C for some types of input sets, while being less energy-efficient for others, with E-C being always an order of magnitude less energy efficient than DNA-C. This scaling study suggest that presently none of these computing approaches win, even theoretically, for all three key performance criteria, and that all require breakthroughs to overcome their limitations, with potential solutions including hybrid computing approaches.
Funder
Horizon 2020 Framework Programme
Natural Sciences and Engineering Research Council of Canada
Social Sciences and Humanities Research Council of Canada
Defense Advanced Research Projects Agency
Subject
General Physics and Astronomy
Reference124 articles.
1. Protein design is NP-hard;Pierce;Protein Eng. Des. Select.,2002
2. Complexity of protein folding;Fraenkel;Bull. Math. Biol.,1993
3. On modularity clustering;Brandes;IEEE Trans. Knowl. Data Eng.,2008
4. A new FPGA detailed routing approach via search-based Boolean satisfiability;Gi-Joon Nam;IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.,2002
5. Neural computation of decisions in optimization problems;Hopfield;Biol. Cybern.,1985
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献