Competitive snoopy caching for large-scale multiprocessors

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

364DIG1, 3642306, 3649315, 3649642, 395500, 395800, G06F 1516

Patent

active

053455789

ABSTRACT:
A system and method of satisfying read and write requests is used in a system having a plurality of cache-equipped processors coupled into a hypercube structure via buses, where each processor is simultaneously coupled to other processors on other buses via gateway means. Read and write requests for a line of data from any of the processors are satisfied by forwarding an update or invalidate request for a given data block containing the line of data requested. This request is forwarded to all other buses on which the block is present. The present invention provides for responding to a read request for a line of data from a processor by forwarding the request, and resultant data, to one of the buses on which the block is stored, where each gateway responds to the request to forward the request along exactly one branch.

REFERENCES:
patent: 4667308 (1987-05-01), Hayes et al.
patent: 4709327 (1987-11-01), Hillis et al.
patent: 4766534 (1988-08-01), Debenedictis
patent: 4805091 (1989-02-01), Thiel et al.
patent: 4811214 (1989-03-01), Nosenchuck et al.
patent: 4814973 (1989-03-01), Hillis
patent: 4814980 (1989-03-01), Peterson et al.
patent: 5170482 (1992-12-01), Shu 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

Competitive snoopy caching for large-scale multiprocessors does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Competitive snoopy caching for large-scale multiprocessors, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Competitive snoopy caching for large-scale multiprocessors will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-1335725

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