Node synchronization for multi-processor computer systems

Data processing: database and file management or data structures – Database design – Data structure types

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C711S147000, C711S154000, C711S141000, C365S189080

Reexamination Certificate

active

07464115

ABSTRACT:
A method and apparatus for controlling access by a set of accessing nodes to memory of a home node (in a multimode computer system) determines that each node in the set of nodes has accessed the memory, and forwards a completion message to each node in the set of nodes after it is determined that each node has accessed the memory. The completion message has data indicating that each node in the set of nodes has accessed the memory of the home node.

REFERENCES:
patent: 5897657 (1999-04-01), Hagersten et al.
patent: 5958019 (1999-09-01), Hagersten et al.
patent: 6024477 (2000-02-01), Bauer et al.
patent: 6330604 (2001-12-01), Higuchi et al.
patent: 6785888 (2004-08-01), McKenney et al.
patent: 2002/0078305 (2002-06-01), Khare et al.
patent: 2006/0002309 (2006-01-01), Ban
Zhang et al.,Highly Efficient Synchronization Based on Active Memory Operations, Apr. 26, 2004, pp. 1-10.

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

Node synchronization for multi-processor computer 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 Node synchronization for multi-processor computer systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Node synchronization for multi-processor computer systems will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4045967

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