Coherent copyback protocol for multi-level cache memory systems

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

395473, G06F 1212

Patent

active

056713916

ABSTRACT:
A coherent copyback protocol for a multi-level cache memory system prevents more than one modification from existing in multiple locations and saves access time and data bandwidth. The protocol includes the Latest state. A line in the Latest state has the latest copy of modified data. Additionally, all corresponding lines in any higher cache(s) are marked as invalid and all corresponding lines in any lower level cache(s) are marked as modified.

REFERENCES:
patent: 4445174 (1984-04-01), Fletcher
patent: 4928225 (1990-05-01), McCarthy et al.
patent: 4977498 (1990-12-01), Rastegar et al.
patent: 5008813 (1991-04-01), Crane et al.
patent: 5029070 (1991-07-01), McCarthy et al.
patent: 5056002 (1991-10-01), Watanabe
patent: 5058006 (1991-10-01), Durdan et al.
patent: 5060144 (1991-10-01), Sipple et al.
patent: 5214765 (1993-05-01), Jensen
patent: 5285323 (1994-02-01), Hetherington
patent: 5287484 (1994-02-01), Nishii et al.
patent: 5297269 (1994-03-01), Donaldson et al.
patent: 5317716 (1994-05-01), Liu
patent: 5355467 (1994-10-01), MacWilliams et al.
"82495DX/82490DX Architectural Overview", Intel, Date Unknown, pp. 18-22.

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

Coherent copyback protocol for multi-level cache memory systems does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Coherent copyback protocol for multi-level cache memory systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Coherent copyback protocol for multi-level cache memory systems will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-1942051

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