TY - GEN
T1 - A fast handshake join implementation on FPGA with adaptive merging network
AU - Oge, Yasin
AU - Miyoshi, Takefumi
AU - Kawashima, Hideyuki
AU - Yoshinaga, Tsutomu
PY - 2013/8/30
Y1 - 2013/8/30
N2 - One of a critical design issues for implementing handshake-join hardware is result collection performed by a merging network. To address the issue, we introduce an adaptive merging network. Our implementation achieves over 3 million tuples per second when the selectivity is 0.1. The proposed implementation attains up to 5.2x higher throughput than original handshake-join hardware. In this demonstration, we apply the proposed technique to filter out malicious packets from packet streams. To the best of our knowledge, our system is the fastest handshake join implementation on FPGA.
AB - One of a critical design issues for implementing handshake-join hardware is result collection performed by a merging network. To address the issue, we introduce an adaptive merging network. Our implementation achieves over 3 million tuples per second when the selectivity is 0.1. The proposed implementation attains up to 5.2x higher throughput than original handshake-join hardware. In this demonstration, we apply the proposed technique to filter out malicious packets from packet streams. To the best of our knowledge, our system is the fastest handshake join implementation on FPGA.
UR - http://www.scopus.com/inward/record.url?scp=84883048529&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84883048529&partnerID=8YFLogxK
U2 - 10.1145/2484838.2484868
DO - 10.1145/2484838.2484868
M3 - Conference contribution
AN - SCOPUS:84883048529
SN - 9781450319218
T3 - ACM International Conference Proceeding Series
BT - SSDBM 2013 - Proceedings of the 25th International Conference on Scientific and Statistical Database Management
T2 - 25th International Conference on Scientific and Statistical Database Management, SSDBM 2013
Y2 - 29 July 2013 through 31 July 2013
ER -