Hash Index Retrieval Using XOR Identity for Cache Memory

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current cache memory systems face inefficiencies in memory management, leading to increased latency, power consumption, and memory size requirements due to the need for separate tag and index memory storage, which complicates address translation and cache hit/miss operations.

Innovation Solution

A hash index retrieval system that hashes the tag portion of an address without hashing the index, using an XOR component to generate and store an XOR identity based on the hashed tag and index, allowing for the recovery of the original index without storing it, thereby reducing memory needs and improving efficiency.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If separate tag and index memory storage is used in cache systems, then cache operations can be performed, but memory size requirements and device complexity increase

Engineering Contradiction:
Improvecache operation reliabilityVSAvoidmemory management complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent combines the tag and index into a single unified memory structure, eliminating the need for separate tag memory and index memory. The address is hashed to directly generate an index into this unified memory, which stores both the tag information and the data. This merging reduces the number of memory components and simplifies the overall memory management architecture while maintaining cache functionality.

Inventive Principle:
Principle #5Merging (Combining)

Solution Approach 2:

The unified memory structure serves multiple functions simultaneously: it acts as both tag memory and data memory, and the hash function serves both as an address translation mechanism and an index generation mechanism. This multi-functionality reduces the overall memory requirements and simplifies the cache architecture by eliminating dedicated tag memory and index registers.

Inventive Principle:
Principle #6Universality (Multi-functionality)

2Reliability

If separate tag and index memory storage is used in cache systems, then cache hit/miss operations can be performed, but latency increases

Engineering Contradiction:
Improvecache hit/miss operation reliabilityVSAvoidcache access latency
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The hash function is applied in advance to the address to pre-compute the index location in the unified memory. This preliminary hashing action allows the system to directly access the correct memory location without requiring separate tag comparison and index generation steps, thereby reducing the time required for cache hit/miss operations.

Inventive Principle:
Principle #10Preliminary action

3Ease of operation

If separate tag and index memory storage is used in cache systems, then address translation can be performed, but power consumption increases

Engineering Contradiction:
Improveaddress translation capabilityVSAvoidpower consumption
Core Design Contradiction:
Ease of operationVSUse of energy by moving object

Solution Approach 1:

By merging tag and index storage into a single unified memory structure, the patent reduces the total number of memory access operations and computational steps required for address translation. This consolidation decreases the power consumption associated with memory management operations while maintaining full address translation capability through the hash function.

Inventive Principle:
Principle #5Merging (Combining)

Data Source

PatentUS9558123B2Retrieval hash index
Publication Date: 2017.01.31 AMPERE COMPUTING LLC
  • US9558123B2 patent drawing
  • US9558123B2 patent drawing
  • US9558123B2 patent drawing

AI summary

Systems and methods are provided that facilitate retrieval of a hash index in an electronic device. The system contains an addressing component that generates a hash index as a function of an exclusive-or identity. The addressing component can retrieve the hash index as a function of a tag value. Accordingly, required storage area can be reduced and electronic devices can be more efficient.