Bloom Filter Cache Hit Predictor

The patent applies preliminary action by performing cache hit prediction before the actual cache access occurs. A separate prediction cache stores predicted hit/miss outcomes in advance, allowing the system to prepare for potential cache misses by pre-fetching data from main memory while the prediction is being evaluated, thereby reducing overall access latency without significantly increasing structural complexity

The patent introduces an intermediary prediction cache structure that mediates between the main cache and main memory. This prediction cache acts as a buffer that stores pre-computed prediction results, allowing the system to avoid direct costly accesses to main memory when predictions indicate misses, thus reducing latency while maintaining a relatively simple overall architecture

The patent applies copying by creating a simplified prediction cache that replicates only the essential prediction information needed for hit/miss determination. Instead of using complex prediction algorithms, the system copies and stores prediction outcomes in a separate cache structure, achieving high prediction accuracy with minimal computational resources during actual cache operations

The patent applies partial action by implementing prediction only for specific cache access patterns or scenarios where it provides the most benefit. The prediction mechanism processes only the necessary subset of cache operations, achieving high accuracy for critical predictions while consuming minimal computational resources by avoiding unnecessary prediction overhead for other operations