Relational Algorithms for Multi-Bulk-Synchronous Processors
Gregory Diamos, Haicheng Wu, Jin Wang, Ashwin Lele and Sudhakar Yalamanchili. “Relational Algorithms for Multi-Bulk-Synchronous Processors. (short paper)” 18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPOPP’13). February 2013.
Abstract
Relational databases remain an important application infrastructure for organizing and analyzing massive volumes of data. At the same time, processor architectures are increasingly gravitating towards Multi-Bulk-Synchronous processor (Multi-BSP) architectures employing throughput-optimized memory systems, lightweight multi-threading, and Single-Instruction Multiple-Data (SIMD) core organizations. This paper explores the mapping of primitive relational algebra operations onto such architectures to improve the throughput of data warehousing applications built on relational databases.
Download
Citation
@inproceedings{diamos-relational-algorithms,
author={Diamos, G. and Wu, H. and Wang, J. and Lele A. and Yalamanchili S.},
booktitle={18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPOPP’13)},
title={Relational Algorithms for Multi-Bulk-Synchronous Processors},
year={2013},
month={February},
}
author={Diamos, G. and Wu, H. and Wang, J. and Lele A. and Yalamanchili S.},
booktitle={18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPOPP’13)},
title={Relational Algorithms for Multi-Bulk-Synchronous Processors},
year={2013},
month={February},
}
