Optimally work-competitive scheduling for cooperative computing with merging groups

Authors:
Chryssis Georgiou;Alexander Russell;Alex A. Shvartsman
Affiliations:
University of Connecticut, Storrs, CT;University of Connecticut, Storrs, CT;University of Connecticut, Storrs, CT
Venue:
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Year:
2002

Citing 3
Cited 2

Amortized efficiency of list update and paging rules

Communications of the ACM
Distributed Cooperation During the Absence of Communication

DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Cooperative computing with fragmentable and mergeable groups

Journal of Discrete Algorithms

distributed cooperation and adversity: complexity trade-offs

PCK50 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
Work-competitive scheduling for cooperative computing with dynamic groups

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract