Cooperative memory hierarchy

Details Cooperative memory hierarchy Cooperative memory hierarchy

G - Physics

06

F

354/246, 354/230

G06F 12/08 (2006.01)

Patent

CA 1238984

A COOPERATIVE MEMORY HIERARCHY ABSTRACT A prefetching mechanism for a memory hierarchy which includes at least two levels of storage, with L1 being a high-speed low-capacity memory, and L2 being a low-speed high-capacity memory, with the units of L2 and L1 being blocks and sub-blocks respectively, with each block containing several sub-blocks in consecutive addresses. Each sub-block is provided an additional bit, called a r-bit, which indicates that the sub-block has been previously stored in L1 when the bit is 1, and has not been previously stored in L1 when the bit is 0. Initially when a block is loaded into L2 each of the r-bits in the sub-block are set to 0. When a sub-block is transferred from L1 to L2, its r-bit is then set to 1 in the L2 block, to indicate its previous storage in L1. When the CPU references a given sub-block which is not present in L1, and has to be fetched from L2 to L1, the remaining sub-blocks in this block having r-bits set to 1 are prefetched to L1. This prefetching of the other sub-blocks having r-bits set to 1 results in a more efficient utilization of the L1 storage capacity and results in a higher hit ratio.

494698

Affiliated with

Also associated with

Rating

Cooperative memory hierarchy does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Cooperative memory hierarchy, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cooperative memory hierarchy will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFCA-PAI-O-1231878