Scalable graph processing frameworks: A taxonomy and open challenges
The world is becoming a more conjunct place and the number of data sources such as
social networks, online transactions, web search engines, and mobile devices is increasing …
social networks, online transactions, web search engines, and mobile devices is increasing …
[图书][B] Networks, crowds, and markets: Reasoning about a highly connected world
D Easley, J Kleinberg - 2010 - academic.oup.com
The moment when the hyperconnectedness of our world became most evident to me was on
October 20th, 2011, when images of the death of Colonel Muammar el-Qaddafi, the former …
October 20th, 2011, when images of the death of Colonel Muammar el-Qaddafi, the former …
Direction‐optimizing breadth‐first search
Breadth‐First Search is an important kernel used by many graph‐processing applications. In
many of these emerging applications of BFS, such as analyzing social networks, the input …
many of these emerging applications of BFS, such as analyzing social networks, the input …
CuSha: vertex-centric graph processing on GPUs
Vertex-centric graph processing is employed by many popular algorithms (eg, PageRank)
due to its simplicity and efficient use of asynchronous parallelism. The high compute power …
due to its simplicity and efficient use of asynchronous parallelism. The high compute power …
The Combinatorial BLAS: Design, implementation, and applications
A Buluç, JR Gilbert - The International Journal of High …, 2011 - journals.sagepub.com
This paper presents a scalable high-performance software library to be used for graph
analysis and data mining. Large combinatorial graphs appear in many applications of high …
analysis and data mining. Large combinatorial graphs appear in many applications of high …
Accelerating CUDA graph algorithms at maximum warp
S Hong, SK Kim, T Oguntebi, K Olukotun - Acm Sigplan Notices, 2011 - dl.acm.org
Graphs are powerful data representations favored in many computational domains. Modern
GPUs have recently shown promising results in accelerating computationally challenging …
GPUs have recently shown promising results in accelerating computationally challenging …
Green-Marl: a DSL for easy and efficient graph analysis
The increasing importance of graph-data based applications is fueling the need for highly
efficient and parallel implementations of graph analysis software. In this paper we describe …
efficient and parallel implementations of graph analysis software. In this paper we describe …
Medusa: Simplified graph processing on GPUs
Graphs are common data structures for many applications, and efficient graph processing is
a must for application performance. Recently, the graphics processing unit (GPU) has been …
a must for application performance. Recently, the graphics processing unit (GPU) has been …
Efficient parallel graph exploration on multi-core CPU and GPU
S Hong, T Oguntebi, K Olukotun - … International Conference on …, 2011 - ieeexplore.ieee.org
Graphs are a fundamental data representation that has been used extensively in various
domains. In graph-based applications, a systematic exploration of the graph such as a …
domains. In graph-based applications, a systematic exploration of the graph such as a …
Multithreaded asynchronous graph traversal for in-memory and semi-external memory
Processing large graphs is becoming increasingly important for many domains such as
social networks, bioinformatics, etc. Unfortunately, many algorithms and implementations do …
social networks, bioinformatics, etc. Unfortunately, many algorithms and implementations do …