Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Gottlieb, LA., Savage, J. & Yerukhimovich, A. Efficient Data Storage in Large Nanoarrays. Theory Comput Syst 38, 503–536 (2005). https://doi.org/10.1007/s00224-004-1196-9
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-004-1196-9