Yuliang Sun
ABSTRACT
Frequent item counting is one of the most important operations in time series data mining algorithms, and the space saving algorithm is a widely used approach to solving this problem. With the rapid rising of data input speeds, the most challenging problem in frequent item counting is to meet the requirement of wire-speed processing. In this paper, we propose a streaming oriented PE-ring framework on FPGA for counting frequent items. Compared with the best existing FPGA implementation, our basic PE-ring framework saves 50% lookup table resources cost and achieves the same throughput in a more scalable way. Furthermore, we adopt SIMD-like cascaded filter for further performance improvements, which outperforms the previous work by up to 3.24 times in some data distributions.
- Liu, J., Pan, Y., Wang, K., et al. Mining frequent item sets by opportunistic projection. Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 2002: 229--238. Google Scholar
Digital Library
- Beil, F., Ester, M., Xu, X. Frequent term-based text clustering. Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 2002: 436--442. Google ScholarDigital Library
- Cormode, G., Hadjieleftheriou, M. Finding frequent items in data streams. Proceedings of the VLDB Endowment, 2008, 1(2): 1530--1541. Google ScholarDigital Library
- Chakrabarti, A., Cormode, G., McGregor, A. A near-optimal algorithm for computing the entropy of a stream. Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, 2007: 328--335. Google ScholarDigital Library
- Roy, P., Teubner, J., Alonso, G. Efficient frequent item counting in multi-core hardware Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 2012: 1451--1459. Google ScholarDigital Library
- Teubner, J., Muller, R., Alonso, G. Frequent item computation on a chip. Knowledge and Data Engineering, IEEE Transactions on, 2011, 23(8): 1169--1181. Google ScholarDigital Library
- Metwally, A., Agrawal, D., Abbadi, A. E. An integrated efficient solution for computing frequent and top-k elements in data streams. ACM Transactions on Database Systems (TODS), 2006, 31(3): 1095--1133. Google ScholarDigital Library
- Wang, Z., Huang, S., Wang, L., et al. Accelerating subsequence similarity search based on dynamic time warping distance with FPGA. Proceedings of the ACM/SIGDA international symposium on Field programmable gate arrays. ACM, 2013: 53--62. Google ScholarDigital Library
- Montemurro, M. A. Beyond the Zipf-Mandelbrot law in quantitative linguistics. Physica A: Statistical Mechanics and its Applications, 2001, 300(3): 567--578.Google ScholarCross Ref
- Gabaix, X. Zipf's Law and the Growth of Cities. The American Economic Review, 1999, 89(2): 129--132.Google ScholarCross Ref
Index Terms
- Accelerating frequent item counting with FPGA
Recommendations
Efficient and Versatile FPGA Acceleration of Support Counting for Stream Mining of Sequences and Frequent Itemsets
Stream processing has become extremely popular for analyzing huge volumes of data for a variety of applications, including IoT, social networks, retail, and software logs analysis. Streams of data are produced continuously and are mined to extract ...
An FPGA implementation for neural networks with the FDFM processor core approach
This paper presents a field programmable gate array FPGA implementation of a three-layer perceptron using the few DSP blocks and few block RAMs FDFM approach implemented in the Xilinx Virtex-6 family FPGA. In the FDFM approach, multiple processor cores ...
Application-Specific FPGA using heterogeneous logic blocks
This work presents a new automatic mechanism to explore the solution space between Field Programmable Gate Arrays (FPGAs) and Application-Specific Integrated Circuits (ASICs). This new solution is termed as an Application-Specific Inflexible FPGA (ASIF) ...
Comments