Flat combining and the synchronization-parallelism tradeoff

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Danny Hendler Ben-Gurion University, Beer-Sheva, Israel
Itai Incze Tel-Aviv University, Tel-Aviv, Israel
Nir Shavit Tel-Aviv University, Tel-Aviv, Israel
Moran Tzafrir Tel-Aviv University, Tel-Aviv, Israel
Flat combining and the synchronization-parallelism tradeoff Published by ACM 2010 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 60
· Downloads (cumulative): 247
· Citation Count: 25

Published in:
Cover Image
 
· Proceeding
SPAA '10 Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures
Pages 355-364
ACM New York, NY, USA ©2010
table of contents ISBN: 978-1-4503-0079-7 doi>10.1145/1810479.1810540

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


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