SIGN IN
SIGN UP
Applying idealized lower-bound runtime models to understand inefficiencies in data-intensive computing
Full Text:
PDF
Buy this Article
Authors:
Elie Krevat
Carnegie Mellon University, Pittsburgh, PA, USA
Tomer Shiran
Carnegie Mellon University, Pittsburgh, PA, USA
Eric Anderson
HP Labs, Palo Alto, CA, USA
Joseph Tucek
HP Labs, Palo Alto, CA, USA
Jay J. Wylie
HP Labs, Palo Alto, CA, USA
Gregory R. Ganger
Carnegie Mellon University, Pittsburgh, PA, USA
2011 Article
Poster
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 25
· Downloads (cumulative): 91
· Citation Count: 0
Published in:
· Proceeding
SIGMETRICS '11
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Pages 125-126
ACM
New York, NY
, USA
©2011
table of contents
ISBN: 978-1-4503-0814-4
doi>
10.1145/1993744.1993788
Tools and Resources
Buy this Article
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SIGMETRICS '13
Share:
|
Tags:
cloud computing
data-intensive computing
efficiency
measurement
measurements
modeling and prediction
modeling techniques
operational analysis
performance
performance
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