Gracefully changing a node in a distributed computing network

Electrical computers and digital processing systems: multicomput – Network computer configuring – Initializing

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C709S217000, C375S259000, C345S473000

Reexamination Certificate

active

07996502

ABSTRACT:
In one embodiment, a method includes determining to change a number of objects controlled by a particular node in a network. Each object is a resource provided by the network and has a unique object position in a coordinate space of N dimensions. Each node has a unique node position in the coordinate space of N dimensions. Each node controls operation of objects in a control set of zero or more objects which are closest to the node using an agreed definition of scalar distance between two positions. A different N+1 dimension from the N dimensions is added. The N+1 dimension has a zero value for the plurality of objects. A particular value is determined for the N+1 dimension for the particular node such that a change in a number of objects in a particular control set of the particular node is not greater than a threshold change.

REFERENCES:
patent: 2002/0073167 (2002-06-01), Powell et al.
patent: 2004/0081248 (2004-04-01), Parolari
patent: 2004/0095352 (2004-05-01), Huang

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

Gracefully changing a node in a distributed computing network does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Gracefully changing a node in a distributed computing network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Gracefully changing a node in a distributed computing network will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2680521

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