An implementation of handshake join on FPGA

Yasin Oge, Takefumi Miyoshi, Hideyuki Kawashima, Tsutomu Yoshinaga

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)

Abstract

This paper shows an implementation of handshake join on field-programmable gate array (FPGA). Handshake join is one of stream join algorithms, proposed by Teubner and Mueller. It can support very high degrees of parallelism and attain unprecedented success in throughput speed in order to achieve efficient support for window-based join in streaming databases. In handshake join, it is necessary to take into account the problems with regard to the capacity of the output channel and the limitation of the internal buffer sizes, in order to apply join operation to input tuples efficiently in a correct manner. However, the implementation has not necessarily clarified in detail yet in their paper. In this paper, to solve the issues, we propose the merging network and the admission controller. Then we evaluate the architecture in terms of the hardware resource usage, the maximum clock frequency, and the operation performance.

Original languageEnglish
Title of host publicationProceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011
Pages95-104
Number of pages10
DOIs
Publication statusPublished - 2011 Dec 1
Externally publishedYes
Event2nd International Conference on Networking and Computing, ICNC 2011 - Osaka, Japan
Duration: 2011 Nov 302011 Dec 2

Other

Other2nd International Conference on Networking and Computing, ICNC 2011
CountryJapan
CityOsaka
Period11/11/3011/12/2

Fingerprint

Merging
Field programmable gate arrays (FPGA)
Clocks
Throughput
Hardware
Controllers

Keywords

  • acceleration
  • FPGA
  • handshake join
  • stream join
  • window join

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications

Cite this

Oge, Y., Miyoshi, T., Kawashima, H., & Yoshinaga, T. (2011). An implementation of handshake join on FPGA. In Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011 (pp. 95-104). [6131822] https://doi.org/10.1109/ICNC.2011.22

An implementation of handshake join on FPGA. / Oge, Yasin; Miyoshi, Takefumi; Kawashima, Hideyuki; Yoshinaga, Tsutomu.

Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011. 2011. p. 95-104 6131822.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Oge, Y, Miyoshi, T, Kawashima, H & Yoshinaga, T 2011, An implementation of handshake join on FPGA. in Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011., 6131822, pp. 95-104, 2nd International Conference on Networking and Computing, ICNC 2011, Osaka, Japan, 11/11/30. https://doi.org/10.1109/ICNC.2011.22
Oge Y, Miyoshi T, Kawashima H, Yoshinaga T. An implementation of handshake join on FPGA. In Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011. 2011. p. 95-104. 6131822 https://doi.org/10.1109/ICNC.2011.22
Oge, Yasin ; Miyoshi, Takefumi ; Kawashima, Hideyuki ; Yoshinaga, Tsutomu. / An implementation of handshake join on FPGA. Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011. 2011. pp. 95-104
@inproceedings{825bd9800338494ca38b35338f3a8628,
title = "An implementation of handshake join on FPGA",
abstract = "This paper shows an implementation of handshake join on field-programmable gate array (FPGA). Handshake join is one of stream join algorithms, proposed by Teubner and Mueller. It can support very high degrees of parallelism and attain unprecedented success in throughput speed in order to achieve efficient support for window-based join in streaming databases. In handshake join, it is necessary to take into account the problems with regard to the capacity of the output channel and the limitation of the internal buffer sizes, in order to apply join operation to input tuples efficiently in a correct manner. However, the implementation has not necessarily clarified in detail yet in their paper. In this paper, to solve the issues, we propose the merging network and the admission controller. Then we evaluate the architecture in terms of the hardware resource usage, the maximum clock frequency, and the operation performance.",
keywords = "acceleration, FPGA, handshake join, stream join, window join",
author = "Yasin Oge and Takefumi Miyoshi and Hideyuki Kawashima and Tsutomu Yoshinaga",
year = "2011",
month = "12",
day = "1",
doi = "10.1109/ICNC.2011.22",
language = "English",
isbn = "9780769545691",
pages = "95--104",
booktitle = "Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011",

}

TY - GEN

T1 - An implementation of handshake join on FPGA

AU - Oge, Yasin

AU - Miyoshi, Takefumi

AU - Kawashima, Hideyuki

AU - Yoshinaga, Tsutomu

PY - 2011/12/1

Y1 - 2011/12/1

N2 - This paper shows an implementation of handshake join on field-programmable gate array (FPGA). Handshake join is one of stream join algorithms, proposed by Teubner and Mueller. It can support very high degrees of parallelism and attain unprecedented success in throughput speed in order to achieve efficient support for window-based join in streaming databases. In handshake join, it is necessary to take into account the problems with regard to the capacity of the output channel and the limitation of the internal buffer sizes, in order to apply join operation to input tuples efficiently in a correct manner. However, the implementation has not necessarily clarified in detail yet in their paper. In this paper, to solve the issues, we propose the merging network and the admission controller. Then we evaluate the architecture in terms of the hardware resource usage, the maximum clock frequency, and the operation performance.

AB - This paper shows an implementation of handshake join on field-programmable gate array (FPGA). Handshake join is one of stream join algorithms, proposed by Teubner and Mueller. It can support very high degrees of parallelism and attain unprecedented success in throughput speed in order to achieve efficient support for window-based join in streaming databases. In handshake join, it is necessary to take into account the problems with regard to the capacity of the output channel and the limitation of the internal buffer sizes, in order to apply join operation to input tuples efficiently in a correct manner. However, the implementation has not necessarily clarified in detail yet in their paper. In this paper, to solve the issues, we propose the merging network and the admission controller. Then we evaluate the architecture in terms of the hardware resource usage, the maximum clock frequency, and the operation performance.

KW - acceleration

KW - FPGA

KW - handshake join

KW - stream join

KW - window join

UR - http://www.scopus.com/inward/record.url?scp=84856865355&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84856865355&partnerID=8YFLogxK

U2 - 10.1109/ICNC.2011.22

DO - 10.1109/ICNC.2011.22

M3 - Conference contribution

AN - SCOPUS:84856865355

SN - 9780769545691

SP - 95

EP - 104

BT - Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011

ER -