Revisiting Co-Processing for hash joins on the coupled CPU-GPU architecture

Proceedings of the VLDB Endowment

Volumn 6, Issue 10, 2013, Pages 889-900

  He, Jiong ^a   Lu, Mian ^b   He, Bingsheng ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b AGENCY FOR SCIENCE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

MEMORY ARCHITECTURE; PROGRAM PROCESSORS;

COST MODELING; CPU-GPU ARCHITECTURES; CPU-GPU CO-PROCESSING; DESIGN SPACES; GRAPHICS PROCESSOR; JOIN ALGORITHM; LOW-BANDWIDTH; MAIN MEMORY DATABASE;

GRAPHICS PROCESSING UNIT;

EID: 84891121339     PISSN: None     EISSN: 21508097     Source Type: Journal    
DOI: 10.14778/2536206.2536216     Document Type: Article

References (36)

1. A. Ailamaki, D. J. DeWitt, M. D. Hill, and D. A. Wood. Dbmss on a modern processor: Where does time go In VLDB, 1999.
2. AMD Corp. http://amddevcentral.com/afds/pages/default.aspx.
3. C. Balkesen, J. Teubner, G. Alonso, and M. T. Oszu. Main-memory hash joins on multi-core cpus: tunning to the underlying hardware. In ICDE, 2013.
4. S. Blanas, Y. Li, and J. M. Patel. Design and evaluation of main memory hash join algorithms for multi-core cpus. In SIGMOD, pages 37-48, 2011.
5. P. A. Boncz, S. Manegold, and M. L. Kersten. Database architecture optimized for the new bottleneck: Memory access. In VLDB, 1999.
6. L. Chen, X. Huo, and G. Agrawal. Accelerating mapreduce on a coupled cpu-gpu architecture. In SC, pages 25:1-25:11, 2012.
7. M.-S. Chen, M.-L. Lo, P. S. Yu, and H. C. Young. Using segmented right-deep trees for the execution of pipelined hash joins. In VLDB, pages 15-26, 1992.
8. S. Chen, A. Ailamaki, P. B. Gibbons, and T. C. Mowry. Improving hash join performance through prefetching. TODS, 2007.
9. D. DeWitt and J. Gray. Parallel database systems: the future of high performance database systems. Commun. ACM, 1992.
10. D. J. DeWitt and R. H. Gerber. Multiprocessor hash-based join algorithms. In VLDB, pages 151-164, 1985.
11. J. Fang, A. L. Varbanescu, and H. Sips. A comprehensive performance comparison of cuda and opencl. In ICPP, 2011.
12. W. Fang, B. He, and Q. Luo. Database compression on graphics processors. Proc. VLDB Endow., pages 670-680, 2010.
13. P. Garcia and H. F. Korth. Pipelined hash-join on multithreaded architectures. In DaMoN, pages 1:1-1:8, 2007.
14. B. Gold, A. Ailamaki, L. Huston, and B. Falsafi. Accelerating database operators using a network processor. In DaMoN, 2005.
15. B. He, M. Lu, K. Yang, R. Fang, N. K. Govindaraju, Q. Luo, and P. V. Sander. Relational query coprocessing on graphics processors. ACM TODS, pages 21:1-21:39, 2009.
16. B. He and Q. Luo. Cache-oblivious databases: Limitations and opportunities. ACM Trans. Database Syst., pages 8:1-8:42, 2008.
17. B. He, K. Yang, R. Fang, M. Lu, N. Govindaraju, Q. Luo, and P. Sander. Relational joins on graphics processors. In SIGMOD, pages 511-524, 2008.
18. B. He and J. X. Yu. High-throughput transaction executions on graphics processors. Proc. VLDB Endow., pages 314-325, 2011.
19. J. He, M. Lu, and B. He. Revisiting co-processing for hash joins on the coupled cpu-gpu architecture. In arXiv:1307.1955, 2013.
20. T. H. Hetherington and et al. Characterizing and evaluating a key-value store application on heterogeneous cpu-gpu systems. In ISPASS, pages 88-98, 2012.
21. C. Hong, D. Chen, W. Chen, W. Zheng, and H. Lin. Mapcg: writing parallel program portable between cpu and gpu. In PACT, pages 217-226, 2010.
22. T. Kaldewey, G. Lohman, R. Mueller, and P. Volk. Gpu join processing revisited. In DaMoN, pages 55-62, 2012.
23. C. Kim and et al. Sort vs. hash revisited: fast join implementation on modern multi-core cpus. PVLDB, 2009.
24. Y. Li, I. Pandis, R. Mueller, V. Raman, and G. Lohman. Numa-aware algorithms: the case of data shuffling. In CIDR, 2013.
25. M.-L. Lo, M.-S. S. Chen, C. V. Ravishankar, and P. S. Yu. On optimal processor allocation to support pipelined hash joins. In SIGMOD, pages 69-78, 1993.
26. S. Manegold, P. Boncz, and M. L. Kersten. Generic database cost models for hierarchical memory systems. In VLDB, pages 191-202, 2002.
27. S. Manegold, P. A. Boncz, and M. L. Kersten. What happens during a join dissecting cpu and memory optimization effects. In VLDB, 2000.
28. H. Pirk, S. Manegold, and M. Kersten. Accelerating foreign-key joins using asymmetric memory channels. In ADMS, 2011.
29. K. Ross. Efficient hash probes on modern processors. In ICDE, pages 1297-1301, 2007.
30. D. A. Schneider and D. J. DeWitt. A performance evaluation of four parallel join algorithms in a shared-nothing multiprocessor environment. In SIGMOD, pages 110-121, 1989.
31. A. Shatdal, C. Kant, and J. F. Naughton. Cache conscious algorithms for relational query processing. In VLDB, 1994.
32. M. Stonebraker and et al. C-store: a column-oriented dbms. In VLDB, pages 553-564, 2005.
33. G. Tan, L. Li, S. Triechle, E. Phillips, Y. Bao, and N. Sun. Fast implementation of dgemm on fermi gpu. In SC, 2011.
34. J. Teubner and R. Mueller. How soccer players would do stream joins. In SIGMOD, pages 625-636, 2011.
35. K. Thouti and S.R.Sathe. Comparison of openmp and opencl parallel processing technologies. IJACSA, pages 56-161, 2012.
36. S. Zhang, J. He, B. He, and M. Lu. Omnidb: Towards portable and efficient query processing on parallel cpu/gpu architectures. In PVLDB, pages 1-4, 2013.