Skip to main navigation
Skip to search
Skip to main content
Illinois Experts Home
LOGIN & Help
Home
Profiles
Research units
Research & Scholarship
Datasets
Honors
Press/Media
Activities
Search by expertise, name or affiliation
PARSEC: PARallel Subgraph Enumeration in CUDA
Vibhor Dodeja
, Mohammad Almasri
,
Rakesh Nagi
, Jinjun Xiong
,
Wen Mei Hwu
Industrial and Enterprise Systems Engineering
Electrical and Computer Engineering
Coordinated Science Lab
Information Trust Institute
Siebel School of Computing and Data Science
Research output
:
Chapter in Book/Report/Conference proceeding
›
Conference contribution
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'PARSEC: PARallel Subgraph Enumeration in CUDA'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
CUD A
100%
Subgraph Enumeration
100%
Depth-first Traversal
100%
Memory Requirements
66%
Breadth-first Search
66%
Search Tree
66%
Parallel Solution
66%
NP-complete
33%
Efficient Implementation
33%
High Efficiency
33%
Parallelization
33%
Fine-grained Parallelism
33%
Problem Size
33%
Memory Capacity
33%
GPU-based
33%
Geometric Mean
33%
Large Graphs
33%
Top Level
33%
Parallel Execution
33%
Distributed Environment
33%
Fully Parallel
33%
Data Graph
33%
Graph Analytics
33%
Depth-first
33%
GPU-based Parallel
33%
Computer Science
Subgraphs
100%
Graphics Processing Unit
100%
Memory Requirement
22%
Tree Search
22%
Parallel Solution
22%
Efficient Implementation
11%
Parallelism
11%
Memory Capacity
11%
Grained Parallelism
11%
Execution Resource
11%
Parallel Execution
11%
Memory Resource
11%
Distributed Environment
11%
Compute Resource
11%
Graph Analytics
11%