2 citations found. Retrieving documents...
A. M. Ricciardi, K. P. Birman, and P. Stephenson. The Cost of Order in Asynchronous Systems. In Intl. Workshop on Distributed Algorithms proceedings (WDAG-6), (LCNS, 647), number 6th, pages 329--345, November 1992. This article was processed using the L a T E X macro package with LLNCS style

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
On Distributed Algorithms in a Broadcast Domain - Dolev, Malki (1993)   (1 citation)  (Correct)

....that reliable broadcast protocols are more complex than their point to point counterparts. The membership problem is to maintain the set of participating machines in agreement among all the machines. This basic problem of distributed computing has received considerable attention in the past (see [9, 1, 19, 20, 23, 24, 16, 3, 4]) We are mainly interested in membership protocols for broadcast communication environments. In these environments, the membership changes are reported via special messages, that are delivered to the upper level application among the stream of regular messages. In distributed applications, the ....

A. M. Ricciardi, K. P. Birman, and P. Stephenson. The Cost of Order in Asynchronous Systems. In Intl. Workshop on Distributed Algorithms proceedings (WDAG-6), (LCNS, 647), number 6th, pages 329--345, November 1992. This article was processed using the L a T E X macro package with LLNCS style


Virtually-Synchronous Communication Based on a Weak Failure.. - Schiper, Ricciardi (1993)   (71 citations)  Self-citation (Ricciardi)   (Correct)

....consistently around process failures and recoveries is a fundamental part of any distributed computation; thus VSC is a vital primitive for inherently distributed programming. Relatedly, manycommon distributed applications are more easily understood and solved if they can make use of VSC [19]. Finally, if the VSC abstraction we define in this paper is augmented with a majority requirement, 21] shows it is a powerful model in which transaction commit is easily (albeit probabilistically) implemented. Understanding that the VSC abstraction is more basic than the transaction abstraction ....

A. M. Ricciardi, K. P. Birman, and P. Stephenson. The Cost of Order in Asynchronous Systems. In A. Segall and S. Zaks, editors, Proceedings of the Sixth WDAG; Israel, pages 341--352. Springer-Verlag, 1992. LNCS 647.

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