Managing cache coherency in a data processing apparatus

Details Managing cache coherency in a data processing apparatus Managing cache coherency in a data processing apparatus

2011-05-03

2011-05-03

Campos, Yaima (Department: 2185)

Electrical computers and digital processing systems: memory

Storage accessing and control

Hierarchical memories

C711S141000, C711S142000, C711S143000, C711S144000, C711S145000

Reexamination Certificate

active

07937535

ABSTRACT:
Each of plural processing units has a cache, and each cache has indication circuitry containing segment filtering data. The indication circuitry responds to an address specified by an access request from an associated processing unit to reference the segment filtering data to indicate whether the data is either definitely not stored or is potentially stored in that segment. Cache coherency circuitry ensures that data accessed by each processing unit is up-to-date and has snoop indication circuitry whose content is derived from the already-provided segment filtering data. For certain access requests, the cache coherency circuitry initiates a coherency operation during which the snoop indication circuitry determines whether any of the caches requires a snoop operation. For each cache that does, the cache coherency circuitry issues a notification to that cache identifying the snoop operation to be performed.

REFERENCES:
patent: 6272520 (2001-08-01), Sharangpani et al.
patent: 6338123 (2002-01-01), Joseph et al.
patent: 6704845 (2004-03-01), Anderson et al.
patent: 6721848 (2004-04-01), Gaither
patent: 6810467 (2004-10-01), Khare et al.
patent: 6874062 (2005-03-01), Goldberg
patent: 6907520 (2005-06-01), Parady
patent: 7093079 (2006-08-01), Quach et al.
patent: 7213106 (2007-05-01), Koster et al.
patent: 7325102 (2008-01-01), Cypher
patent: 7392351 (2008-06-01), Blumrich et al.
patent: 2002/0087765 (2002-07-01), Kumar et al.
patent: 2005/0060457 (2005-03-01), Olukotun
patent: 2007/0186054 (2007-08-01), Kruckemyer et al.
patent: 0 992 912 (2000-04-01), None
patent: 1-201740 (1989-08-01), None
patent: WO 2005/017708 (2005-02-01), None
A. Moshovos et al, “JETTY: Filtering Snoops for Reduced Energy Consumpation in SMP Servers” Proceedings of the 7thInternational Symposium on High-Performance Computer Architecture, (HPCA-7), Jan. 2001.
C. Saldanha et al, “Power Efficient Cache Coherence” Workshop on Memory Performance Issues in Conjunction with ISCA, Jun. 2001.
M. Ekman et al, “Evaluation of Snoop-Energy Reduction Techniques for Chip-Multiprocessors” Workshop on Duplicating, Deconstructing and Debunking, in Conjunction with ISCA, May 2002.
M. Ekman et al, “TLB and Snoop Energy-Reduction using Virtual Caches in Low-Power Chip-Multiprocessors” ISLPED '02, Aug. 2002.
A. Moshovos, “RegionScout: Exploiting Coarse Grain Sharing in Snoop-Based Coherence” Proceedings of the 32ndAnnual International Symposium on Computer Architecture, 2005.
G. Memik et al, “Just Say No: Benefits of Early Cache Miss Determination” Proceedings of the Ninth International Symposium on High-Performance Computer Architecture (HPCA-9'03), 2003.
J. Peir et al, “Bloom Filtering Cache Misses for Accurate Data Speculation and Prefetching” Proceedings of the Sixteenth International Conference of Supercomputing, 2002, pp. 189-198.
N. Mehta et al, “Fetch Halting on Critical Load Misses” Proceedings of the 22ndInternational Conference on Computer Design, 2004.
A. Hasegawa et al, “SH3: High Code Density, Low Power” IEEE Micro, 1995, pp. 11-19.
R.E. Kessler et al, “The Alpha 21264 Microprocessor Architecture” IEEE Micro, 19(2):24-36, Apr. 1999.
G. Reinman et al, “Using a Serial Cache for Energy Efficient Instruction Fetching” Journal of Systems Architecture, 2004, pp. 1-21.
B. Calder et al, “Predictive Sequential Associative Cache” 2ndInternational Symposium on High Performance Computer Architecture, HPCA'96, Feb. 1996.
K. Inoue, et al, “Way-Predicting Set-Associative Cache for High Performance and Low Energy Consumption” ISLPED, 1999.
M. Powell et al, “Reducing Set-Associative Cache Energy via Way-Prediction and Selective Direct-Mapping” Proceedings of the 34thInternational Symposium in Microarchitecture (MICRO), 2001.
B. Batson et al, “Reactive-Associative Caches” Conference on Parallel Architectures and Compilation, PACT'01, 2001.
A. Ma et al, “Way Memoization to Reduce Fetch Energy in Instruction Caches” Workshop on Complexity Effective Design, Jul. 2001, pp. 1-8.
T. Ishihara et al, “A Way Memoization Technique for Reducing Power Consumption of Caches in Application Specific Integrated Processors” Proceedings of the Design, Automation and Test in Europe Conference and Exhibition (Date'05), 2005.
R. Min et al, “Location Cache: A Low-Power L2 Cache System” ISLPED'04, Aug. 2004.
D. Nicolaescu et al, “Reducing Power Consumption for High-Associativity Data Caches in Embedded Processors” Date'03, 2003.
Y. Chang et al, “Sentry Tag: An Efficient Filter Scheme for Low Power Cache” Australian Computer Science Communications, 2002, pp. 135-140.
C. Zhang et al, “A Way-Halting Cache for Low-Energy High-Performance Systems” ISLPED'04, Aug. 2004, pp. 1-6.
Y. Chang et al, “Design and Analysis of Low-Power Cache Using Two-Level Filter Scheme IEEE Transactions on Very Large Scale Integration (VLSI) Systems” vol. 11, No. 4, Aug. 2003, pp. 568-580.
J. Park et al, “Power-Aware Deterministic Block Allocation for Low-Power Way-Selective Cache Structure” IEEE International Conference on Computer Design (ICCD'04), 2004.
D. Albonesi, “Selective Cache Ways: On-Demand Cache Resource Allocation” Journal of Instruction-Level Parallelism 2, May 2000, pp. 1-22.
B. Bloom, “Space/Time Trade-offs in Hash Coding With Allowable Errors” Communications of the ACM, vol. 13, No. 7, Jul. 1970, pp. 422-426.
A. Broder et al, “Network Applications of Bloom Filters: a Survey” 40thAnnual Allerton Conference on Communication, Control, and Computing, 2002, Internet Mathematics vol. 1, No. 4, pp. 485-509.
S. Rhea et al, “Probabilistic Location and Routing” IEEE INFOCOM'02, Jun. 2002, pp. 1-10.
S. Dharmapurikar et al, “Deep Packet Inspection Using Parallel Bloom Filters” IEEE Hot Interconnects 12, Stanford, CA, Aug. 2003, pp. 1-8.
A. Kumar et al, “Space-Code Bloom Filter for Efficient Per-Flow Traffic Measurement” Proc. IEEE INFOCOM, 2004.
F. Chang et al, “Approximate Caches for Packet Classification” IEEE INFOCOM'04, Mar. 2004.
S. Cohen et al, “Spectral Bloom Filters” Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, 2003, pp. 241-252.
S. Sethumadhavan et al, “Scalable Hardware Memory Disambiguation for High ILP Processors” Proceedings of the 36thInternational Symposium on Microarchitecture (MICRO-36 2003), 2003.
A. Roth, “Store Vulnerability Window (SVW): Re-Execution Filtering for Enhanced Load Optimization” Proceedings of 32ndInternational Symposium on Computer Architecture (ISCA-32), Jun. 2005, pp. 1-11.
H. Akkary et al, “Checkpoint Processing and Recovery: Towards Scalable Large Instruction Window Processors” Microprocessor Research Labs, Intel Corporation.
L. Fan et al, “Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol” IEEE/ACM Transactions on Networking, vol. 8, No. 3, Jun. 2000, pp. 281-293.
M. Corliss et al, “Low-Overhead Interactive Debugging via Dynamic Instrumentation with DISE” Proceedings of the 11thInt'l Symposium on High-Performance Computer Architecture (HPCA-11 2005).
P. Zhou et al, “AccMon: Automatically Detecting Memory-related Bugs via Program Counter-based Invariants” Proceedings of the 37thInternational Symposium on Microarchitecture (MICRO-37 2004).
S. Dharmapurikar et al, “Longest Prefix Matching Using Bloom Filters” SIGCOMM'03, Aug. 2003.
U.S. Appl. No. 11/990,394, filed Feb. 13, 2008, Ghosh et al.
U.S. Appl. No. 12/224,725, filed Sep. 4, 2008, Ford et al.
U.S. Appl. No. 12/224,671, filed Sep. 3, 2008, Ford et al.
International Search Report for International Application PCT/GB2005/003531, mailed Aug. 29, 2006.
Written Opinion of the International Searching Authority for PCT/GB

Affiliated with

Also associated with

Rating

Managing cache coherency in a data processing apparatus does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Managing cache coherency in a data processing apparatus, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Managing cache coherency in a data processing apparatus will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2677108