Brief Announcement: Optimally work-competitive scheduling for cooperative computing with merging groups

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2002, Pages 132-

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

^a University of Connecticut   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; COMPUTER SIMULATION; COMPUTER SUPPORTED COOPERATIVE WORK; DATA STRUCTURES; GRAPH THEORY; TELECOMMUNICATION SERVICES;

COOPERATIVE COMPUTING; DIRECTED ACYCLIC GRAPH;

DISTRIBUTED COMPUTER SYSTEMS;

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

References (5)

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. C. Georgiou and A. Shvartsman. Cooperative computing with fragmentable and mergeable groups. Journal of Discrete Algorithms. Accepted for publication. (Also in SIROCCO 2000, pages 141-156.)
3. G. Malewicz, A. Russell, and A. A. Shvartsman. Distributed cooperation during the absence of communication. In DISC 2000, pages 119-133.
4. Special Issue on Group Communication Services, volume 39(4) of CACM, 1996.
5. D. Sleator and R. Tarjan. Amortized efficiency of list update and paging rules. CACM, 28(2):202-208, 1985.