Work-competitive scheduling for cooperative computing with dynamic groups

SIAM Journal on Computing

Volumn 34, Issue 4, 2005, Pages 848-862

  Georgiou, Chryssis ^a   Russell, Alexander ^b   Shvartsman, Alexander A ^b,c  

^a UNIVERSITY OF CYPRUS   (Cyprus)

^b University of Connecticut   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Competitive analysis; Distributed computation; Independent tasks; On line algorithms; Partitionable networks; Randomized algorithms; Work complexity

Indexed keywords

COMPETITIVE ANALYSIS; DISTRIBUTED COMPUTATION; INDEPENDENT TASKS; ON-LINE ALGORITHMS; PARTITIONABLE NETWORKS; RANDOMIZED ALGORITHMS; WORK COMPLEXITY;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROGRAM PROCESSORS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 24344480034     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539704440442     Document Type: Article

References (27)

1. M. AJTAI, J. ASPNES, C. DWORK, AND O. WAARTS, A theory of competitive analysis for distributed algorithms, in Proceedings of the 35th Symposium on Foundations of Computer Science (FOCS 1994), IEEE, Los Alamitos, CA, 1994, pp. 401-411.
2. R. J. ANDERSON AND H. WOLL, Algorithms for the certified write-all problem, SIAM J. Comput., 26 (1997), pp. 1277-1283.
3. B. AWERBUCH, S. KUTTEN, AND D. PELEG, Competitive distributed job scheduling, in Proceedings of the 24th ACM Symposium on Theory of Computing (STOC 1992), ACM, New York, 1992, pp. 571-580.
4. O. BABAOGLU, R. DAVOLI, A. MONTRESOR, AND R. SEGALA, System support for partition-aware network applications, in Proceedings of the 18th IEEE International Conference on Distributed Computing Systems (ICDCS 1998), IEEE, Los Alamitos, CA, 1998, pp. 184-191.
5. Y. BARTAL, A. FIAT, AND Y. RABANI, Competitive algorithms for distributed data management, in Proceedings of the 24th ACM Symposium on Theory of Computing (STOC 1992), ACM, New York, 1992, pp. 39-50.
6. S. BEN-DAVID, A. BORODIN, R. KARP, G. TARDOS, AND A. WIGDERSON, On the power of randomization in on-line algorithms, Algorithmica, 11 (1994), pp. 2-14.
7. B. CHLEBUS, R. DE PRISCO, AND A. A. SHVARTSMAN, Performing tasks on restartable message-passing processors, Distributed Comput., 14 (2001), pp. 49-64.
8. R. DE PRISCO, A. MAYER, AND M. YUNG, Time-optimal message-efficient work performance in the presence of faults, in Proceedings of the 13th ACM Symposium on Principles of Distributed Computing (PODC 1994), ACM, New York, 1994, pp. 161-172.
9. R. P. DILWORTH, A decomposition theorem for partially ordered sets, Ann. of Math., 51 (1950), pp. 161-166.
10. S. DOLEV, R. SEGALA, AND A. A. SHVARTSMAN, Dynamic load balancing with group communication, in Proceedings of the 6th International Colloquium on Structural Information and Communication Complexity (SIROCCO 1999), Carleton Scientific, Waterloo, ON, Canada, 1999, pp. 111-125.
11. C. DWORK, J. Y. HALPERN, AND O. WAARTS, Performing work efficiently in the presence of faults, SIAM J. Comput., 27 (1998), pp. 1457-1491.
12. A. FIAT, R. M. KARP, M. LUBY, L. A. McGEOCH, D. D. SLEATOR, AND N. E. YOUNG, Competitive paging algorithms, J. Algorithms, 12 (1991), pp. 685-699.
13. S. GEORGIADES, M. MAVRONICOLAS, AND P. SPIRAKIS, Optimal, distributed decision-making: The case of no communication, in Proceedings of the 12th International Symposium on Fundamentals of Computation Theory (FCT 1999), Lecture Notes in Comput. Sci. 1684, Springer-Verlag, Berlin, 1999, pp. 293-303.
14. CH. GEORGIOU, A. RUSSELL, AND A. A. SHVARTSMAN, Optimally work-competitive scheduling for cooperative computing with merging groups (brief announc.), in Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing (PODC 2002), ACM, New York, 2002, p. 132.
15. CH. GEORGIOU, A. RUSSELL, AND A. A. SHVARTSMAN, Work-competitive scheduling for cooperative computing with dynamic groups, in Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC 2003), ACM, New York, 2003, pp. 251-258.
16. CH. GEORGIOU AND A. A. SHVARTSMAN, Cooperative computing with fragmentable and mergeable groups, J. Discrete Algorithms, 1 (2003), pp. 211-235.
17. J. F. GROOTE, W. H. HESSELINK, S. MAUW, AND R. VERMEULEN, An algorithm for the asynchronous Write-All problem based on process collision, Distributed Comput., 14 (2001), pp. 75-81.
18. P. C. KANELLAKIS AND A. A. SHVARTSMAN, Fault-Tolerant Parallel Computation, Kluwer Academic, Dordrecht, The Netherlands, 1997.
19. Z. M. KEDEM, K. V. PALEM, AND P. SPIRAKIS, Efficient robust parallel computations, in Proceedings of the 22nd ACM Symposium on Theory of Computing (STOC 1990), ACM, New York, 1990, pp. 138-148.
20. G. MALEWICZ, A. RUSSELL, AND A. A. SHVARTSMAN, Distributed cooperation during the absence of communication, in Proceedings of the 14th International Symposium on Distributed Computing (DISC 2000), Lecture Notes in Comput. Sci. 1914, Springer-Verlag, Berlin, 2000, pp. 119-133.
21. C. MARTEL AND R. SUBRAMONIAN, On the complexity of certified Write-All algorithms, J. Algorithms, 16 (1994), pp. 361-387.
22. C. H. PAPADIMITRIOU AND M. YANNAKAKIS, On the value of information in distributed decision-making, in Proceedings of the 10th ACM Symposium on Principles of Distributed Computing (PODC 1991), ACM, New York, 1991, pp. 61-64.
23. D. POWELL, ED., Special Issue on Group Communication Services, Comm. ACM, 39 (1996).
24. M. SAKS, N. SHAVIT, AND H. WOLL, Optimal time randomized consensus - making resilient algorithms fast in practice, in Proceedings of the 2nd ACM-SIAM Symposium on Discrete Algorithms (SODA 1991), ACM, New York, 1991, pp. 351-362.
25. N. SHAVIT, Concurrent Timestamping, Ph.D. thesis, The Hebrew University, 1989.
26. D. SLEATOR AND R. TARJAN, Amortized efficiency of list update and paging rules, Comm. ACM, 28 (1985), pp. 202-208.
27. J. B. SUSSMAN AND K. MARZULLO, The Bancomat problem: An example of resource allocation in a partitionable asynchronous system, in Proceedings of the 12th International Symposium on Distributed Computing (DISC 1998), Lecture Notes in Comput. Sci. 1499, Springer-Verlag, Berlin, 1998, pp. 363-377.