SIGN IN
SIGN UP
Delay scheduling: a simple technique for achieving locality and fairness in cluster scheduling
Full Text:
PDF
Buy this Article
Authors:
Matei Zaharia
University of California, Berkeley, Berkeley, CA, USA
Dhruba Borthakur
Facebook Inc, Palo Alto, CA, USA
Joydeep Sen Sarma
Facebook Inc, Palo Alto, CA, USA
Khaled Elmeleegy
Yahoo! Research, Sunnyvale, CA, USA
Scott Shenker
University of California, Berkeley, Berkeley, CA, USA
Ion Stoica
University of California, Berkeley, Berkeley, CA, USA
2010 Article
Bibliometrics
· Downloads (6 Weeks): 48
· Downloads (12 Months): 543
· Downloads (cumulative): 1,448
· Citation Count: 61
Published in:
· Proceeding
EuroSys '10
Proceedings of the 5th European conference on Computer systems
Pages 265-278
ACM
New York, NY
, USA
©2010
table of contents
ISBN: 978-1-60558-577-2
doi>
10.1145/1755913.1755940
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
cluster computing
design
fair sharing
mapreduce
performance
scheduling
scheduling
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