DOE Patents title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Memory access system

Abstract

A method and system for accessing a memory for a data processing system. The method comprises sending a read request for a plurality of locations in the memory to read the plurality of locations in parallel based on an upper bound for reading the memory. The upper bound for a number of locations is based on a group of constraints for the memory. The method receives a summed value of a plurality of memory values in the plurality of locations in the memory.

Inventors:
; ; ;
Issue Date:
Research Org.:
Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
Sponsoring Org.:
USDOE
OSTI Identifier:
1650900
Patent Number(s):
10649663
Application Number:
15/665,075
Assignee:
National Technology & Engineering Solutions of Sandia, LLC (Albuquerque, NM)
Patent Classifications (CPCs):
G - PHYSICS G06 - COMPUTING G06F - ELECTRIC DIGITAL DATA PROCESSING
H - ELECTRICITY H03 - BASIC ELECTRONIC CIRCUITRY H03M - CODING
DOE Contract Number:  
NA0003525
Resource Type:
Patent
Resource Relation:
Patent File Date: 07/31/2017
Country of Publication:
United States
Language:
English
Subject:
97 MATHEMATICS AND COMPUTING

Citation Formats

James, Conrad D., Quach, Tu-Thach, Agarwal, Sapan, and Aimone, James Bradley. Memory access system. United States: N. p., 2020. Web.
James, Conrad D., Quach, Tu-Thach, Agarwal, Sapan, & Aimone, James Bradley. Memory access system. United States.
James, Conrad D., Quach, Tu-Thach, Agarwal, Sapan, and Aimone, James Bradley. Tue . "Memory access system". United States. https://www.osti.gov/servlets/purl/1650900.
@article{osti_1650900,
title = {Memory access system},
author = {James, Conrad D. and Quach, Tu-Thach and Agarwal, Sapan and Aimone, James Bradley},
abstractNote = {A method and system for accessing a memory for a data processing system. The method comprises sending a read request for a plurality of locations in the memory to read the plurality of locations in parallel based on an upper bound for reading the memory. The upper bound for a number of locations is based on a group of constraints for the memory. The method receives a summed value of a plurality of memory values in the plurality of locations in the memory.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Tue May 12 00:00:00 EDT 2020},
month = {Tue May 12 00:00:00 EDT 2020}
}

Works referenced in this record:

Method for Reconstructing Sparse Signals from Distorted Measurements
patent-application, May 2011


Page Mode Access for Non-Volatile Memory Arrays
patent-application, November 2007


Compressive sensing systems and related methods
patent, July 2018


Configurable receiver and a method for configuring a receiver
patent, July 2011


Adjusting target values of resistive memory devices
patent, July 2018


Data Replication System
patent-application, February 2013


Coding for Crossbar Architecture
patent-application, December 2012


Transactional Memory That Performs a CAMR 32-Bit Lookup Operation
patent-application, March 2014


Memcapacitive Cross-Bar Array for Determining a Dot Product
patent-application, November 2017


Assigning Redundancy in Encoding Data onto Crossbar Memory Arrays
patent-application, July 2017


Experimental Design and Statistical Modeling Tool for Workload Characterization
patent-application, January 2004