IBM Research Report Parallel Implementation of Relational Database Management Systems Operations on a Multi-Core Network-Optimized System on a Chip
暂无分享,去创建一个
[1] Ahmed Shamsul Arefin,et al. An improvement of Bitonic sorting for parallel computing , 2005 .
[2] David Thomas,et al. The Art in Computer Programming , 2001 .
[3] Guy E. Blelloch,et al. Radix sort for vector multiprocessors , 1991, Proceedings of the 1991 ACM/IEEE Conference on Supercomputing (Supercomputing '91).
[4] Hongjun Lu,et al. Hash-based join algorithms for multiprocessor computers with shared memory , 1990, VLDB 1990.
[5] Michael Stonebraker,et al. Implementation techniques for main memory database systems , 1984, SIGMOD '84.
[6] Hubertus Franke,et al. Workload and network-optimized computing systems , 2010, IBM J. Res. Dev..
[7] Anand R. Tripathi,et al. A parallel join algorithm for SIMD architectures , 1997, J. Syst. Softw..
[8] Michael Garland,et al. Designing efficient sorting algorithms for manycore GPUs , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.
[9] Pradeep Dubey,et al. Efficient implementation of sorting on multi-core SIMD CPU architecture , 2008, Proc. VLDB Endow..
[10] Patrick Martin,et al. Parallel Hash-Based Join Algorithms for a Shared-Everything , 1994, IEEE Trans. Knowl. Data Eng..
[11] James Richard Goodman. An investigation of multiprocessor structures and algorithms for data base management , 1980 .
[12] C. A. R. Hoare,et al. Algorithm 64: Quicksort , 1961, Commun. ACM.
[13] Henry F. Korth,et al. Database hash-join algorithms on multithreaded computer architectures , 2006, CF '06.