SIGN IN
SIGN UP
Dynamic load balancing in parallel and distributed networks by random matchings (extended abstract)
Full Text:
PDF
Buy this Article
Authors:
Bhaskar Ghosh
Yale Univ., New Haven, CT
S. Muthukrishnan
New York Univ., New York, NY
Published in:
· Proceeding
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Pages 226-235
ACM
New York, NY
, USA
©1994
table of contents
ISBN:0-89791-671-9
doi>
10.1145/181014.181366
1994 Article
Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 23
· Downloads (cumulative): 859
· Citation Count: 17
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SPAA '13
Share:
|
Tags:
algorithms
scheduling
sequencing and scheduling
theory
verification
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