Something has to give

Scaling combinatorial computing by biological agents exploring physical networks encoding NP-complete problems

Falco C.M.J.M. Van Delft, Giulia Ipolitti, Dan V. Nicolau, Ayyappasamy Sudalaiyadum Perumal, Ondřej Kašpar, Sara Kheireddine, Sebastian Wachsmann-Hogiu, Dan V. Nicolau

Research output: Contribution to journalReview article

2 Citations (Scopus)

Abstract

On-chip network-based computation, using biological agents, is a new hardware-embedded approach which attempts to find solutions to combinatorial problems, in principle, in a shorter time than the fast, but sequential electronic computers. This analytical review starts by describing the underlying mathematical principles, presents several types of combinatorial (including NP-complete) problems and shows current implementations of proof of principle developments. Taking the subset sum problem as example for in-depth analysis, the review presents various options of computing agents, and compares several possible operation ‘run modes’ of network-based computer systems. Given the brute force approach of network-based systems for solving a problem of input size C, 2C solutions must be visited. As this exponentially increasing workload needs to be distributed in space, time, and per computing agent, this review identifies the scaling-related key technological challenges in terms of chip fabrication, readout reliability and energy efficiency. The estimated computing time of massively parallel or combinatorially operating biological agents is then compared to that of electronic computers. Among future developments which could considerably improve network-based computing, labelling agents ‘on the fly’ and the readout of their travel history at network exits could offer promising avenues for finding hardware-embedded solutions to combinatorial problems.

Original languageEnglish (US)
JournalInterface Focus
Volume8
Issue number6
DOIs
StatePublished - Dec 6 2018
Externally publishedYes

Fingerprint

Biological Factors
Computational complexity
Hardware
Computer Systems
Workload
Diptera
Labeling
Energy efficiency
Computer systems
Efficiency
Fabrication

Keywords

  • Bio-computation
  • Combinatorial problems
  • Hardware-embedded solutions
  • Network-based computation
  • NP-complete problems
  • Subset sum problem

ASJC Scopus subject areas

  • Biotechnology
  • Biophysics
  • Bioengineering
  • Biochemistry
  • Biomaterials
  • Biomedical Engineering

Cite this

Van Delft, F. C. M. J. M., Ipolitti, G., Nicolau, D. V., Perumal, A. S., Kašpar, O., Kheireddine, S., ... Nicolau, D. V. (2018). Something has to give: Scaling combinatorial computing by biological agents exploring physical networks encoding NP-complete problems. Interface Focus, 8(6). https://doi.org/10.1098/rsfs.2018.0034

Something has to give : Scaling combinatorial computing by biological agents exploring physical networks encoding NP-complete problems. / Van Delft, Falco C.M.J.M.; Ipolitti, Giulia; Nicolau, Dan V.; Perumal, Ayyappasamy Sudalaiyadum; Kašpar, Ondřej; Kheireddine, Sara; Wachsmann-Hogiu, Sebastian; Nicolau, Dan V.

In: Interface Focus, Vol. 8, No. 6, 06.12.2018.

Research output: Contribution to journalReview article

Van Delft, Falco C.M.J.M. ; Ipolitti, Giulia ; Nicolau, Dan V. ; Perumal, Ayyappasamy Sudalaiyadum ; Kašpar, Ondřej ; Kheireddine, Sara ; Wachsmann-Hogiu, Sebastian ; Nicolau, Dan V. / Something has to give : Scaling combinatorial computing by biological agents exploring physical networks encoding NP-complete problems. In: Interface Focus. 2018 ; Vol. 8, No. 6.
@article{90f6af574fbc484fa37460bc7134c236,
title = "Something has to give: Scaling combinatorial computing by biological agents exploring physical networks encoding NP-complete problems",
abstract = "On-chip network-based computation, using biological agents, is a new hardware-embedded approach which attempts to find solutions to combinatorial problems, in principle, in a shorter time than the fast, but sequential electronic computers. This analytical review starts by describing the underlying mathematical principles, presents several types of combinatorial (including NP-complete) problems and shows current implementations of proof of principle developments. Taking the subset sum problem as example for in-depth analysis, the review presents various options of computing agents, and compares several possible operation ‘run modes’ of network-based computer systems. Given the brute force approach of network-based systems for solving a problem of input size C, 2C solutions must be visited. As this exponentially increasing workload needs to be distributed in space, time, and per computing agent, this review identifies the scaling-related key technological challenges in terms of chip fabrication, readout reliability and energy efficiency. The estimated computing time of massively parallel or combinatorially operating biological agents is then compared to that of electronic computers. Among future developments which could considerably improve network-based computing, labelling agents ‘on the fly’ and the readout of their travel history at network exits could offer promising avenues for finding hardware-embedded solutions to combinatorial problems.",
keywords = "Bio-computation, Combinatorial problems, Hardware-embedded solutions, Network-based computation, NP-complete problems, Subset sum problem",
author = "{Van Delft}, {Falco C.M.J.M.} and Giulia Ipolitti and Nicolau, {Dan V.} and Perumal, {Ayyappasamy Sudalaiyadum} and Ondřej Kašpar and Sara Kheireddine and Sebastian Wachsmann-Hogiu and Nicolau, {Dan V.}",
year = "2018",
month = "12",
day = "6",
doi = "10.1098/rsfs.2018.0034",
language = "English (US)",
volume = "8",
journal = "Interface Focus",
issn = "2042-8898",
publisher = "Royal Society Publishing",
number = "6",

}

TY - JOUR

T1 - Something has to give

T2 - Scaling combinatorial computing by biological agents exploring physical networks encoding NP-complete problems

AU - Van Delft, Falco C.M.J.M.

AU - Ipolitti, Giulia

AU - Nicolau, Dan V.

AU - Perumal, Ayyappasamy Sudalaiyadum

AU - Kašpar, Ondřej

AU - Kheireddine, Sara

AU - Wachsmann-Hogiu, Sebastian

AU - Nicolau, Dan V.

PY - 2018/12/6

Y1 - 2018/12/6

N2 - On-chip network-based computation, using biological agents, is a new hardware-embedded approach which attempts to find solutions to combinatorial problems, in principle, in a shorter time than the fast, but sequential electronic computers. This analytical review starts by describing the underlying mathematical principles, presents several types of combinatorial (including NP-complete) problems and shows current implementations of proof of principle developments. Taking the subset sum problem as example for in-depth analysis, the review presents various options of computing agents, and compares several possible operation ‘run modes’ of network-based computer systems. Given the brute force approach of network-based systems for solving a problem of input size C, 2C solutions must be visited. As this exponentially increasing workload needs to be distributed in space, time, and per computing agent, this review identifies the scaling-related key technological challenges in terms of chip fabrication, readout reliability and energy efficiency. The estimated computing time of massively parallel or combinatorially operating biological agents is then compared to that of electronic computers. Among future developments which could considerably improve network-based computing, labelling agents ‘on the fly’ and the readout of their travel history at network exits could offer promising avenues for finding hardware-embedded solutions to combinatorial problems.

AB - On-chip network-based computation, using biological agents, is a new hardware-embedded approach which attempts to find solutions to combinatorial problems, in principle, in a shorter time than the fast, but sequential electronic computers. This analytical review starts by describing the underlying mathematical principles, presents several types of combinatorial (including NP-complete) problems and shows current implementations of proof of principle developments. Taking the subset sum problem as example for in-depth analysis, the review presents various options of computing agents, and compares several possible operation ‘run modes’ of network-based computer systems. Given the brute force approach of network-based systems for solving a problem of input size C, 2C solutions must be visited. As this exponentially increasing workload needs to be distributed in space, time, and per computing agent, this review identifies the scaling-related key technological challenges in terms of chip fabrication, readout reliability and energy efficiency. The estimated computing time of massively parallel or combinatorially operating biological agents is then compared to that of electronic computers. Among future developments which could considerably improve network-based computing, labelling agents ‘on the fly’ and the readout of their travel history at network exits could offer promising avenues for finding hardware-embedded solutions to combinatorial problems.

KW - Bio-computation

KW - Combinatorial problems

KW - Hardware-embedded solutions

KW - Network-based computation

KW - NP-complete problems

KW - Subset sum problem

UR - http://www.scopus.com/inward/record.url?scp=85056538474&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85056538474&partnerID=8YFLogxK

U2 - 10.1098/rsfs.2018.0034

DO - 10.1098/rsfs.2018.0034

M3 - Review article

VL - 8

JO - Interface Focus

JF - Interface Focus

SN - 2042-8898

IS - 6

ER -