SwePub
Sök i SwePub databas

  Extended search

Träfflista för sökning "WFRF:(Konopik Michael) "

Search: WFRF:(Konopik Michael)

  • Result 1-2 of 2
Sort/group result
   
EnumerationReferenceCoverFind
1.
  • Konopik, Michael, et al. (author)
  • Fundamental energy cost of finite-time parallelizable computing
  • 2023
  • In: Nature Communications. - : Springer Science and Business Media LLC. - 2041-1723. ; 14:1
  • Journal article (peer-reviewed)abstract
    • The fundamental energy cost of irreversible computing is given by the Landauer bound of kTln 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.
  •  
2.
  • Konopik, Michael, et al. (author)
  • Solving the subset sum problem with a nonideal biological computer
  • 2021
  • In: New Journal of Physics. - : IOP Publishing. - 1367-2630. ; 23:9
  • Journal article (peer-reviewed)abstract
    • We consider the solution of the subset sum problem based on a parallel computer consisting of self-propelled biological agents moving in a nanostructured network that encodes the computing task in its geometry. We develop an approximate analytical method to analyze the effects of small errors in the nonideal junctions composing the computing network by using a Gaussian confidence interval approximation of the multinomial distribution. We concretely evaluate the probability distribution for error-induced paths and determine the minimal number of agents required to obtain a proper solution. We finally validate our theoretical results with exact numerical simulations of the subset sum problem for different set sizes and error probabilities, and discuss the scalability of the nonideal problem using realistic experimental error probabilities.
  •  
Skapa referenser, mejla, bekava och länka
  • Result 1-2 of 2
Type of publication
journal article (2)
Type of content
peer-reviewed (2)
Author/Editor
Korten, Till (2)
Linke, Heiner (2)
Konopik, Michael (2)
Lutz, Eric (2)
University
Lund University (2)
Language
English (2)
Research subject (UKÄ/SCB)
Natural sciences (2)

Year

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view