Explicit combinatorial structures for cooperative distributed algorithms

Proceedings - International Conference on Distributed Computing Systems

Volumn , Issue , 2005, Pages 49-58

  Kowalski, Dariusz ^a   Musiał, Peter M ^b   Shvartsman, Alexander A ^b,c  

^a UNIVERSITY OF WARSAW   (Poland)

^b University of Connecticut   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COST EFFECTIVENESS; POLYNOMIALS; PROBLEM SOLVING; PROGRAM PROCESSORS; COMBINATORIAL MATHEMATICS; COMPUTER SUPPORTED COOPERATIVE WORK; POLYNOMIAL APPROXIMATION;

DISTRIBUTED ALGORITHMS; MESSAGE-PASSING SETTINGS; PERMUTATIONS;

DISTRIBUTED COMPUTER SYSTEMS;

DETERMINISTIC ALGORITHMS; PARTICIPATING PROCESSORS; PERMUTATIONS; SHARED-MEMORY;

EID: 27944457321     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. R. Anderson and H. Woll. Algorithms for the certified write-all problem. SIAM J. on Computing, 26(5):1277-1283, 1997.
2. J. Buss, P. Kanellakis, P. Ragde, and A. Shvartsman. Parallel algorithms with processor failures and delays. J. of Algorithms, 20:45-86, 1996.
3. B. Chlebus, S. Dobrev, D. Kowalski, G. Malewicz, A. Shvartsman, and I. Vrto. Towards practical deterministic Write-All algorithms. In Proc. of 13th ACM Symp. on Par. Alg. and Arch. (SPAA), pages 271-280, 2001.
4. B. Chlebus and D. Kowalski. Gossiping to reach consensus. In Proc. of 14th Symp. on Parallel Algorithms and Architectures (SPAA), pages 220-229, 2002.
5. R. De Prisco, A. Mayer, and M. Yung. Time-optimal message-efficient work performance in the presence of faults. In Proc. of 13th ACM Symp. on Principles of Distributed Comp. (PODC), pages 161-172, 1994.
6. C. Dwork, J. Halpern, and O. Waarts. Performing work efficiently in the presence of faults. SIAM J. on Computing, 27:457-1491, 1998.
7. Z. Galil, A. Mayer, and M. Yung. Resolving message complexity of byzantine agreement and beyond. In Proc. of 36th IEEE Symp. on Foundations of Computer Science (FOCS), pages 724-733, 1995.
8. C. Georgiou, D. Kowalski, and A. Shvartsman. Efficient gossip and robust distributed computation. In Proc. of 17th International Symp. on Distributed Computing (DISC), pages 224-238, 2003.
9. Z. Kedem, K. Palem, and P. Spirakis. Efficient robust parallel computations. In Proc. of 22nd ACM Symp. on Theory of Computing (STOC), pages 138-148, 1990.
10. D. Knuth. The art of computer programming, volume 3. Addison-Wesley Pub Co., third edition, 1998.
11. D. Kowalski and A. Shvartsman. Performing work with asynchronous processors: Message-delay-sensitive bounds. In Proc. of 22nd ACM Symp. on Principles of Distributed Computing (PODC), pages 265-274, 2003.
12. G. Malewicz. A method for creating near-optimal intances of a certified write-all algorithm. In Proc. of 11th Annual European Symp. on Algorithms (ESA), pages 422-433, 2003.
13. J. Naor and R. Roth. Constructions of permutation arrays for certain scheduling cost measures. Random Structures and Algorithms, (1):39-50, 1995.
14. M. Pinsker. On the complexity of a concentrator. In Proc. of 7th Annual Teletraffic Conference, pages 318/1-318/4, 1973.
15. N. Pippenger. Sorting and selecting in rounds. SIAM J. on Computing, 16:1032-1038, 1987.
16. A. Ta-Shma, C. Umans, and D. Zuckerman. Loss-less condensers, unbalanced expanders, and extractors. In Proc. of 33rd Annual ACM Symp. on Theory of Computing (STOC), pages 143-152, 2001.