Non-uniform memory access (numa) data processing system...

G - Physics – 06 – F

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

G06F 15/173 (2006.01) G06F 12/08 (2006.01)

Patent

CA 2295403

A non-uniform memory access (NUMA) computer system includes first and second processing nodes that are each coupled to a node interconnect. The first processing node includes a system memory and first and second processors that each have a respective one of first and second cache hierarchies, which are coupled for communication by a local interconnect. The second processing node includes at least a system memory and a third processor having a third cache hierarchy. The first cache hierarchy and the third cache hierarchy are permitted to concurrently store an unmodified copy of a particular cache line in a Recent coherency state from which the copy of the particular cache line can be sourced by shared intervention. In response to a request for the particular cache line by the second cache hierarchy, the first cache hierarchy sources a copy of the particular cache line to the second cache hierarchy by shared intervention utilizing communication on only the local interconnect and without communication on the node interconnect.

LandOfFree

Say what you really think

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

Rating

Non-uniform memory access (numa) data processing system... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Non-uniform memory access (numa) data processing system..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Non-uniform memory access (numa) data processing system... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFCA-PAI-O-1512880

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