Conference proceeding
Evaluating work distribution patterns for parallel bitmap compression over SMPs
Companion Proceedings of the 2015 ACM SIGPLAN International Conference on systems, programming, languages and applications: software for humanity, pp.52-53
SPLASH Companion 2015
10/25/2015
DOI: 10.1145/2814189.2817275
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.
Details
- Title: Subtitle
- Evaluating work distribution patterns for parallel bitmap compression over SMPs
- Creators
- Ben McCamish - Oregon State UniversityXinghui Zhao - Washington State UniversityDavid Chiu - University of Puget SoundJason Sawin - University of St. Thomas (Minnesota)Guadalupe Canahuate - University of Iowa
- Resource Type
- Conference proceeding
- Publication Details
- Companion Proceedings of the 2015 ACM SIGPLAN International Conference on systems, programming, languages and applications: software for humanity, pp.52-53
- Series
- SPLASH Companion 2015
- DOI
- 10.1145/2814189.2817275
- Publisher
- ACM
- Language
- English
- Date published
- 10/25/2015
- Academic Unit
- Electrical and Computer Engineering
- Record Identifier
- 9984197265802771
Metrics
11 Record Views