Performance evaluation of main-memory hash joins on KNL Online publication date: Sun, 12-Jan-2020
by Deyou Tang; Yazhuo Zhang; Qingmiao Zeng; Hu Chen
International Journal of Computational Science and Engineering (IJCSE), Vol. 20, No. 4, 2019
Abstract: New hardware features have propelled designs and analysis in main-memory hash joins. In previous studies, memory access has always been the primary bottleneck for hash join algorithms. However, there are relatively few studies devoted to bottlenecks analysis on knights landing processor (KNL). In this paper, we pay attention to the state-of-the-art hash join algorithms on KNL and analyse their bottlenecks under different workloads. The analysis and comparisons in the paper show that both memory latency and bandwidth are keys to improve hash joins, and multi-channel dynamic random access memory (MCDRAM) reasonably plays a vital role in enhancing performance. Notably, we find that hash join algorithms that are hardware-oblivious perform better than hardware-conscious approaches. A typical algorithm of hardware-oblivious joins achieves a better performance than ever before to the best of our knowledge. Through the analysis, we shed light on how new features of KNL affect the performance of hash joins.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook