ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술지 Efficient Parallel Join Processing Exploiting SIMD in Multi-Thread Environments
Cited 2 time in scopus Download 5 time Share share facebook twitter linkedin kakaostory
저자
홍길석, 강성현, 김창수, 민준기
발행일
201803
출처
IEICE Transactions on Information and Systems, v.E101-D no.3, pp.659-667
ISSN
1745-1361
출판사
일본, 전자정보통신학회 (IEICE)
DOI
https://dx.doi.org/10.1587/transinf.2017EDP7300
협약과제
17HS7600, 대규모 트랜잭션 처리와 실시간 복합 분석을 통합한 일체형 데이터 엔지니어링 기술 개발, 김창수
초록
In this paper, we study parallel join processing to improve the performance of the merge phase of sort-merge join by integrating all parallelism provided by mainstream CPUs. Modern CPUs support SIMD instruction sets with wider SIMD registers which allows to process multiple data items per each instruction. Thus, we devise an efficient parallel join algorithm, called Parallel Merge Join with SIMD instructions (PMJS). In our proposed algorithm, we utilize data parallelism by exploiting SIMD instructions. And we also accelerate the performance by avoiding the usage of conditional branch instructions. Furthermore, to take advantage of the multiple cores, our proposed algorithm is threaded in multi-thread environments. In our multi-thread algorithm, to distribute workload evenly to each thread, we devise an efficient workload balancing algorithm based on the kernel density estimator which allows to estimate the workload of each thread accurately.
키워드
Kernel density estimator, Multi-thread, SIMD, Sort-merge join
KSP 제안 키워드
Instruction sets, Join algorithm, Join processing, Multi-thread, Multiple data, SIMD instruction, Sort-merge Join, Workload Balancing, balancing algorithm, data parallelism, kernel density estimator