G. G. Malewicz, A. Russell, and A. A. Shvartsman. Distributed Cooperation During the Absence of Communication. In International Symposium on Distributed Computing, pages 119--133, 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
The Do-All Problem with Byzantine Processor Failures - Fernandez, Georgiou (2003) (Correct)
.... one of the fundamental problems in the research on the complexity of fault tolerant distributed computations [11, 19] Variations of this problem have been studied in shared memory models (Write All) 20, 21, 26] in message passing models [9, 11, 13] and in partitionable networks (Omni Do) [10, 17, 24]. Solutions for Do All must perform all tasks efficiently in the presence of specific failure patterns. The efficiency is assessed in terms of work, time, and communication complexity depending on the specific model of computation. In this paper we initiate the study of the Do All problem under ....
.... is no study of the Do All problem under Byzantine processor failures: prior work on Do All has dealt with processor stop failures (e.g. 19, 9, 11, 15, 7] with processor stop failures and restarts (e.g. 20, 5] with communication link crashes and recoveries partitionable networks (e.g. [10, 24, 16]) and with processor delays (e.g. 25, 4, 2, 6, 18] Byzantine processor failures were introduced by Lamport, Pease, and Shostak [23] in the context of the consensus problem (a set of processors must agree on a common value) Assuming that the number of faulty processors f is fixed and known ....
G. Malewicz, A. Russell, and A.A. Shvartsman. Distributed cooperation during the absence of communication. International Symposium on Distributed Computing (DISC 2000.
Distributed Scheduling for Disconnected Cooperation - Malewicz (2003) (1 citation) Self-citation (Malewicz) (Correct)
No context found.
Malewicz, G., Russell, A., Shvartsman, A.A.: Distributed Cooperation During the Absence of Communication. 14th International Conference on Distributed Computing, LNCS Vol. 1914 (2000) 119--133 (Preliminary version: Brief announcement PODC'00)
Optimal Scheduling for Disconnected Cooperation - Malewicz, Russell, Shvartsman (2001) (3 citations) Self-citation (Malewicz Russell Shvartsman) (Correct)
No context found.
G. Malewicz, A. Russell, A.A. Shvartsman. Distributed Cooperation During the Absence of Communication. In Proc. 14th Intl Conference on Distributed Computing, LNCS Vol. 1914.
The Do-All Problem with Byzantine Processor Failures - Fernández.. (2003) Self-citation (Russell Shvartsman) (Correct)
No context found.
G. Malewicz, A. Russell, and A.A. Shvartsman. Distributed cooperation during the absence of communication. International Symposium on Distributed Computing (DISC 2000.
Local Scheduling for Distributed Cooperation - Grzegorz Greg Malewicz Self-citation (Malewicz Russell Shvartsman) (Correct)
No context found.
Malewicz, G., Russell, A., Shvartsman, A.A.: Distributed Cooperation During the Absence of Communication. 14th International Conference on Distributed Computing, LNCS Vol. 1914 (2000) 119-- 133 (Preliminary version: Brief announcement. ACM Symposium on Principles of Distributed Computing. (2000))
Local Scheduling for Distributed Cooperation - Malewicz Self-citation (Malewicz Russell Shvartsman) (Correct)
....by Dolev et al. 5] They showed solutions to this problem when processors start in singleton groups. The waste incurred when communication is first established between any two singletons is controlled as long as processors have executed no more than ) tasks. Subsequently Malewicz et al. [22, 23] began developing a scheduling theory with the goal of offering optimal and efficient solutions for this problem. The emerging theory exhibits links between design theory [12] graph theory [11] linear algebra [16, 20] and our distributed problem. One of the objectives of design theory is the ....
....for any pair of schedules the number of redundant tasks is increased in a controlled fashion. Because design theory deals with sets, it does not teach how to order the elements of any given set so that the number of redundant tasks in prefixes of any two ordered sets is controlled. Malewicz et al. [23] showed how to schedule all tasks, for the case of 5 , such that waste grows gracefully. Their work extends standard . 10 2 length designtheoretic constructions. The longer waste controlling schedules can be constructed in time linear in the length of the schedule. The ....
[Article contains additional citation context not shown here]
Malewicz, G., Russell, A., Shvartsman, A.A.: Distributed Cooperation During the Absence of Communication. 14th International Conference on Distributed Computing, LNCS Vol.
Group Membership and Wide-Area Master-Worker Computations - Jacobsen, Zhang, Marzullo (2003) (2 citations) (Correct)
No context found.
G. G. Malewicz, A. Russell, and A. A. Shvartsman. Distributed Cooperation During the Absence of Communication. In International Symposium on Distributed Computing, pages 119--133, 2000.
Group Membership and Wide-Area Master-Worker Computations - Jacobsen, Zhang, Marzullo (2003) (2 citations) (Correct)
No context found.
G. G. Malewicz, A. Russell, and A. A. Shvartsman. Distributed Cooperation During the Absence of Communication. In International Symposium on Distributed Computing, pages 119--133, 2000.
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