QuicksearchDisclaimerThe individual owning this blog works for Oracle in Germany. The opinions expressed here are his own, are not necessarily reviewed in advance by anyone but the individual author, and neither Oracle nor any other party necessarily agrees with them.
|
Poor mans Fault ToleranceMonday, August 25. 2008Trackbacks
Trackback specific URI for this entry
No Trackbacks
Comments
Display comments as
(Linear | Threaded)
Your comparator is still a SPoF. If you allow for three computes and run comparators in each of them comparing the results of the neighboring LDOMs, you could go with "quorum". If two of the comparators agree (using the computes generated on the other nodes), you have a winner.
So: CompA = f(b) f(c) CompB = f(a) f(c) CompC = f(a) f(b) The comparators can then compare results with each other. 3/3 is a win, 2/3 is a failure (you have used the "bogus" result in 2 of the generations with a warning to your logging, 1/3 is a winner with a warning. Of course, 0/3 means that you not only blew the compute, but also the comparator, so you are toasty (more work needed on this line of thought as well) bill. |
+1The LKSF bookThe book with the consolidated Less known Solaris Tutorials is available for download here
Web 2.0Contact
Networking xing.com My photos Buttons![]() This work is licensed under a Creative Commons Attribution-Noncommercial-Share Alike 3.0 Germany License
![]() ![]() ![]() Blog AdministrationDonateOkay, okay ... as several people have asked for it ... but you know my opinion.
|