2018 IEEE International Conference on Big Data (Big Data) 2018
DOI: 10.1109/bigdata.2018.8621979
|View full text |Cite
|
Sign up to set email alerts
|

Parallel Sampling-Pipeline for Indefinite Stream of Heterogeneous Graphs using OpenCL for FPGAs

Abstract: In the field of data science, a huge amount of data, generally represented as graphs, needs to be processed and analyzed. It is of utmost importance that this data be processed swiftly and efficiently to save time and energy. The volume and velocity of data, along with irregular access patterns in graph data structures, pose challenges in terms of analysis and processing. Further, a big chunk of time and energy is spent on analyzing these graphs on large compute clusters and/or data-centers. Filtering and refi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 30 publications
0
2
0
Order By: Relevance
“…Operator SP [16,17,21,65,75,87,114,115,146]; BFS [47,76,123,126]; MM [12]; PR [147]; Cent. [53] XML Parser [35,59,108]; Filter [27]; XPath [42,88,89]; Twig [90] Insert [78]; Hash [80] Binary representation HP [148]; VP [28]; IS [33]; CSR [7]; HWM [60,86]; Other [110,116,127,128,135] Hash table [18,61,121,140]; Socket [124]; Near-data [120];…”
Section: Graph Document Key-value Nrds -Functionalmentioning
confidence: 99%
See 1 more Smart Citation
“…Operator SP [16,17,21,65,75,87,114,115,146]; BFS [47,76,123,126]; MM [12]; PR [147]; Cent. [53] XML Parser [35,59,108]; Filter [27]; XPath [42,88,89]; Twig [90] Insert [78]; Hash [80] Binary representation HP [148]; VP [28]; IS [33]; CSR [7]; HWM [60,86]; Other [110,116,127,128,135] Hash table [18,61,121,140]; Socket [124]; Near-data [120];…”
Section: Graph Document Key-value Nrds -Functionalmentioning
confidence: 99%
“…The graph is compressed and streamed which results in a high effective bandwidth. When the application permits graph sampling, the data volume and irregular memory access can be tamed with a data structure derived from CSR [116]. The novel data structure allows storing multiple graphs and removal of vertices and edges with a second pointer array.…”
Section: Memory Accessmentioning
confidence: 99%