On the public citation graph
Traversing Trillions of Edges in Real Time: Graph Exploration on Large-Scale Parallel Machines
0 signed · 102 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-46117-5_94openalex-snapshot
HAGAR: Efficient Multi-context Graph Processors
inferredcites →https://doi.org/10.1007/978-3-540-68405-3_17openalex-snapshot
A Simple Path Non-existence Algorithm Using C-Obstacle Query
inferredcites →https://doi.org/10.1007/978-3-540-77220-0_21openalex-snapshot
Accelerating Large Graph Algorithms on the GPU Using CUDA
inferredcites →https://doi.org/10.1016/j.jpdc.2005.12.004openalex-snapshot
Designing irregular parallel algorithms with mutual exclusion and lock-free protocols
inferredcites →https://doi.org/10.1103/physreve.69.026113openalex-snapshot
Finding and evaluating community structure in networks
inferredcites →https://doi.org/10.1109/fccm.2006.45openalex-snapshot
GraphStep: A System Architecture for Sparse-Graph Algorithms
inferredcites →https://doi.org/10.1109/icdm.2011.23openalex-snapshot
An In-depth Study of Stochastic Kronecker Graphs
inferredcites →https://doi.org/10.1109/icpp.2005.55openalex-snapshot
On the Architectural Requirements for Efficient Execution of Graph Algorithms
inferredcites →https://doi.org/10.1109/ipdps.2008.4536313openalex-snapshot
On the representation and multiplication of hypersparse matrices
inferredcites →https://doi.org/10.1109/ipdps.2009.5161108openalex-snapshot
Early experiences with large-scale Cray XMT systems
inferredcites →https://doi.org/10.1109/ipdps.2013.72openalex-snapshot
Scaling Techniques for Massive Scale-Free Graphs in Distributed (External) Memory
inferredcites →https://doi.org/10.1109/ipdpsw.2012.204openalex-snapshot
An Early Evaluation of the Scalability of Graph Algorithms on the Intel MIC Architecture
inferredcites →https://doi.org/10.1109/pact.2011.14openalex-snapshot
Efficient Parallel Graph Exploration on Multi-Core CPU and GPU
inferredcites →https://doi.org/10.1109/sc.2005.4openalex-snapshot
A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L
inferredcites →https://doi.org/10.1109/sc.2010.26openalex-snapshot
Fast PGAS Implementation of Distributed Graph Algorithms
inferredcites →https://doi.org/10.1109/sc.2010.46openalex-snapshot
Scalable Graph Exploration on Multicore Processors
inferredcites →https://doi.org/10.1109/sc.2012.25openalex-snapshot
Breaking the speed and scalability Barriers for Graph exploration on distributed-memory machines
inferredcites →https://doi.org/10.1109/sc.2012.50openalex-snapshot
Direction-optimizing Breadth-First Search
inferredcites →https://doi.org/10.1109/vr.2007.352468openalex-snapshot
Real-time Path Planning for Virtual Agents in Dynamic Environments
inferredcites →https://doi.org/10.1137/1.9781611972740.43openalex-snapshot
R-MAT: A Recursive Model for Graph Mining
inferredcites →https://doi.org/10.1145/1837274.1837289openalex-snapshot
An effective GPU implementation of breadth-first search
inferredcites →https://doi.org/10.1145/2063384.2063471openalex-snapshot
Parallel breadth-first search on distributed memory systems
inferredcites →https://doi.org/10.1145/78973.78977openalex-snapshot
Skip lists: a probabilistic alternative to balanced trees
inferredcites →https://doi.org/10.2172/919217openalex-snapshot
Distributed Breadth-First Search with 2-D Partitioning
inferredcites →https://doi.org/10.48550/arxiv.0812.4905openalex-snapshot
Kronecker Graphs: An Approach to Modeling Networks
inferredcites →https://doi.org/10.5555/1756006.1756039openalex-snapshot
Kronecker Graphs: An Approach to Modeling Networks
inferredcites →https://doi.org/10.5555/2388996.2389015openalex-snapshot
Large-scale energy-efficient graph traversal: a path to efficient data-intensive supercomputing
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-05051-1_8openalex-snapshot
PruX: Communication Pruning of Parallel BFS in the Graph 500 Benchmark
inferred← citeshttps://doi.org/10.1007/978-3-030-05054-2_9openalex-snapshot
A Low Communication Overhead Breadth-First Search Based on Global Bitmap
inferred← citeshttps://doi.org/10.1007/978-3-030-78713-4_16openalex-snapshot
iPUG: Accelerating Breadth-First Graph Traversals Using Manycore Graphcore IPUs
inferred← citeshttps://doi.org/10.1007/978-3-319-42432-3_33openalex-snapshot
Advanced Computing and Optimization Infrastructure for Extremely Large-Scale Graphs on Post Peta-Scale Supercomputers
inferred← citeshttps://doi.org/10.1007/978-3-319-61982-8_12openalex-snapshot
On the Acceleration of Graph500: Characterizing PCIe Overheads with Multi-GPUs
inferred← citeshttps://doi.org/10.1007/s11280-018-0611-0openalex-snapshot
GStar: an efficient framework for answering top-k star queries on billion-node knowledge graphs
inferred← citeshttps://doi.org/10.1007/s41019-016-0024-yopenalex-snapshot
Efficient Breadth-First Search on Massively Parallel and Distributed-Memory Machines
inferred← citeshttps://doi.org/10.1016/j.future.2018.07.010openalex-snapshot
A highly cost-effective task scheduling strategy for very large graph computation
inferred← citeshttps://doi.org/10.1016/j.jpdc.2016.02.003openalex-snapshot
Modeling, analysis, and experimental comparison of streaming graph-partitioning policies
inferred← citeshttps://doi.org/10.1016/j.osn.2018.12.002openalex-snapshot
Scaling up scheduling in SnF OCS networks – An adjacency list based solution
inferred← citeshttps://doi.org/10.1038/s41598-024-74545-8openalex-snapshot
Speed prediction and nearby road impact analysis using machine learning and ensemble of explainable AI techniques
inferred← citeshttps://doi.org/10.1063/1.5129306openalex-snapshot
The building blocks of a brain-inspired computer
inferred← citeshttps://doi.org/10.1109/access.2024.3417352openalex-snapshot
Optimising Queries for Pattern Detection Over Large Scale Temporally Evolving Graphs
inferred← citeshttps://doi.org/10.1109/bigdata.2014.7004254openalex-snapshot
Efficient breadth-first search on a heterogeneous processor
inferred← citeshttps://doi.org/10.1109/bigdata.2016.7840624openalex-snapshot
Evaluating the impacts of code-level performance tunings on power efficiency
inferred← citeshttps://doi.org/10.1109/bigdata.2016.7840705openalex-snapshot
Extreme scale breadth-first search on supercomputers
inferred← citeshttps://doi.org/10.1109/bigdatacongress.2017.64openalex-snapshot
A Resilient Index Graph for Querying Large Biological Scientific Data
inferred← citeshttps://doi.org/10.1109/cluster52292.2023.00024openalex-snapshot
Communication-Avoiding Recursive Aggregation
inferred← citeshttps://doi.org/10.1109/hipc.2019.00015openalex-snapshot
Optimizing Breadth-First Search at Scale Using Hardware-Accelerated Space Consistency
inferred← citeshttps://doi.org/10.1109/hipc53243.2021.00030openalex-snapshot
iPUG for Multiple Graphcore IPUs: Optimizing Performance and Scalability of Parallel Breadth-First Search
inferred← citeshttps://doi.org/10.1109/hoti.2016.025openalex-snapshot
Exploring Data Vortex Network Architectures
inferred← citeshttps://doi.org/10.1109/hpcc/smartcity/dss.2018.00038openalex-snapshot
Merge-Based Parallel Sparse Matrix-Sparse Vector Multiplication with a Vector Architecture
inferred← citeshttps://doi.org/10.1109/hpcsim.2015.7237065openalex-snapshot
Fast and scalable NUMA-based thread parallel breadth-first search
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00199openalex-snapshot
XTree: Traversal-Based Partitioning for Extreme-Scale Graph Processing on Supercomputers
inferred← citeshttps://doi.org/10.1109/icpp.2017.12openalex-snapshot
Boosting the Efficiency of HPCG and Graph500 with Near-Data Processing
inferred← citeshttps://doi.org/10.1109/ipdps.2015.54openalex-snapshot
High-Performance Graph Analytics on Manycore Processors
inferred← citeshttps://doi.org/10.1109/ipdps.2015.59openalex-snapshot
Scalable Community Detection with the Louvain Algorithm
inferred← citeshttps://doi.org/10.1109/ipdps.2016.93openalex-snapshot
A Case Study of Complex Graph Analysis in Distributed Memory: Implementation and Optimization
inferred← citeshttps://doi.org/10.1109/ipdps.2017.121openalex-snapshot
Exploring DataVortex Systems for Irregular Applications
inferred← citeshttps://doi.org/10.1109/ipdps.2017.53openalex-snapshot
Scalable Graph Traversal on Sunway TaihuLight with Ten Million Cores
inferred← citeshttps://doi.org/10.1109/ipdps.2017.95openalex-snapshot
Partitioning Trillion-Edge Graphs in Minutes
inferred← citeshttps://doi.org/10.1109/ipdpsw.2016.208openalex-snapshot
Jaccard Coefficients as a Potential Graph Benchmark
inferred← citeshttps://doi.org/10.1109/ipdpsw.2017.164openalex-snapshot
Order or Shuffle: Empirically Evaluating Vertex Order Impact on Parallel Graph Computations
inferred← citeshttps://doi.org/10.1109/ipdpsw.2017.48openalex-snapshot
Breadth-First Search with A Multi-Core Computer
inferred← citeshttps://doi.org/10.1109/ipdrm49579.2019.00006openalex-snapshot
Advert: An Asynchronous Runtime for Fine-Grained Network Systems
inferred← citeshttps://doi.org/10.1109/ispa-bdcloud-socialcom-sustaincom57177.2022.00069openalex-snapshot
GreenBFS: Space-Efficient BFS Engine for Power-aware Graph Processing
inferred← citeshttps://doi.org/10.1109/ithings-greencom-cpscom-smartdata.2016.159openalex-snapshot
The Communication Analysis of Implementation in Breadth First Search Algorithm
inferred← citeshttps://doi.org/10.1109/mascots.2015.13openalex-snapshot
InterSense: Interconnect Performance Emulator for Future Scale-out Distributed Memory Applications
inferred← citeshttps://doi.org/10.1109/mc.2015.228openalex-snapshot
Optimizing Sparse Linear Algebra for Large-Scale Graph Analytics
inferred← citeshttps://doi.org/10.1109/mm.2014.77openalex-snapshot
A Throughput-Optimized Optical Network for Data-Intensive Computing
inferred← citeshttps://doi.org/10.1109/padsw.2014.7097785openalex-snapshot
A distributed approach for top-k star queries on massive information networks
inferred← citeshttps://doi.org/10.1109/pccc.2016.7820645openalex-snapshot
High performance computing on SpiNNaker neuromorphic platform: A case study for energy efficient image processing
inferred← citeshttps://doi.org/10.1109/sc.2016.70openalex-snapshot
G-Store: High-Performance Graph Store for Trillion-Edge Processing
inferred← citeshttps://doi.org/10.1109/sc.2018.00059openalex-snapshot
ShenTu: Processing Multi-Trillion Edge Graphs on Millions of Cores in Seconds
inferred← citeshttps://doi.org/10.1109/sc41404.2022.00024openalex-snapshot
Scaling Graph 500 SSSP to 140 Trillion Edges with over 40 Million Cores
inferred← citeshttps://doi.org/10.1109/tc.2021.3086069openalex-snapshot
VMT: Virtualized Multi-Threading for Accelerating Graph Workloads on Commodity Processors
inferred← citeshttps://doi.org/10.1109/tmscs.2018.2797195openalex-snapshot
Multilevel Parallelism for the Exploration of Large-Scale Graphs
inferred← citeshttps://doi.org/10.1109/tpds.2015.2475270openalex-snapshot
Parallel Distributed Breadth First Search on the Kepler Architecture
inferred← citeshttps://doi.org/10.1109/tpds.2016.2634535openalex-snapshot
Scalable Single Source Shortest Path Algorithms for Massively Parallel Systems
inferred← citeshttps://doi.org/10.1109/tpds.2020.3002150openalex-snapshot
Scalable, Multi-Constraint, Complex-Objective Graph Partitioning
inferred← citeshttps://doi.org/10.1109/tpds.2021.3100785openalex-snapshot
TianheGraph: Customizing Graph Search for Graph500 on Tianhe Supercomputer
inferred← citeshttps://doi.org/10.1109/tpds.2026.3681468openalex-snapshot
TianheWare: Degree-Aware Sampling for Large-Scale Graph Learning
inferred← citeshttps://doi.org/10.1145/2717511openalex-snapshot
High-Performance and Scalable GPU Graph Traversal
inferred← citeshttps://doi.org/10.1145/2742854.2742887openalex-snapshot
Enhanced GPU-based distributed breadth first search
inferred← citeshttps://doi.org/10.1145/2807591.2807661openalex-snapshot
Exploring network optimizations for large-scale graph analytics
inferred← citeshttps://doi.org/10.1145/2851553.2851574openalex-snapshot
Interconnect Emulator for Aiding Performance Analysis of Distributed Memory Applications
inferred← citeshttps://doi.org/10.1145/3503221.3508403openalex-snapshot
Scaling graph traversal to 281 trillion edges with 40 million cores
inferred← citeshttps://doi.org/10.1145/3581783.3613828openalex-snapshot
GraphMedia: Communication-balanced Graph Searching for Billion-scale Social Media Access
inferred← citeshttps://doi.org/10.1145/3673038.3673129openalex-snapshot
SuperCSR: A Space-Time-Efficient CSR Representation for Large-scale Graph Applications on Supercomputers
inferred← citeshttps://doi.org/10.1145/3689341openalex-snapshot
GraphService: Topology-aware Constructor for Large-scale Graph Applications
inferred← citeshttps://doi.org/10.1145/3696410.3714833openalex-snapshot
GraphCSR: A Space and Time-Efficient Sparse Matrix Representation for Web-scale Graph Processing
inferred← citeshttps://doi.org/10.1145/3712285.3759872openalex-snapshot
Wasp: Efficient Asynchronous Single-Source Shortest Path on Multicore Systems via Work Stealing
inferred← citeshttps://doi.org/10.1145/3750450openalex-snapshot
TianheGraph: Topology-aware Graph Processing
inferred← citeshttps://doi.org/10.1145/3797905.3800549openalex-snapshot
CORE-BFS: Communication-Optimized REctangular-partitioned BFS Achieving 160.845 TeraTEPS on Frontier Supercomputer
inferred← citeshttps://doi.org/10.14778/3749646.3749691openalex-snapshot
GraphCSR: A Degree-Equalized CSR Format for Large-Scale Graph Processing
inferred← citeshttps://doi.org/10.23919/date.2019.8715024openalex-snapshot
A Brief Survey of Algorithms, Architectures, and Challenges toward Extreme-scale Graph Analytics
inferred← citeshttps://doi.org/10.35335/ijobas.v8i4.47openalex-snapshot
Design of a Decision Support System for Performance Appraisal of Civil Servants with a Fuzzy Multi Attribute Decision Making Model
inferred← citeshttps://doi.org/10.48550/arxiv.1408.1605openalex-snapshot
Parallel Distributed Breadth First Search on the Kepler Architecture
inferred← citeshttps://doi.org/10.48550/arxiv.1507.06702openalex-snapshot
The Anatomy of Large-Scale Distributed Graph Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1701.00503openalex-snapshot
Distributed Graph Layout for Scalable Small-world Network Analysis
inferred← citeshttps://doi.org/10.48550/arxiv.1912.08950openalex-snapshot
Slim Graph: Practical Lossy Graph Compression for Approximate Graph Processing, Storage, and Analytics
inferred← citeshttps://doi.org/10.48550/arxiv.2102.01254openalex-snapshot
Customizing Graph500 for Tianhe Pre-exacale system
inferred← citeshttps://doi.org/10.5555/3014904.3014999openalex-snapshot
G-store: high-performance graph store for trillion-edge processing
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.