Cache coherency protocol with efficient write-through aliasing

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

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

711138, 711142, 711144, 711145, 711146, G06F 1208

Patent

active

060214686

ABSTRACT:
A method of maintaining cache coherency in a multi-processor computer system, which avoids unnecessary writing of values to lower level caches in response to write-through store operations. When a write-through store operation is executed by a processing unit, the modified value is stored in its first level (L1) cache, without storing the value in a second level (L2) cache (or other lower level caches), and a new coherency state is assigned to the lower level cache to indicate that the value is held in a shared state in the first level cache but is undefined in the lower level cache. When the value is written to system memory from a store queue, the lower level cache switches to the new coherency state upon snooping the broadcast from the store queue. This approach has the added benefit of avoiding the prior art read-modify-write process that is used to update the lower level cache.

REFERENCES:
patent: 5671391 (1997-09-01), Knotts
patent: 5787478 (1998-07-01), Hicks et al.

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 protocol with efficient write-through aliasing 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 protocol with efficient write-through aliasing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cache coherency protocol with efficient write-through aliasing will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-946080

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