Relational Algorithms for Multi-Bulk-Synchronous Processors

Relational Algorithms for Multi-Bulk-Synchronous Processors

Gregory Diamos, Haicheng Wu, Jin Wang, Ashwin Lele, and Sudhakar Yalamanchili. “Dynamic Compilation of Data-Parallel Kernels for Vector Processors.” 18th Symposium on Principles and Practice of Parallel Programming (PPoPP 18). Feberuary 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 multithreading, 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

Paper [PDF]
Poster [PDF]