Space-round tradeoffs for MapReduce computations

doi:10.1145/2304576.2304607

Space-round tradeoffs for MapReduce computations

Full Text:

PDF

Buy this Article

Authors:	Andrea Pietracaprina	Università di Padova, Padova, Italy
	Geppino Pucci	Università di Padova, Padova, Italy
	Matteo Riondato	Brown University, Providence, RI, USA
	Francesco Silvestri	Università di Padova, Padova, Italy
	Eli Upfal	Brown University, Providence, RI, USA

	2012 Article
Bibliometrics
· Downloads (6 Weeks): 13 · Downloads (12 Months): 74 · Downloads (cumulative): 74 · Citation Count: 0

Published in:

	· Proceeding
	ICS '12 Proceedings of the 26th ACM international conference on Supercomputing
	Pages 235-244 ACM New York, NY, USA ©2012 table of contents ISBN: 978-1-4503-1316-2 doi>10.1145/2304576.2304607

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref
Upcoming Conference:
- ICS'13

Share:

|

Tags: algorithms design distributed architectures mapreduce matching matrix inversion parallelism and concurrency sparse and dense matrix multiplication theory tradeoff

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 Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder