Providing figure of merit vote from application executing on...

Electrical computers and digital processing systems: interprogra – Interprogram communication using message

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C709S220000, C709S223000

Reexamination Certificate

active

07076783

ABSTRACT:
A quorumless network cluster provides a highly available system by addressing the partition-in-space and partition-in-time problems in network clusters.In a particular solution, a cluster manager (CM) can use disk based messaging to manage the operation of the cluster. Each node within the cluster must have access to a shared disk to operate within the cluster.A particular methodology can operate the cluster in a closed loop between nodes1to N. If a node fails to receive a heartbeat message from its predecessor in the loop, it initiates a cluster reconfiguration by sending a reconfiguration message to each other node in the cluster.The quorumless cluster can also include a common storage for a cluster definition. Each node may provide a proposed change to the cluster definition, however only a single coordinator node may update the cluster definition and apply the suggested changes.

REFERENCES:
patent: 5315657 (1994-05-01), Abadi et al.
patent: 5325526 (1994-06-01), Cameron
patent: 5371852 (1994-12-01), Attanasio et al.
patent: 5559794 (1996-09-01), Willis et al.
patent: 5633999 (1997-05-01), Clowes et al.
patent: 5666486 (1997-09-01), Alfieri et al.
patent: 5737311 (1998-04-01), Wyld
patent: 5822531 (1998-10-01), Gorczyca et al.
patent: 5828876 (1998-10-01), Fish et al.
patent: 5915095 (1999-06-01), Miskowiec
patent: 5959972 (1999-09-01), Hamami
patent: 5964838 (1999-10-01), Cheung et al.
patent: 5964886 (1999-10-01), Slaughter et al.
patent: 5986783 (1999-11-01), Sharma et al.
patent: 5996075 (1999-11-01), Matena
patent: 5999712 (1999-12-01), Moiin
patent: 6002851 (1999-12-01), Basavaiah et al.
patent: 6003075 (1999-12-01), Arendt et al.
patent: 6014669 (2000-01-01), Slaughter et al.
patent: 6028862 (2000-02-01), Russell et al.
patent: 6046833 (2000-04-01), Sharma et al.
patent: 6073218 (2000-06-01), DeKoning et al.
patent: 6092213 (2000-07-01), Lennie et al.
patent: 6108699 (2000-08-01), Moiin
patent: 6130876 (2000-10-01), Chaudhuri
patent: 6151688 (2000-11-01), Wipfel et al.
patent: 6173420 (2001-01-01), Sunkara et al.
patent: 6192401 (2001-02-01), Modiri
patent: 6192483 (2001-02-01), Moiin et al.
patent: 6198721 (2001-03-01), Mueller
patent: 6243702 (2001-06-01), Bamford et al.
patent: 6243744 (2001-06-01), Snaman et al.
patent: 6272544 (2001-08-01), Mullen
patent: 6279032 (2001-08-01), Short et al.
patent: 6308273 (2001-10-01), Goertzel et al.
patent: 6311217 (2001-10-01), Ehlinger et al.
patent: 6327252 (2001-12-01), Silton et al.
patent: 6341308 (2002-01-01), Yamaguchi et al.
patent: 6353898 (2002-03-01), Wipfel et al.
patent: 6360331 (2002-03-01), Vert et al.
patent: 6363495 (2002-03-01), MacKenzie et al.
patent: 6393485 (2002-05-01), Chao et al.
patent: 6401120 (2002-06-01), Gamache et al.
patent: 6427163 (2002-07-01), Arendt et al.
patent: 6438705 (2002-08-01), Chao et al.
patent: 6446219 (2002-09-01), Slaughter et al.
patent: 6453426 (2002-09-01), Gamache et al.
patent: 6467050 (2002-10-01), Keung
patent: 6587860 (2003-07-01), Chandra et al.
patent: 2003/0191983 (2003-10-01), Mann 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

Providing figure of merit vote from application executing on... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Providing figure of merit vote from application executing on..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Providing figure of merit vote from application executing on... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3572807

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