SIGN IN
SIGN UP
Decentralized algorithms using both local and random probes for P2P load balancing
Full Text:
Pdf
Buy this Article
Authors:
Krishnaram Kenthapadi
Stanford University
Gurmeet Singh Manku
Google Inc.
Published in:
· Proceeding
SPAA '05
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
ACM
New York, NY
, USA
©2005
table of contents
ISBN:1-58113-986-1
doi>
10.1145/1073970.1073990
2005 Article
Bibliometrics
· Downloads (6 Weeks): 6
· Downloads (12 Months): 49
· Citation Count: 7
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SPAA '12
Share:
|
Tags:
algorithms
binary trees
bins and balls
cliques
coupon collection
decentralized algorithms
distributed applications
distributed hash tables
load balancing
nonnumerical algorithms and problems
peer to peer systems
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder