[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/2814189.2817275acmconferencesArticle/Chapter ViewAbstractPublication PagessplashConference Proceedingsconference-collections
abstract

Evaluating work distribution patterns for parallel bitmap compression over SMPs

Published: 25 October 2015 Publication History

Abstract

Bitmap indices are popular in managing large-scale data, but their size quickly grows out-of-core without compression. At the same time, Moore's enables a proliferation of machines with parallel architectures, letting users exploit symmetric multiprocessors (SMP) for common tasks. In this poster, we evaluate two widely used parallel work distribution models for parallelizing bitmap compression.

References

[1]
P. Berenbrink, T. Friedetzky, and L. Goldberg. The natural work-stealing algorithm is stable. SIAM Journal on Computing, 32(5):1260–1279, 2003.
[2]
D. L. Eager, E. D. Lazowska, and J. Zahorjan. A comparison of receiver-initiated and sender-initiated adaptive load sharing. Performance Evaluation, 6(1), 1986.
[3]
D. Neill and A. Wierman. On the benefits of work stealing in shared-memory multiprocessors. Department of Computer Science, Carnegie Mellon University, Tech. Rep, 2009.
[4]
L. Rudolph, M. Slivkin-Allalouf, and E. Upfal. A simple load balancing scheme for task allocation in parallel machines. In SPAA’91, pages 237–245. ACM, 1991. ISBN 0-89791-438-4.
[5]
K. Wu, E. J. Otoo, and A. Shoshani. An efficient compression scheme for bitmap indices, 2004.

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
SPLASH Companion 2015: Companion Proceedings of the 2015 ACM SIGPLAN International Conference on Systems, Programming, Languages and Applications: Software for Humanity
October 2015
112 pages
ISBN:9781450337229
DOI:10.1145/2814189
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 October 2015

Check for updates

Author Tags

  1. Bitmap Compression
  2. Parallel Work Distribution

Qualifiers

  • Abstract

Conference

SPLASH '15
Sponsor:

Upcoming Conference

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 64
    Total Downloads
  • Downloads (Last 12 months)3
  • Downloads (Last 6 weeks)0
Reflects downloads up to 13 Dec 2024

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media