Skip to main navigation
Skip to search
Skip to main content
Illinois Experts Home
LOGIN & Help
Link opens in a new tab
Search content at Illinois Experts
Home
Profiles
Research units
Research & Scholarship
Datasets
Honors
Press/Media
Activities
An Algorithmic Approach to Communication Reduction in Parallel Graph Algorithms
Harshvardhan
, Adam Fidel
,
Nancy Marie Amato
,
Lawrence Rauchwerger
Research output
:
Contribution to journal
›
Conference article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'An Algorithmic Approach to Communication Reduction in Parallel Graph Algorithms'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Algorithmic Approach
100%
Graph Algorithms
100%
Communication Reduction
100%
Parallel Graph Algorithms
100%
Programmer
50%
Redundancy
50%
Parallelization
25%
Large Degree
25%
Absolute Amount
25%
Hierarchical Manner
25%
System Structure
25%
Memory Hierarchy
25%
Distributed Memory System
25%
Hierarchical Approach
25%
Processing Element
25%
Small-world
25%
Non-hierarchical
25%
Scale-free Graphs
25%
Communication Optimization
25%
Graph Mining
25%
World Scale
25%
Graph Analytics
25%
Analytical Algorithm
25%
Hierarchical Graph
25%
Computer Science
Algorithmic Approach
100%
Graph Algorithms
100%
Experimental Result
20%
Parallelism
20%
Hierarchical Manner
20%
Distributed Memory
20%
Memory System
20%
Memory Hierarchy
20%
Processing Element
20%
System Structure
20%
Graph Analytics
20%
Algorithmic Communication
20%