Work-competitive scheduling for cooperative computing with dynamic groups

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 251-258

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

^a University of Connecticut   (United States)

^b 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

ALGORITHMS; COMMUNICATION; DISTRIBUTED COMPUTER SYSTEMS; SCHEDULING;

WORK-COMPETITIVE SCHEDULING;

COMPUTER SUPPORTED COOPERATIVE WORK;

EID: 0038784656     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780542.780581     Document Type: Conference Paper

References (22)

1. th Symposium on Foundations of Computer Science (FOCS 1994), pages 401-411, 1994.
2. th ACM Symposium on Theory of Computing (STOC 1992), pages 571-580, 1992.
3. th IEEE International Conference on Distributed Computing Systems (ICDCS 1998), pages 184-191, 1998.
4. th ACM Symposium on Theory of Computing (STOC 1992), pages 39-50, 1992.
5. S. Ben-David, A. Borodin, R. Karp, G. Tardos, and A. Wigderson. On the power of randomization in on-line algorithms. Algorithmica, 11(1):2-14, 1994.
6. B. Chlebus, R. De Frisco, and A.A. Shvartsman. Performing tasks on restartable message-passing processors. Distributed Computing, 14(1):49-64, 2001.
7. th ACM Symposium on Principles of Distributed Computing (PODC 1994), pages 161-172, 1994.
8. R.P. Dilworth. A decomposition theorem for partially ordered sets. Annals of Mathematics, 51:161-166, 1950.
9. th International Colloquium on Structural Information and Communication Complexity (SIROCCO 1999), pages 111-125, 1999.
10. th ACM Symposium on Principles of Distributed Computing (PODC 1992), pages 91-102. 1992.
11. th ACM Symposium on Principles of Distributed Computing (PODC 1992), pages 91-102. 1992.
12. A. Fiat, R.M. Karp, M. Luby, L.A. McGeoch, D.D. Sleator, and N.E. Young. Competitive paging algorithms. Journal of Algorithms, 12(4):685-699, 1991.
13. th Int-l Symposium on Foundamentals of Computation Theory (FCT 1999), pages 293-303, 1999.
14. nd ACM Symposium on Principles of Distributed Computing (PODC 2002), 2002.
15. th Int-l Colloquium on Structural Information and Communication Complexity (SIROCCO 2000), pages 141-156, 2000).
16. P.C. Kanellakis and A.A. Shvartsman. Fault-Tolerant Parallel Computation. Kluwer Academic Publishers, 1997.
17. th International Symposium on Distributed Computing (DISC 2000), pages 119-133, 2000.
18. th ACM Symposium on Principles of Distributed Computing (PODC 1991), pages 61-64, 1991.
19. D. Powell, editor. Special Issue on Group Communication Services, volume 39(4) of Communications of the ACM. ACM Press, 1996.
20. nd ACM-SIAM Symposium on Discrete Algorithms (SODA 1991), pages 351-362, 1991.
21. D. Sleator and R. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28(2):202-208, 1985.
22. th International Symposium on Distributed Computing (DISC 1998), pages 363-377, 1998.