Distributed cooperation during the absence of communication

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1914, Issue , 2000, Pages 119-133

  Malewicz, Grzegorz Greg ^a   Russell, Alexander ^a   Shvartsman, Alex A ^a,b  

^a University of Connecticut   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS;

DESIGN THEORY; DISTRIBUTED COOPERATION; EFFICIENT CONSTRUCTION; HIGH PROBABILITY; LOWER BOUNDS; RANDOM SCHEDULING; TWO PROCESSORS; UPPER BOUND;

COMPUTATION THEORY;

EID: 23044522331     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-40026-5_8     Document Type: Conference Paper

References (18)

1. Alon, N., Spencer, J. H.: The probabilistic method. John Wiley & Sons Inc., New York (1992). With an appendix by Paul Erdos, A Wiley-Interscience Publication
2. Aumann, Y., Rabin, M.O.: Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation. Foundations of Comp. Sc. (1993) 147-156
3. Chlebus, B.S., De Prisco, R., Shvartsman, A.A.: Performing Tasks on Restartable Message-Passing Processors. Inti Workshop on Distributed Algorithms. Lecture Notes in Computer Science, Vol. 1320. (1997) 96-110
4. Colbourn, C. J., van Oorschot, P. C.: Applications of Combinatorial Designs in Computer Science. ACM Computing Surveys, Vol. 21. 2 (1989)
5. De Prisco, R., Mayer, A., Yung, M.: Time-Optimal Message-Efficient Work Performance in the Presence of Faults. ACM Symposium on Principles of Distributed Computing. (1994) 161-172
6. Dolev, S., Segala, R., Shvartsman, A.A.: Dynamic Load Balancing with Group Communication. Inti Colloquium on Structural Information and Communication Complexity. (1999) 111-125
7. Dwork, C., Halpern, J., Waarts, O.: Performing Work Efficiently in the Presence of Faults. SIAM J. on Computing, Vol. 27 5. (1998) 1457-1491
8. Georgiades, S., Mavronicolas, M., Spirakis, P.: Optimal, Distributed Decision¬Making: The Case of No Communication. Inti Symposium on Fundamentals of Computation Theory. (1999) 293-303
9. Georgiou, Ch., Shvartsman A: Cooperative Computing with Fragmentable and Mergeable Groups. International Colloquium on Structure of Information and Communication Complexity. (2000) 141-156
10. Hughes, D.R., Piper, F.C.: Design Theory. Cambridge University Press (1985)
11. Ireland, K., Rosen, M.: A Classical Introdiction to Modern Number Theory. 2nd edn. Springer-Verlag (1990)
12. Kanellakis, P.C., Shvartsman, A.A.: Fault-Tolerant Parallel Computation. Kluwer Academic Publishers (1997)
13. Kedem, Z.M., Palem, K.V., Rabin, M.O., Raghunathan, A.: Efficient Program Transformations for Resilient Parallel Computation via Randomization. ACM Symp. on Theory of Comp. (1992) 306-318
14. Knuth, D.E.: The Art of Computer Programming. 2nd edn. Addison-Wesley Publishing Company, Vol. 2. (1981)
15. Malewicz, G., Russell, A., Shvartsman, A.A.: Distributed Cooperation in the Absence of Communication. Technical Report MIT-LCS-TR-804 available at http://theory.lcs.mit.edu/~alex/mrsTR.ps. (Also: Brief announcement. ACM Sym¬posium on Principles of Distributed Computing. (2000))
16. Martel, C., Park, A., Subramonian, R.: Work-optimal asynchronous algorithms for shared memory parallel computer. SIAM J. on Computing, Vol. 21 6 (1992) 1070-1099
17. Miller, G.L.: Riemann’s Hypothesis and Tests for Primality. Journal of Computer and Systems Sciences, Vol. 13 (1976) 300-317
18. Papadimitriou, C.H., Yannakakis, M.: On the value of information in distributed decision-making. ACM Symp. on Principles of Dist. Computing. (1991) 61-64