ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Optimally work-competitive scheduling for cooperative computing with merging groups
Full text PdfPdf (126 KB)
Source Annual ACM Symposium on Principles of Distributed Computing archive
Proceedings of the twenty-first annual symposium on Principles of distributed computing table of contents
Monterey, California
SESSION: Session 4 (brief announcements) table of contents
Pages: 132 - 132  
Year of Publication: 2002
ISBN:1-58113-485-1
Authors
Chryssis Georgiou  University of Connecticut, Storrs, CT
Alexander Russell  University of Connecticut, Storrs, CT
Alex A. Shvartsman  University of Connecticut, Storrs, CT
Sponsors
SIGOPS: ACM Special Interest Group on Operating Systems
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 10,   Citation Count: 2
Additional Information:

references   cited by   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/571825.571848
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
C. Georgiou, A. Russell, and A. A. Shvartsman. Optimally work-competitive scheduling for cooperative computing with merging groups. At http://www.engr.uconn.edu/~cg2/GRSmerges.ps.
 
2
Chryssis Georgiou , Alex A. Shvartsman, Cooperative computing with fragmentable and mergeable groups, Journal of Discrete Algorithms, v.1 n.2, p.211-235, April 2003  [doi>10.1016/S1570-8667(03)00026-1]
 
3
Grzegorz Greg Malewicz , Alexander Russell , Alexander A. Shvartsman, Distributed Cooperation During the Absence of Communication, Proceedings of the 14th International Conference on Distributed Computing, p.119-133, October 04-06, 2000
 
4
Special Issue on Group Communication Services, volume 39(4) of CACM, 1996.
5
Daniel D. Sleator , Robert E. Tarjan, Amortized efficiency of list update and paging rules, Communications of the ACM, v.28 n.2, p.202-208, Feb. 1985  [doi>10.1145/2786.2793]

CITED BY  2
Chryssis Georgiou , Alexander Russell , Alex A. Shvartsman, Work-competitive scheduling for cooperative computing with dynamic groups, Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, June 09-11, 2003, San Diego, CA, USA
Chryssis Georgiou , Alexander Russell , Alex A. Shvartsman, distributed cooperation and adversity: complexity trade-offs, Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday, p.60-71, June 08-08, 2003, San Diego, California, USA
Collaborative Colleagues:
Chryssis Georgiou: colleagues
Alexander Russell: colleagues
Alex A. Shvartsman: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player