A Cloud-Based Parallel Space-Saving Algorithm for Big Networking Data
As the network continues to evolve, completely analyzing the traffic requires immeasurable resources. In situations of processing enormous streaming data, the most significant k items (Top-k) are more interesting, and some streaming algorithms are deployed due to relatively limited memory and also l...
Main Authors: | Dazhong He, Yang Yang, Jun Liu |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2018-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8438445/ |
Similar Items
-
Data hiding using parallel algorithms
by: niaghm Saeed
Published: (2012-03-01) -
Exploring Various Levels of Parallelism in High-Performance CRC Algorithms
by: Mucong Chi, et al.
Published: (2019-01-01) -
Parallel Implementation of K-Means Algorithm on FPGA
by: Leonardo A. Dias, et al.
Published: (2020-01-01) -
Glance on Parallelization of FFT Algorithms
by: Farhan Mhnd
Published: (2019-03-01) -
Sliding Window Top-K Monitoring over Distributed Data Streams
by: Ben Chen, et al.
Published: (2017-11-01)