Abstract-Decision Support System (DSS) workloads are known to be one of the most time-consuming database workloads that process large data sets. Traditionally, DSS queries have been accelerated using large-scale multiprocessors. In this work we exploit the benefits of using future manycore architectures, more specifically on-chip clustered manycore architectures. To achieve this goal we propose different representative data parallel versions of the original database scan and join algorithms. We also study the impact on the performance when on-chip memory, shared among all cores, is used as a prefetching buffer. For our experiments we study the behaviour of three queries from the standard DSS benchmark TPC-H executing on the Intel Single chip Cloud Computer experimental processor (Intel SCC). Our results show that parallelism can be well exploited by such architectures and how important it is to have a balance between computation and data intensity. Moreover, from our experimental results we show that performance improvement of 5x and 10x for the corresponding query implementation without data prefetching. Finally we show how we could efficiently use the system in order to achieve high power-performance efficiency when using the proposed prefetching buffer.
Petrides et al. REF propose different representative data-parallel versions of the original database scan and join algorithms to exploit the benefits of using on-chip clustered many-core architectures, and study the impact on the performance when on-chip memory, shared among all cores, is used as a prefetching buffer.
Scalability and Efficiency of Database Queries on Future Many-Core Systems
2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing
2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing
Computer Science