TU Berlin

Database Systems and Information Management GroupPublications

Logo FG DIMA-new  65px

Page Content

to Navigation

Publications

Robust Query Processing in Co-Processor-accelerated Databases.
Citation key BreßFTM2016
Author Sebastian Breß, Henning Funke, Jens Teubner, Volker Markl
Pages 233
Year 2016
Location Potsdam, Germany, 2016
Journal Proceedings of the LWA 2016 Workshops: KDML, FGWM, IR, and FGDB
Volume 2016
Abstract Technology limitations are making the use of heterogeneous computing devices much more than an academic curiosity. In fact, the use of such devices is widely acknowledged to be the only promising way to achieve application-speedups that users urgently need and expect. However, building a robust and ecient query engine for heterogeneous co-processor environments is still a signi cant challenge. In our latest work [1], we identify two e ects that limit performance in case co-processor resources become scarce. Cache thrashing occurs when the working set of queries does not t into the co-processor's data cache, resulting in performance degradations up to a factor of 24. Heap contention occurs when multiple operators run in parallel on a co-processor and when their accumulated memory footprint exceeds the main memory capacity of the co-processor, slowing down query execution by up to a factor of six. We propose solutions for both e ects. Data-driven operator placement avoids data movements when they might be harmful; query chopping limits co-processor memory usage and thus avoids contention. The combined approach of data-driven query chopping achieves robust and scalable performance on co-processors. We validate our proposal with our open-source GPU-accelerated database engine CoGaDB and the popular star schema and TPC-H benchmarks.
Download Bibtex entry

Navigation

Quick Access

Schnellnavigation zur Seite über Nummerneingabe