| Roberto De Prisco, Alan Fekete, Nancy A. Lynch, and Alexander A. Shvartsman. A dynamic primary configuration group communication service. In Proceedings of the 13th International Symposium on Distributed Computing, pages 64--78, September 1999. |
....ad hoc wireless networks within a control theory framework remains open. 4.5.2 Group Management and Team Formation Group management and team formation present fundamental new challenges in sensor networks. Most prior membership and group communication services assume reasonably static systems [17, 43, 3]. Group members in such systems do not have a high turn around rate. Hence, strong semantics could be achieved such as virtual synchrony [16] where messages are delivered atomically and in order, and all members have consistent membership views. Such semantics are impossible to achieve in sensor ....
Roberto De Prisco, Alan Fekete, Nancy Lynch, and Alex Shvartsman. "A Dynamic Primary Configuration Group Communication Service." 13th International Symposium on Distributed Computing , Bratislava, Slovak Republic, Sep. 1999.
No context found.
R. De Prisco, A. Fekete, N. Lynch, and A. Shvartsman. A dynamic primary configuration group communication service. 13th International Symposium on DIStributed Computing (DISC), pp. 64--78, 1999.
No context found.
Roberto De Prisco, Alan Fekete, Nancy A. Lynch, and Alexander A. Shvartsman. A dynamic primary configuration group communication service. In Proceedings of the 13th International Symposium on Distributed Computing, pages 64--78, September 1999.
No context found.
R. De Prisco, A. Fekete, N. Lynch, A. Shvartsman, "A Dynamic Primary Configuration Group Communication Service ", to appear in 13th International Conference of Distributed Computing, 1999.
....and writes can make progress during reconfiguration. Also, in some standard GCS implementations, e.g. 5] performance is degraded even if only one stopping failure occurs; our algorithm uses quorums to tolerate small numbers of failures. A dynamic primary configuration GCS was introduced in [7] and used to implement atomic memory, using techniques of [3] within each configuration. That work restricts the set of possible new configurations to those satisfying certain intersection properties with respect to the previous configurations, whereas we impose no such restrictions. Like other ....
....techniques of [3] within each configuration. That work restricts the set of possible new configurations to those satisfying certain intersection properties with respect to the previous configurations, whereas we impose no such restrictions. Like other solutions based on GCSs, the algorithm of [7] delays reads and writes during reconfiguration. Single reconfigurer implementations for atomic memory are considered in [19,10] In these approaches, the failure of the reconfigurer disables future reconfiguration. Also, in [19,10] garbage collection of an old configuration is tightly coupled ....
R. De Prisco, A. Fekete, N. Lynch,A. Shvartsman, "A Dynamic Primary Configuration Group Communication Service", 13th Int-l Conference of Distributed Computing, 1999.
....tuned to systems like Isis and Ensemble. In particular, we would like to understand the power of the Isis requirement that processes that move together from one view to the next receive exactly the same messages in the first view, especially for coherent data applications. In a related work [11] we also have investigated a generalization of the DVS service to dynamic sets of primaries rather than individual primaries, in order to tolerate transient failures during a particular view. Acknowledgments: We thank Ken Birman, who urged us to consider the interesting issues of dynamic views. ....
R. De Prisco, A. Fekete, N. Lynch, A. Shvartsman, "A dynamic primary configuration group com- munication service", in Proceedings of the 13 tn International Symposium of Distributed Computing (DISC 99), Bratislava, Slovak.
....objects in message passing systems. Such algorithms assume a static processor universe and rely on static quorum systems. In long lived systems where processors may dynamically join and leave the system, it is important to reconfigure a quorum system to adapt it to the new set of processors [8, 4, 7, 17]. Prior approaches required that the new quorum system include processors from the old quorum system. This is stated as a static constraint on the quorum system that needs to be satisfied during or even before the reconfiguration. In our work on reconfigurable atomic memory [15, 5, 12] we replace ....
Roberto De Prisco, Alan Fekete, Nancy A. Lynch, and Alexander A. Shvartsman. A dynamic primary configuration group communication service. In Proceedings of the 13th International Symposium on Distributed Computing, pages 64--78, September 1999.
No context found.
Roberto De Prisco, Alan Fekete, Nancy A. Lynch, and Alexander A. Shvartsman. A dynamic primary configuration group communication service. In Proceedings of the 13th International Symposium on Distributed Computing, pages 64--78, September 1999.
No context found.
Roberto De Prisco, Alan Fekete, Nancy A. Lynch, and Alexander A. Shvartsman. A dynamic primary configuration group communication service. In Proc. of the 13th Intntl. Symposium on Distributed Computing, pages 64--78, September 1999.
No context found.
R. De Prisco, A. Fekete, N. Lynch, and A.A. Shvartsman, "A Dynamic Primary Configuration Group Communication Service," Proc. of the 13th International Conference on Distributed Computing (DISC), 1999.
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