SBIR-STTR Award

Blazegraph GPU: Many Core Accelerated Graph Query and Pattern Matching
Award last edited on: 6/14/2018

Sponsored Program
SBIR
Awarding Agency
DOD : DARPA
Total Award Amount
$1,597,380
Award Phase
2
Solicitation Topic Code
SB152-004
Principal Investigator
Bryan Thompson

Company Information

Blazegraph (AKA: SYSTAP LLC)

4501 Tower Road
Greensboro, NC 27410
   (801) 243-3678
   careers@systap.com
   www.blazegraph.com
Location: Multiple
Congr. District: 13
County: Guilford

Phase I

Contract Number: N/A
Start Date: 00/00/00    Completed: 00/00/00
Phase I year
2014
Phase I Amount
$100,000
Conducting operations and defending the nations critical networks in cyberspace requires processing and analyzing massive quantities of graph data in near-real time. New approaches for high performance graph analytics and query are needed for cyber defense and operations at massive data scales. Scaling graphs is a hard problem. Due to non-locality, CPU-based solutions are limited by main memory bandwidth. GPUs have superior memory bandwidth and offer the potential of a significant increase over multi-core, CPU in-memory (100-1000X) and disk-based (10,000X) approaches. However building analytics for GPUs is challenging due to the complexities of parallel programming and the specialized languages. Phase II will develop a comprehensive software implementation for GPUs that provides 100-10,000X acceleration of common graph programming frameworks for graph-oriented queries (SPARQL). The research will develop ways to model graphs on the GPU and use Sparse Matrix Vector multiplication (SPMV) and Linear Algebra libraries for accelerating graph query. The resulting technology will process billions graph edges in seconds using common graph query languages and frameworks. It will enable existing DARPA programs using graph query to achieve massive data scale. There are significant commercial applications in the areas of network security, drug discovery, regulatory compliance, and social networking/e-commerce.

Phase II

Contract Number: HR0011-16-9-0002
Start Date: 00/00/00    Completed: 00/00/00
Phase II year
2015
Phase II Amount
$1,497,380
Conducting operations and defending the nations critical networks in cyberspace requires processing and analyzing massive quantities of graph data in near-real time. New approaches for high performance graph analytics and query are needed for cyber defense and operations at massive data scales. Scaling graphs is a hard problem. Due to non-locality, CPU-based solutions are limited by main memory bandwidth. GPUs have superior memory bandwidth and offer the potential of a significant increase over multi-core, CPU in-memory (100-1000X) and disk-based (10,000X) approaches. However building analytics for GPUs is challenging due to the complexities of parallel programming and the specialized languages. Phase II will develop a comprehensive software implementation for GPUs that provides 100-10,000X acceleration of common graph programming frameworks for graph-oriented queries (SPARQL). The research will develop ways to model graphs on the GPU and use Sparse Matrix Vector multiplication (SPMV) and Linear Algebra libraries for accelerating graph query. The resulting technology will process billions graph edges in seconds using common graph query languages and frameworks. It will enable existing DARPA programs using graph query to achieve massive data scale. There are significant commercial applications in the areas of network security, drug discovery, regulatory compliance, and social networking/e-commerce.