Difference between revisions of "A cost/speed/reliability tradeoff to erasing"
From Thermodynamics of Computation
(Created page with "{{Reference Material |title=A cost/speed/reliability tradeoff to erasing |reference groups=Computer Science Theory, General Non-equilibrium Statistical Physics, Stochastic The...") |
(use Math) |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Line 11: | Line 11: | ||
|doi=10.1007/978-3-319-21819-9_14 | |doi=10.1007/978-3-319-21819-9_14 | ||
|isbn=9783319218182 | |isbn=9783319218182 | ||
| + | |arxiv=https://arxiv.org/abs/1410.1710 | ||
|scopus=2-s2.0-84943625259 | |scopus=2-s2.0-84943625259 | ||
|pui=606383559 | |pui=606383559 | ||
| − | |abstract=We present a KL-control treatment of the fundamental problem of erasing a bit. We introduce notions of "reliability" of information storage via a reliability timescale | + | |abstract=We present a KL-control treatment of the fundamental problem of erasing a bit. We introduce notions of "reliability" of information storage via a reliability timescale <math>\tau_r</math>, and "speed" of erasing via an erasing timescale <math>\tau_e</math>. Our problem formulation captures the tradeoff between speed, reliability, and the Kullback-Leibler (KL) cost required to erase a bit. We show that rapid erasing of a reliable bit costs at least <math>\log 2 - \log\left(1 - \operatorname{e}^{-\frac{\tau_e}{\tau_r}}\right) > \log 2</math>, which goes to <math>\frac{1}{2} \log\frac{2\tau_r}{\tau_e}</math> when <math>\tau_r>>\tau_e</math>. |
|Mendeley link=http://www.mendeley.com/research/costspeedreliability-tradeoff-erasing | |Mendeley link=http://www.mendeley.com/research/costspeedreliability-tradeoff-erasing | ||
|pages=192-201 | |pages=192-201 | ||
Latest revision as of 15:19, April 29, 2019
- reference groups
- Computer Science Theory
- General Non-equilibrium Statistical Physics
- Stochastic Thermodynamics
- author-supplied keywords
- keywords
- authors
- Manoj Gopalkrishnan
- title
- A cost/speed/reliability tradeoff to erasing
- type
- conference_proceedings
- year
- 2015
- pages
- 192-201
- volume
- 9252
- publisher
- Springer Verlag
- abstract
- We present a KL-control treatment of the fundamental problem of erasing a bit. We introduce notions of "reliability" of information storage via a reliability timescale [math]\displaystyle{ \tau_r }[/math], and "speed" of erasing via an erasing timescale [math]\displaystyle{ \tau_e }[/math]. Our problem formulation captures the tradeoff between speed, reliability, and the Kullback-Leibler (KL) cost required to erase a bit. We show that rapid erasing of a reliable bit costs at least [math]\displaystyle{ \log 2 - \log\left(1 - \operatorname{e}^{-\frac{\tau_e}{\tau_r}}\right) \gt \log 2 }[/math], which goes to [math]\displaystyle{ \frac{1}{2} \log\frac{2\tau_r}{\tau_e} }[/math] when [math]\displaystyle{ \tau_r\gt \gt \tau_e }[/math].
Counts
- Citation count
- Page views
- 13
Identifiers
- doi: 10.1007/978-3-319-21819-9_14 (Google search)
- issn: 16113349
- sgr: 84943625259
- isbn: 9783319218182
- arxiv: https://arxiv.org/abs/1410.1710
- scopus: 2-s2.0-84943625259
- pui: 606383559
