Theory of Computing Systems

, Volume 38, Issue 4, pp 503–536 | Cite as

Efficient Data Storage in Large Nanoarrays

  • Lee-Ad J. GottliebEmail author
  • John E. SavageEmail author
  • Arkady YerukhimovichEmail author


We explore the storage of data in very large crossbars with dimensions measured in nanometers (nanoarrays) when h-hot addressing is used to bridge the nano/micro gap. In h-hot addressing h of b micro-level wires are used to address a single nanowire. Proposed nanotechnologies allow subarrays of 1s (stores) or 0s (restores) to be written. When stores and restores are used, we show exponential reductions in programming time for prototypical problems over stores alone. Under both operations, it is NP-hard to find optimal array programs. Under stores alone it is NP-hard to find good approximations to this problem, a question that is open when restores are allowed. Because of the difficulty of programming multiple rows at once, we explore the programming of single rows under h-hot addressing. We also identify conditions under which good approximations to these problems exist.


Computational Mathematic Data Storage Efficient Data Programming Time Single Nanowire 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer 2005

Authors and Affiliations

  1. 1.Department of Computer Science, Brown University, Providence, RI 02912-1910USA

Personalised recommendations