F. Pittelli, H. Garcia-Molina, "Recovery in a Triple Modular Redundant Database System," Technical Report CS-076-87, Princeton University, January, 1987.  Home/Search   Document Not in Database   Summary   Related Articles

....algorithms do not in fact provide optimal termination times [SDC] Our termination times hold for each execution uniformly and are not simply worst case. Recent work has shown that it is often possible to terminate earlier than the worst case time using acknowledgement in addition to diffusion [PG, GSTC]. Thus our algorithms neither achieve the best worst case time nor the best expected or average time. However, they still remain competitive from the point of view of simplicity. Work on very closely related problems suggests that the time complexity attributed to algorithms operating in our model ....

.... for atomic broadcast designed for system models more realistic than those assumed in the Byzantine agreement literature [F] LSP] SD] Since then, several other protocols for atomic broadcast in system models similar to ours have been proposed (e.g. BJ] BSD] Ca] CM] D] GSTC] [PG], SDC] All protocols proposed so far can be divided into two classes: time oriented protocols providing bounded termination times even when failures occur during broadcast, and acknowledgement based protocols that do not provide bounded termination times if failures occur during a broadcast. ....

[Article contains additional citation context not shown here]

F. Pittelli, H. Garcia-Molina, "Recovery in a Triple Modular Redundant Database System," Technical Report CS-076-87, Princeton University, January, 1987.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC