A theory of competitive analysis for distributed algorithms

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 1994, Pages 401-411

  Ajtai, Miklos ^a   Aspnes, James ^b   Dwork, Cynthia ^a   Waarts, Orli ^c  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b YALE UNIVERSITY   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION MANAGEMENT; PARALLEL ALGORITHMS;

COMPETITIVE ANALYSIS; GLOBAL CONTROL; JOBS SCHEDULING; ON-LINE ALGORITHMS; PERFORMANCE;

SCHEDULING;

EID: 85035329077     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.1994.365676     Document Type: Conference Paper

References (52)

1. K. Abrahamson. On achieving consensus using a shared memory. In Proc. 7th ACM Symposium on Principles of Distributed Computing, pp. 291-302, August 1988.
2. Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt, and N. Shavit. Atomic Snapshots of Shared Memory. Proc. 9th A CM Symposium on Principles of Distributed Computing, pp. 1-13, 1990.
3. N. Alon. Generating pseudo-random permutations and maximum-flow algorithms. In Infor. Proc. Letters 35, 201-204, 1990.
4. N. Alon, G. Kalai, M. Ricklin, and L. Stockmeyer. Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling. In Proc. 33rd IEEE Symposium on Foundations of Computer Science, pages 334-343, October 1992.
5. J. Anderson. Composite Registers. Proc. 9th ACM Symposium on Principles of Distributed Computing, pp. 15-30, August 1990.
6. R. Anderson and H. Woll. Wait-free Parallel Algorithms for the Union-Find Problem. In Proc. 23rd ACM Symposium on Theory of Computing, pp. 370-380, 1991.
7. J. Aspnes. Time- and space-efficient randomized consensus. Journal of Algorithms 14(3):414-431, May 1993. An earlier version appeared in Proc. 9th ACM Symposium on Principles of Distributed Computing, pp. 325-331, August 1990.
8. J. Aspnes and M. Herlihy. Fast randomized consensus using shared memory. In Journal of Algorithms 11(3), pp.441-461, September 1990.
9. J. Aspnes and M. P. Herlihy. Wait-Free Data Structures in the Asynchronous PRAM Model. In Proceedings of the 2nd Annual Symposium on Parallel Algorithms and Architectures, July 1990, pp. 340-349, Crete, Greece.
10. 2 n) operations per processor. In Proc. 33rd IEEE Symposium on Foundations of Computer Science, pp. 137-146, October 1992.
11. H. Attiya, M. Herlihy, and O. Rachman. Efficient atomic snapshots using lattice agreement. Technical report, Technion, Haifa, Israel, 1992. A preliminary version appeared in proceedings of the 6th International Workshop on Distributed Algorithms, Haifa, Israel, November 1992, (A. Segall and S. Zaks, eds.), Lecture Notes in Computer Science #647, Springer-Verlag, pp. 35-53.
12. H. Attiya, A. Herzberg, and S. Rajsbaum. Optimal Clock Synchronization under Different Delay Assumptions. In Proc. 12th ACM Symposium on Principles of Distributed Computing, pp. 109-120, Aug. 1993.
13. H. Attiya and O. Rachman. Atomic Snapshots in O(nlogn) Operations. In Proc. 12th ACM Symposium on Principles of Distributed Computing, pp. 29-40, Aug. 1993.
14. B. Awerbuch, Y. Bartal, and A. Fiat. Competitive distributed file allocation. In Proc. 25th ACM Symposium on Theory of Computing, pp. 164-173, May 1993.
15. B. Awerbuch, S. Kutten, and D. Peleg. Competitive distributed job scheduling. In Proc. 24th ACM Symposium on Theory of Computing, pp. 571-580, May 1992.
16. B. Awerbuch and D. Peleg. Sparse Partitions. In Proc. 31st IEEE Symposium on Foundations of Computer Science, pp. 503-513, November 1990.
17. Y. Bartal, A. Fiat, and Y. Rabani. Competitive algorithms for distributed data management. In Proc. 24th ACM Symposium on Theory of Computing, pp. 39-50, 1992.
18. Y. Bartal, and A. Rosen. The distributed fc-server problem - A competitive distributed translator for ifcserver algorithms. In Proc. 33rd IEEE Symposium on Foundations of Computer Science, pp. 344-353, October 1992.
19. 2 log n) operations. Proceedings of the Fifth International Workshop on Distributed Algorithms. Springer-Verlag, 1991.
20. M. F. Bridgeland and R. J. Watro. Fault-Tolerant Decision Making in Totally Asynchronous Distributed Systems. In Proc. 6th ACM Symposium on Principles of Distributed Computing, pp. 52-63, 1987.
21. J. Buss and P. Ragde. Certified Write-All on a Strongly Asynchronous PRAM. Manuscript, 1990.
22. T. Chandra and C. Dwork. Using Consensus to solve Atomic Snapshots. Submitted for Publication
23. B. Chor, A. Israeli, and M. Li. On processor coordination using asynchronous hardware. In Proc. 6th ACM Symposium on Principles of Distributed Computing, pp. 86-97, 1987.
24. D. Dolev and N. Shavit. Bounded Concurrent Time-Stamp Systems are Constructible! In Proc. 21st ACM Symposium on Theory of Computing, pp. 454-465, 1989. An extended version appears in IBM Research Report RJ 6785, March 1990.
25. D. Dolev, R. Reischuk, and H.R. Strong. Early Stopping in Byzantine Agreement. J ACM 34:7, Oct. 1990, pp. 720-741. First appeared in: Eventual is Earlier than Immediate, IBM RJ 3915, 1983.
26. C. Dwork, M. Herlihy, S. Plotkin, and O. Waarts. Time-lapse snapshots. Proceedings of Israel Symposium on the Theory of Computing and Systems, 1992.
27. C. Dwork, J. Halpern, and O. Waarts. Accomplishing Work in the Presence of Failures. In Proc. 11th ACM Symposium on Principles of Distributed Computing, pp. 91-102, 1992.
28. C. Dwork, M. Herlihy, and O. Waarts. Bounded Round Numbers. In Proc. 12th ACM Symposium on Principles of Distributed Computing, pp. 53-64, 1993.
29. C. Dwork and Y. Moses. Knowledge and Common Knowledge in a Byzantine Environment: Crash Failures. In Information and Computation 88(2) (1990), originally in Proc. TARK 1986.
30. C. Dwork and O. Waarts. Simple and Efficient Bounded Concurrent Timestamping or Bounded Concurrent Timestamp Systems are Comprehensible!, In Proc. 24th ACM Symposium on Theory of Computing, pp. 655-666, 1992.
31. M. Fischer and A. Michael, Sacrificing Serializability to Attain High Availablity of Data in an Unreliable Network. Research Report 221, Yale U., Feb. 1982.
32. R. Gawlick, N. Lynch, and N. Shavit. Concurrent Timestamping Made Simple. Proceedings of Israel Symposium on Theory of Computing and Systems, 1992.
33. J. Y. Halpern and Y. Moses. Knowledge and Common Knowledge in a Distributed Environment, Journal of the Association for Computing Machinery, Vol 37, No 3, January 1990, pp. 549-587. A preliminary version appeared in Proc. 3rd ACM Symposium on Principles of Distributed Computing, 1984.
34. J.Y. Halpern, Y. Moses, and O. Waarts. A Characterization of Eventual Byzantine Agreement. In Proc. 9th ACM Symposium on Principles of Distributed Computing, pp. 333-346, August 1990.
35. M.P. Herlihy. Randomized wait-free concurrent objects. In Proc. 10th ACM Symposium on Principles of Distributed Computing, August 1991.
36. A. Israeli and M. Li. Bounded Time Stamps. In Proc. 28th IEEE Symposium on Foundations of Computer Science, 1987.
37. A. Israeli and M. Pinhasov. A Concurrent Time-Stamp Scheme which is Linear in Time and Space. Manuscript, 1991.
38. P. Kanellakis and A. Shvartsman. Efficient Parallel Algorithms Can Be Made Robust. In Proc. 8th ACM Symposium on Principles of Distributed Computing, pp. 211-222
39. P. Kanellakis and A. Shvartsman. Efficient Robust Parallel Computations. In Proc. 10th ACM Symposium on Principles of Distributed Computing, pp. 23-36, 1991.
40. Z. Kedem, K. Palem, A. Raghunathan, and P. Spirakis. Combining Tentative and Definitie Algorithms for Very Fast Dependable Parallel Computing. In Proc. 23rd ACM Symposium on Theory of Computing, pp. 381-390, 1991.
41. A. Kedem, K. Palem, and P. Spiriakis. Efficient Robust Parallel Computations. In Proc. 22nd ACM Symposium on Theory of Computing, pp. 138-148, 1990.
42. L. M. Kirousis, P. Spirakis and P. Tsigas. Reading Many Variables in One Atomic Operation Solutions With Linear or Sublinear Complexity. In Proceedings of the 5th International Workshop on Distributed Algorithms, 1991.
43. L. Lamport. On Interprocess Communication, Parts I and II. Distributed Computing 1, pp. 77-101, 1986.
44. C. Martel and R. Subramonian. On the Complexity of Certified Write-All Algorithms. Manuscript, 1993.
45. C. Martel, R. Subramonian, and A. Park. Asynchronous PRAMS are (Almost) as Good as Synchronous PRAMs. In Proc. 32nd IEEE Symposium on Foundations of Computer Science, pp. 590-599, 1990.
46. Y. Moses and M.R. Tuttle. Programming Simultaneous Actions Using Common Knowledge. Algorithmica. 3(1), pp. 121-169, 1988 (Also appeared in Proc. 28th IEEE Symposium on Foundations of Computer Science, pp. 208-221, 1986.)
47. J. Naor and R. M. Roth. Constructions of permutation arrays for certain scheduling cost measures. Manuscript.
48. B. Patt-Shamir and S. Rajsbaum. A Theory of Clock Synchronization. In Proc. 26th ACM Symposium on Theory of Computing, pp. 810-819, May 1994.
49. R. D. Prisco, A. Mayer, and M. Yung. Time-optimal message-efficient work performance in the presence of faults. In Proc. 30th A CM Symposium on Principles of Distributed Computing, pages 161-172, 1994.
50. M. Saks, N. Shavit, and H. Woll. Optimal time randomized consensus - making resilient algorithms fast in practice. In Proceedings of the 2nd ACMSIAM Symposium on Discrete Algorithms, pp. 351-362, 1991.
51. D. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Comm. of the ACM 28(2), pp. 202-208, 1985.
52. P. M. B. Vitanyi and B. Awerbuch. Atomic Shared Register Access by Asynchronous Hardware. In Proc. 27th IEEE Symposium on Foundations of Computer Science, 1986.