Cache coherency control method, chipset, and multi-processor...

Electrical computers and digital processing systems: memory – Storage accessing and control – Hierarchical memories

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C711S147000, C711S148000, C711S153000

Reexamination Certificate

active

07613885

ABSTRACT:
In a multi-processor system, counting snoop results bottlenecks the broadcast-based snoop protocol. The directory-based protocol delays the latency when remote node caches data. There is a need for shortening the memory access latency using a snoop and cache copy tag information. When the local node's cache copy tag information is available, the memory access latency can be shortened by omitting a process to count snoop results. When memory position information is used to update the cache copy tag during cache replacement, it is possible to increase a ratio to hit a copy tag during reaccess from the local node.

REFERENCES:
patent: 6901485 (2005-05-01), Arimilli et al.
patent: 2003/0177317 (2003-09-01), Anderson et al.
patent: 10-222423 (1998-08-01), None
“Implementation of Mission Critical Linux on ES 700 ” Unisys Technology Review, Feb. 2005.pp. 56-69.
Origin ccNUMA Servers True Scalability with a Difference, Silicon Graphics Computer Systems, 1999.
“The SGI Origin: AccNUMA Highly Scalable Server” by Laudon, et al., 1998 (with English translation).

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Cache coherency control method, chipset, and multi-processor... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Cache coherency control method, chipset, and multi-processor..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cache coherency control method, chipset, and multi-processor... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4063728

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.