skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Processor-in-memory-and-storage architecture

Abstract

A method and apparatus for performing reliable general-purpose computing. Each sub-core of a plurality of sub-cores of a processor core processes a same instruction at a same time. A code analyzer receives a plurality of residues that represents a code word corresponding to the same instruction and an indication of whether the code word is a memory address code or a data code from the plurality of sub-cores. The code analyzer determines whether the plurality of residues are consistent or inconsistent. The code analyzer and the plurality of sub-cores perform a set of operations based on whether the code word is a memory address code or a data code and a determination of whether the plurality of residues are consistent or inconsistent.

Inventors:
Publication Date:
Research Org.:
Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
Sponsoring Org.:
USDOE
OSTI Identifier:
1415442
Patent Number(s):
9,858,144
Application Number:
14/831,711
Assignee:
National Technology & Engineering Solutions of Sandia, LLC (Albuquerque, NM) SNL-A
DOE Contract Number:
AC04-94AL85000
Resource Type:
Patent
Resource Relation:
Patent File Date: 2015 Aug 20
Country of Publication:
United States
Language:
English
Subject:
97 MATHEMATICS AND COMPUTING

Citation Formats

DeBenedictis, Erik. Processor-in-memory-and-storage architecture. United States: N. p., 2018. Web.
DeBenedictis, Erik. Processor-in-memory-and-storage architecture. United States.
DeBenedictis, Erik. 2018. "Processor-in-memory-and-storage architecture". United States. doi:. https://www.osti.gov/servlets/purl/1415442.
@article{osti_1415442,
title = {Processor-in-memory-and-storage architecture},
author = {DeBenedictis, Erik},
abstractNote = {A method and apparatus for performing reliable general-purpose computing. Each sub-core of a plurality of sub-cores of a processor core processes a same instruction at a same time. A code analyzer receives a plurality of residues that represents a code word corresponding to the same instruction and an indication of whether the code word is a memory address code or a data code from the plurality of sub-cores. The code analyzer determines whether the plurality of residues are consistent or inconsistent. The code analyzer and the plurality of sub-cores perform a set of operations based on whether the code word is a memory address code or a data code and a determination of whether the plurality of residues are consistent or inconsistent.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = 2018,
month = 1
}

Patent:

Save / Share:
  • Abstract not provided.
  • This patent describes a digital data processing system. The system comprising of plurality of processing elements divided into a plurality of processing element groups. All of the processing elements in a processing element group being connected to a group bus interface over a group bus. The group bus interfaces being interconnected by a system bus.
  • In this thesis the author studies the interconnection networks and their switch architectures, the performance of different architectures, under the MIMD shared memory environment, using both simulation and analytical methods. The networks he studies are constructed with a basic building block, a switch element. Quite a few alternatives are proposed in designing the switch element. Naturally, different switch architectures given different performance. He studies the performance of different switches with both analytical methods and extensive simulations. He also proposes a multiple hand shaking signal switch architecture which gives the maximum performance. Various interconnection networks and interested issues related to themmore » are reviewed in the thesis. He proposes a new class of interconnection networks called F networks. In comparison to traditional multi-stage network, F networks provide faster communications among nodes within a cluster. Also extra routes available in the F network fault-tolerant. Based on simulations and analysis, Kruskal, Snir and Weiss established a formula for calculating network delays under moderate traffic. From his simulations the author surprisedly discovered that the Kruskal-Snir-Weiss formula holds only of the forward path delay of the networks, the return path delay is actually substantially less than the delay of the forward path. He completes the network performance formula by extending the Kruskal-Snir-Weiss formula to include the return path. He also analyzes the network performance under hot spot' traffic and obtains analytic results on the performance attained.« less
  • An apparatus for generating raster graphics images from the graphics command stream includes a plurality of graphics processors connected in parallel, each adapted to receive any part of the graphics command stream for processing the command stream part into pixel data. The apparatus also includes a frame buffer for mapping the pixel data to pixel locations and an interconnection network for interconnecting the graphics processors to the frame buffer. Through the interconnection network, each graphics processor may access any part of the frame buffer concurrently with another graphics processor accessing any other part of the frame buffer. The plurality ofmore » graphics processors can thereby transmit concurrently pixel data to pixel locations in the frame buffer.« less
  • A modular switching system is described for connecting a plurality of digital computers to a plurality of computer memories, the system comprising: a plurality of switching modules; groups of switching modules conductively coupled to each give digital computer of the plurality of digital computers for data transmission, each switching module of each group conductively coupled to a different one of the computer memories for data transmission; each switching module including means for forming a path for data storage and retrieval between its respective digital computer and a given one of the computer memories; and the switching modules operable in combinationmore » to arbitrate simultaneous attempts by two or more of the digital computers to access one of the computer memories.« less