A faster parallel algorithm and efficient multithreaded implementations for evaluating betweenness centrality on massive datasets
We present a new lock-free parallel algorithm for computing betweenness centrality of
massive complex networks that achieves better spatial locality compared with previous …
massive complex networks that achieves better spatial locality compared with previous …
Design of the GraphBLAS API for C
The purpose of the GraphBLAS Forum is to standardize linear-algebraic building blocks for
graph computations. An important part of this standardization effort is to translate the …
graph computations. An important part of this standardization effort is to translate the …
Static graph challenge: Subgraph isomorphism
S Samsi, V Gadepally, M Hurley… - 2017 IEEE High …, 2017 - ieeexplore.ieee.org
The rise of graph analytic systems has created a need for ways to measure and compare the
capabilities of these systems. Graph analytics present unique scalability difficulties. The …
capabilities of these systems. Graph analytics present unique scalability difficulties. The …
High-performance graph algorithms from parallel sparse matrices
Large-scale computation on graphs and other discrete structures is becoming increasingly
important in many applications, including computational biology, web search, and …
important in many applications, including computational biology, web search, and …
Dynamic distributed dimensional data model (D4M) database and computation system
A crucial element of large web companies is their ability to collect and analyze massive
amounts of data. Tuple store databases are a key enabling technology employed by many of …
amounts of data. Tuple store databases are a key enabling technology employed by many of …
Sparse deep neural network graph challenge
The MIT/IEEE/Amazon GraphChallenge. org encourages community approaches to
developing new solutions for analyzing graphs and sparse data. Sparse AI analytics present …
developing new solutions for analyzing graphs and sparse data. Sparse AI analytics present …
LaraDB: A minimalist kernel for linear and relational algebra computation
Analytics tasks manipulate structured data with variants of relational algebra (RA) and
quantitative data with variants of linear algebra (LA). The two computational models have …
quantitative data with variants of linear algebra (LA). The two computational models have …
Achieving 100,000,000 database inserts per second using Accumulo and D4M
The Apache Accumulo database is an open source relaxed consistency database that is
widely used for government applications. Accumulo is designed to deliver high performance …
widely used for government applications. Accumulo is designed to deliver high performance …
Exploiting concurrent kernel execution on graphic processing units
L Wang, M Huang, T El-Ghazawi - … International Conference on …, 2011 - ieeexplore.ieee.org
Graphics processing units (CPUs) have been accepted as a powerful and viable
coprocessor solution in high-performance computing domain. In order to maximize the …
coprocessor solution in high-performance computing domain. In order to maximize the …