Speculative directory lookup for sharing classification

Details Speculative directory lookup for sharing classification Speculative directory lookup for sharing classification

2008-05-13

2008-05-13

Verbrugge, Kevin (Department: 2189)

Electrical computers and digital processing systems: memory

Storage accessing and control

Hierarchical memories

C711S144000

Reexamination Certificate

active

07373461

ABSTRACT:
In one embodiment, a node for a multi-node computer system comprises a coherence directory configured to store coherence states for coherence units in a local memory of the node and a coherence controller configured to receive a coherence request for a requested coherence unit. The requested coherence unit is included in a memory region that includes at least two coherence units, and the coherence controller is configured to read coherence states corresponding to two or more coherence units from the coherence directory responsive to the coherence request. The two or more coherence units are included in a previously-accessed memory region, and the coherence controller is configured to provide the requested coherence unit with a predicted coherence state responsive to the coherence states in the previously accessed memory region.

REFERENCES:
patent: 5619676 (1997-04-01), Fukuda et al.
patent: 6442597 (2002-08-01), Deshpande et al.
patent: 6467012 (2002-10-01), Alvarez et al.
patent: 6587930 (2003-07-01), Deshpande et al.
patent: 6591348 (2003-07-01), Deshpande et al.
patent: 6629210 (2003-09-01), Arimilli et al.
patent: 6711651 (2004-03-01), Moreno et al.
patent: 6839648 (2005-01-01), Burlison
patent: 6973547 (2005-12-01), Nilsson et al.
patent: 7174430 (2007-02-01), O'Krafka et al.
patent: 2002/0161976 (2002-10-01), Ito et al.
Zeffer, et al., “Adaptive Coherence Batching for Trap-Based Memory Architectures,” May 2005, 11 pages.
Koppelman, “Neighborhood Prefetching on Multiprocessors Using Instruction History,” Proceedings of PACT, 2000, ref. 19, 10 pages.
Koppelman, “Neighborhood Prefetching on Multiprocessors Using Instruction History,” Proceedings of PACT, 2000, ref. 19 longer version, 14 pages.
Mukherjee, et al., “Using Prediction to Accelerate Coherence Protocols,” Proceedings of the 25thAnnual International Symposium on Computer Architecture (ISCA), 1998, 12 pages.
“Memory Sharing Predictor: The Key to a Speculative Coherent DSM”, Lai, et al,Computer Architecture News, Association for Computing Machinery, New York, vol. 27, No. 2, May 1999, pp. 172-183.
“Selective, Accurate, and Timely Self-Invalidation Using Last-Touch Prediction”, Lai, et al,Computer Architecture News, Association for Computing Machinery, New York, vol. 28, No. 2, May 2000, pp. 139-148.
“Alternative Implementations of Two-Level Adaptive Branch Prediction”, Yeh, et al,Annual ACM Workshop on Computational Learning Theory, Aug. 27, 1992, pp. 124-134.
Abdel-Shafi, et al, “An Evaluation of Fine-Grain Producer-Initiated Communication in Cache-Coherent Multiprocessors”, Proceedings of the 3rd IEEE Symposium on High-Performance Computer Architecture (HPCA '97), San Antonio, TX, Feb. 1997.
Cox, et al, “Adaptive Cache Coherency for Detecting Migratory Shared Data”, InProc. of the 20th Annual Int'l Symp. on Computer Architecture(ISCA'93), pp. 98-108, May 1993.
Grahn, et al, “Evaluation of a Competitive-Update Cache Coherence Protocol with Migratory Data Detection”,Journal of Parallel and Distributed Computing, 39(2):168-180, Dec. 1996.
Hill, et al, “Cooperative Shared Memory: Software and Hardware for Scalable Multiprocessors”,IEEE Trans. on Computer Systems, 11(4): 300-318, Nov. 1993.
Kaxiras, “Identification and Optimization of Sharing Patterns for Scalable Shared-Memory Multiprocessors” , PhD Thesis, University of Wisconsin-Madison, 1998.
Kaxiras, et al, “Improving CC-NUMA Performance Using Instruction-Based Prediction” , In Procedures of HPCA-5, pp. 161-170, Jan. 1999.
Kaxiras, et al, “Coherence Communication Prediction in Shared-Memory Multiprocessors”,In Proc. of HPCA-5, pp. 156-157, Jan. 2000.
Koufaty, et al, “Data Forwarding in Scalable Shared-Memory Multiprocessors”,IEEE Trans. on Parallel and Distributed Systems, 7(12): 1250-1264, Dec. 1996.
Laudon, et al, “The SGI Origin: A CCNUMA Highly Scalable Server”,In Proc. of ISCA-24, pp. 241-251, 1997.
Lebeck, et al, “Dynamic Self-Invalidation: Reducing Coherence Overhead in Shared Memory Multiprocessors”,In Proc. of ISCA-22, pp. 48-59, Jun. 1995.
Lenoski, et al, “The Directory-Based Cache Coherence Protocol for the DASH Multiprocessor”,In Proc. of ISCA-17, pp. 148-159, May 1990.
Magnusson, et al, “SimICS/sun4m: A virtual Workstation”,In Proc. of Usenix Annual Technical Conf., Jun. 1998.
Skeppstedt, et al, “Simple Compiler Algorithms to Reduce Ownership Overhead in Cache Coherence Protocols”,In Proc. of ASPLOS-6, pp. 325-337, 1994.
Stenstrom, et al, “An Adaptive Cache Coherence Protocol Optimized for Migratory Sharing”,In Proc. of ISCA-20, pp. 109-118, 1993.
Woo, et al, “The SPASH-2 Programs: Characterization and Methodological Considerations”,In Proc. of ISCA-22, pp. 24-36, Jun. 1995.

Affiliated with

Also associated with

Rating

Speculative directory lookup for sharing classification does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Speculative directory lookup for sharing classification, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Speculative directory lookup for sharing classification will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2795903