2018
DOI: 10.1145/3128571
|View full text |Cite
|
Sign up to set email alerts
|

Graph Processing on GPUs

Abstract: In the big data era, much real-world data can be naturally represented as graphs. Consequently, many application domains can be modeled as graph processing. Graph processing, especially the processing of the large-scale graphs with the number of vertices and edges in the order of billions or even hundreds of billions, has attracted much attention in both industry and academia. It still remains a great challenge to process such large-scale graphs. Researchers have been seeking for new possible solutions. Becaus… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
43
0
1

Year Published

2018
2018
2024
2024

Publication Types

Select...
7
1
1

Relationship

2
7

Authors

Journals

citations
Cited by 113 publications
(44 citation statements)
references
References 78 publications
0
43
0
1
Order By: Relevance
“…The movement library achieves the purpose of robotic simulation learning. In order to build a robotic action library, this chapter studies the robot's motion simulation [18].…”
Section: Our Proposed Position Optimization Of Badminton Doublesmentioning
confidence: 99%
“…The movement library achieves the purpose of robotic simulation learning. In order to build a robotic action library, this chapter studies the robot's motion simulation [18].…”
Section: Our Proposed Position Optimization Of Badminton Doublesmentioning
confidence: 99%
“…The Viterbi algorithm, which was proposed by Andrew Viterbi in 1967, is used for deconvolution in a digital communication link to eliminate noise. The algorithm is widely used in CDMA and GSM digital cellular networks, dial-up modem, satellite, deep space communication, and 802.11 wireless network deconvolution codes [17]. Viterbi algorithm is a dynamic programming algorithm for finding the most likely sequence of observation events -the Viterbi path -implicit state sequence, especially in the context of Markov information sources and hidden Markov models [18].…”
Section: Implementation Of Distributed Source Coding Based On Viterbimentioning
confidence: 99%
“…Many graph processing systems have been explored on modern commodity general-purpose processors, e.g., CPUs and GPUs. We briefly introduce the related work to motivate our study, and refer readers to recent surveys for more details [37][38][39] .…”
Section: Brief Introduction To Graph Processing On Modern Commodity Pmentioning
confidence: 99%