skip to main content

Explore Research Products in the NSF-PAR

Title: Analysis of Heat Dissipation and Reliability in Information Erasure: A Gaussian Mixture Approach
This article analyzes the effect of imperfections in physically realizable memory. Motivated by the realization of a bit as a Brownian particle within a double well potential, we investigate the energetics of an erasure protocol under a Gaussian mixture model. We obtain sharp quantitative entropy bounds that not only give rigorous justification for heuristics utilized in prior works, but also provide a guide toward the minimal scale at which an erasure protocol can be performed. We also compare the results obtained with the mean escape times from double wells to ensure reliability of the memory. The article quantifies the effect of overlap of two Gaussians on the the loss of interpretability of the state of a one bit memory, the required heat dissipated in partially successful erasures and reliability of information stored in a memory bit.  more » « less
Award ID(s):
1809194
NSF-PAR ID:
10113694
Author(s) / Creator(s):
; ; ;
Date Published:
Journal Name:
Entropy
Volume:
20
Issue:
10
ISSN:
1099-4300
Page Range / eLocation ID:
749
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; ; ( , IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems)
    In this paper, we propose an energy-efficient reconfigurable platform for in-memory processing based on novel 4-terminal spin Hall effect-driven domain wall motion devices that could be employed as both non-volatile memory cell and in-memory logic unit. The proposed designs lead to unity of memory and logic. The device to system level simulation results show that, with 28% area increase in memory structure, the proposed in-memory processing platform achieves a write energy ~15.6 fJ/bit with 79% reduction compared to that of SOT-MRAM counterpart while keeping the identical 1ns writing speed. In addition, the proposed in-memory logic scheme improves the operating energy by 61.3%, as compared with the recent non-volatile in-memory logic designs. An extensive reliability analysis is also performed over the proposed circuits. We employ Advanced Encryption Standard (AES) algorithm as a case study to elucidate the efficiency of the proposed platform at application level. Simulation results exhibit that the proposed platform can show up to 75.7% and 30.4% lower energy consumption compared to CMOS-ASIC and recent pipelined domain wall (DW) AES implementations, respectively. In addition, the AES Energy-Delay Product (EDP) can show 15.1% and 6.1% improvements compared to the DW-AES and CMOS-ASIC implementations, respectively. 
    more » « less
  2. ; ; ; ; ( , 2021 IEEE International Symposium on Information Theory (ISIT))
    Streaming codes take a string of source symbols as input and output a string of coded symbols in real time, which effectively eliminate the queueing delay and are regarded as a promising scheme for low latency communications. Aiming at quantifying the fundamental latency performance of random linear streaming codes (RLSCs) over i.i.d. symbol erasure channels, this work derives the exact error probability under, simultaneously, the finite memory length and finite decoding deadline constraints. The result is then used to examine the tradeoff among memory length (complexity), decoding deadline (delay), and error probability (reliability) of RLSCs for the first time in the literature. Two critical observations are made: (i) Too much memory can adversely impact the performance under a finite decoding deadline constraint, a surprising finding not captured by the traditional wisdom that large memory length monotonically improves the performance in the asymptotic regime; (ii) The end-to-end delay of the RLSC is roughly 50% of that of the MDS block code when under identical code rate and error probability requirements. This implies that switching from block codes to RLSCs not only eliminates the queueing delay (thus 50%) but also has little negative impact on the error probability. 
    more » « less
  3. ; ( , 2021 Wireless Telecommunications Symposium (WTS))
    null (Ed.)
    In this paper, we show that caching can aid in achieving secure communications by considering a wiretap scenario where the transmitter and legitimate receiver share access to a secure cache, and an eavesdropper is able to tap transmissions over a binary erasure wiretap channel during the delivery phase of a caching protocol. The scenario under consideration gives rise to a new channel model for wiretap coding that allows the transmitter to effectively choose a subset of bits to erase at the eavesdropper by caching the bits ahead of time. The eavesdropper observes the remainder of the coded bits through the wiretap channel for the general case. In the wiretap type-II scenario, the eavesdropper is able to choose a set of revealed bits only from the subset of bits not cached. We present a coding approach that allows efficient use of the cache to realize a caching gain in the network, and show how to use the cache to optimize the information theoretic security in the choice of a finite blocklength code and the choice of the cached bit set. To our knowledge, this is the first work on explicit algorithms for secrecy coding in any type of caching network. 
    more » « less
  4. ; ; ( , Mathematics of Control, Signals, and Systems)
    Abstract In the last decade, the interactions among histone modifications and DNA methylation and their effect on the DNA structure, i.e., chromatin state, have been identified as key mediators for the maintenance of cell identity, defined as epigenetic cell memory. In this paper, we determine how the positive feedback loops generated by the auto- and cross-catalysis among repressive modifications affect the temporal duration of the cell identity. To this end, we conduct a stochastic analysis of a recently published chromatin modification circuit considering two limiting behaviors: fast erasure rate of repressive histone modifications or fast erasure rate of DNA methylation. In order to perform this mathematical analysis, we first show that the deterministic model of the system is a singular singularly perturbed (SSP) system and use a model reduction approach for SSP systems to obtain a reduced one-dimensional model. We thus analytically evaluate the reduced system’s stationary probability distribution and the mean switching time between active and repressed chromatin states. We then add a computational study of the original reaction model to validate and extend the analytical findings. Our results show that the absence of DNA methylation reduces the bias of the system’s stationary probability distribution toward the repressed chromatin state and the temporal duration of this state’s memory. In the absence of repressive histone modifications, we also observe that the time needed to reactivate a repressed gene with an activating input is less stochastic, suggesting that repressive histone modifications specifically contribute to the highly variable latency of state reactivation. 
    more » « less
  5. ; ; ; ( , Proceedings of the 25th USENIX Security Symposium)
    Row hammer attacks exploit electrical interactions between neighboring memory cells in high-density dynamic random-access memory (DRAM) to induce memory errors. By rapidly and repeatedly accessing DRAMs with specific patterns, an adversary with limited privilege on the target machine may trigger bit flips in memory regions that he has no permission to access directly. In this paper, we explore row hammer attacks in cross-VM settings, in which a malicious VM exploits bit flips induced by row hammer attacks to crack memory isolation enforced by virtualization. To do so with high fidelity, we develop novel techniques to determine the physical address mapping in DRAM modules at runtime (to improve the effectiveness of double-sided row hammer attacks), methods to exhaustively hammer a large fraction of physical memory from a guest VM (to collect exploitable vulnerable bits), and innovative approaches to break Xen paravirtualized memory isolation (to access arbitrary physical memory of the shared machine). Our study also suggests that the demonstrated row hammer attacks are applicable in modern public clouds where Xen paravirtualization technology is adopted. This shows that the presented cross-VM row hammer attacks are of practical importance. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email