Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up

High-Performance Streaming Graph Analytics on GPUs

License

NotificationsYou must be signed in to change notification settings

NicolaDes/hornetsnest

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

The repository provides the graph algorithms implemented on top Hornetdata structure.

For additional information concerning the data structure and its APIs pleaserefer toHornet repository.

Getting Started

The document is organized as follows:

Requirements

  • Nvidia Modern GPU(compute capability ≥ 3.0): Kerpler, Maxwell, Pascal, Volta architectures.
  • CUDA toolkit 9 or greater.
  • GCC orClang host compiler with support for C++14.Note: the compiler must be compatible with the related CUDA toolkit version.For more information seeCUDA Installation Guide.
  • CMake v3.6 or greater.
  • 64-bit Operating System (Ubuntu 16.04 or above suggested).

Quick Start

The following basic steps are required to build and execute the Hornetalgorithms:

git clone --recursive https://github.com/hornet-gt/hornetsnestcd hornetsnest/buildcmake ..make p

By default, the CUDA compilernvcc usesgcc/g++ found in the currentexecution search path as host compiler(cc --version to get the default compiler on the actual system).To force a different host compiler for compiling C++ files (*.cpp)you need to set the following environment variables:

CC=<path_to_host_C_compiler>CXX=<path_to_host_C++_compiler>

To force a different host compiler for compiling host side code (*.cu)substitutecmake .. with

cmake -DCUDAHC=<path_to_host_C++_compiler> ..

Note: host.cpp compiler and host side.cu compiler may be different.The host side compiler must be compatible with the current CUDA Toolkitversion installed on the system(seeCUDA Installation Guide).

Hornet Algorithms

AlgorithmStaticDynamic
(BFS) Breadth-first Searchyeson-going
(SSSP) Single-Source Shortest Pathyeson-going
(CC) Connected Componentsyeson-going
(SCC) Strongly Connected Componentsto-doto-do
(MST) Minimum Spanning Treeto-doto-do
(BC) Betweeness Centralityon-goingon-going
(PG) Page Rankyeson-going
(TC) Triangle Countingyesyes
(KC) Katz Centralityyesyes
(MIS) Maximal Independent Seton-goingto-do
(MF) Maximum Flowto-doto-do
(CC) Clustering Coeffientto-doto-do
(ST) St-Connectivityto-doto-do
(TC) Transitive Closureto-doto-do
Community Detectionto-doto-do
Temporal Motif Findingon-goingto-do
Sparse Vector-Matrix Multiplicationyesto-do
Jaccard indicesto-doto-do
Energy/Parity Gameon-goingto-do

Performance

CPU vs. GPU
AlgorithmCPU1GPU2Speedup
(BFS) Breadth-first Search
(SSSP) Single-Source Shortest Path
(CC) Connected Components
(MST) Minimum Spanning Tree
(BC) Betweenness Centrality
(PG) Page Rank
(TC) Triangle Counting
(KC) Katz Centrality

1 Intel ...
2 NVidia Tesla P100 ..

Static vs. Dynamic
AlgorithmStaticDynamicSpeedup
(BFS) Breadth-first Search
(SSSP) Single-Source Shortest Path
(CC) Connected Components
(MST) Minimum Spanning Tree
(BC) Betweenness Centrality
(PG) Page Rank
(TC) Triangle Counting
(KC) Katz Centrality

Hornet Algorithms Lines of Code

AlgorithmStatic (A)Static (B)Dynamic (A)
(BFS) Breadth-first Search46
(SSSP) Single-Source Shortest Path
(CC) Connected Components
(MST) Minimum Spanning Tree
(BC) Betweenness Centrality
(PG) Page Rank
(TC) Triangle Counting
(KC) Katz Centrality

(A) lines of code required for the algorithm
(B) lines of code required for the operators

Code Documentation

The code documentation is located in thedocs directory of Hornet datastructure directory (doxygen html format).The documentation is also accessible onlinehere.

Reporting bugs and contributing

If you find any bugs please report them by using the repository (githubissues panel).We are also ready to engage in improving and extending the framework if you request new features.

Publications

  • Oded Green, David A. Bader,"cuSTINGER: Supporting dynamic graph algorithmsfor GPUs",IEEE High Performance Extreme Computing Conference (HPEC), 13-15 September,2016, Waltham, MA, USA, pp. 1-6.link
  • Oded Green, James Fox, Euna Kim, Federico Busato, Nicola Bombieri,Kartik Lakhotia, Shijie Zhou, Shreyas Singapura, Hanqing Zeng,Rajgopal Kannan, Viktor Prasanna, David A. Bader,"Quickly Finding a Truss in a Haystack",IEEE/Amazon/DARPA Graph Challenge, *Innovation Awards*.
  • Devavret Makkar, David A. Bader, Oded Green,Exact and Parallel Triangle Counting in Streaming Graphs,IEEE Conference on High Performance Computing, Data, and Analytics (HiPC),18-21 December 2017, Jaipur, India, pp. 1-10.

If you find this software useful in academic work, please acknowledge Hornet.


Hornet Developers

Data Structure
  • Federico Busato, Ph.D. Student, University of Verona (Italy)
  • Oded Green, Researcher, Georgia Institute of Technology
Algorithms
  • Federico Busato, Ph.D. Student, University of Verona (Italy)
  • Oded Green, Researcher, Georgia Institute of Technology
  • James Fox, Ph.D. Student, Georgia Institute of Technology :Maximal Independent Set,Temporal Motif Finding
  • Devavret Makkar, Ph.D. Student, Georgia Institute of Technology :Triangle Counting
  • Elisabetta Bergamini, Ph.D. Student, Karlsruhe Institute of Technology (Germany) :Katz Centrality
  • Euna Kim, Ph.D. Student, Georgia Institute of Technology :Dynamic PageRank
  • ...

Acknowledgements

  • Grant...

License

BSD 3-Clause License

Copyright (c) 2017, HornetAll rights reserved.

Redistribution and use in source and binary forms, with or withoutmodification, are permitted provided that the following conditions are met:

  • Redistributions of source code must retain the above copyright notice, thislist of conditions and the following disclaimer.

  • Redistributions in binary form must reproduce the above copyright notice,this list of conditions and the following disclaimer in the documentationand/or other materials provided with the distribution.

  • Neither the name of the copyright holder nor the names of itscontributors may be used to endorse or promote products derived fromthis software without specific prior written permission.

THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THEIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE AREDISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLEFOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIALDAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS ORSERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVERCAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USEOF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

About

High-Performance Streaming Graph Analytics on GPUs

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • Cuda92.0%
  • C++4.2%
  • Python2.8%
  • Other1.0%

[8]ページ先頭

©2009-2025 Movatter.jp