On the public citation graph
Extreme scale breadth-first search on supercomputers
0 signed · 46 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/11564126_17openalex-snapshot
Realistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication
inferredcites →https://doi.org/10.1007/978-3-319-07518-1_23openalex-snapshot
Fast and Energy-efficient Breadth-First Search on a Single NUMA System
inferredcites →https://doi.org/10.1016/j.ipl.2004.01.014openalex-snapshot
An optimal storage format for sparse matrices
inferredcites →https://doi.org/10.1109/hipc.2013.6799136openalex-snapshot
Parallel distributed breadth first search on GPU
inferredcites →https://doi.org/10.1109/iiswc.2011.6114175openalex-snapshot
Performance characteristics of Graph500 on large-scale distributed environment
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.2014.52openalex-snapshot
Traversing Trillions of Edges in Real Time: Graph Exploration on Large-Scale Parallel Machines
inferredcites →https://doi.org/10.1109/ipdpsw.2013.159openalex-snapshot
Distributed Memory Breadth-First Search Revisited: Enabling Bottom-Up Search
inferredcites →https://doi.org/10.1109/islped.2011.5993668openalex-snapshot
The K computer: Japanese next-generation supercomputer development project
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.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/sc.2012.70openalex-snapshot
Large-scale energy-efficient graph traversal: A path to efficient data-intensive supercomputing
inferredcites →https://doi.org/10.1145/2063384.2063471openalex-snapshot
Parallel breadth-first search on distributed memory systems
inferredcites →https://doi.org/10.1145/2287076.2287104openalex-snapshot
Highly scalable graph search for the Graph500 benchmark
inferredcites →https://doi.org/10.48550/arxiv.1104.4518openalex-snapshot
Parallel Breadth-First Search on Distributed Memory Systems
inferredcites →https://doi.org/10.5555/2016802.2016889openalex-snapshot
The K computer: Japanese next-generation supercomputer development project
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/s11704-021-1004-6openalex-snapshot
Fast and efficient parallel breadth-first search with power-law graph transformation
inferred← citeshttps://doi.org/10.1007/s42514-020-00056-3openalex-snapshot
Scalable and efficient graph traversal on high-throughput cluster
inferred← citeshttps://doi.org/10.1038/s41439-022-00223-8openalex-snapshot
Building cloud computing environments for genome analysis in Japan
inferred← citeshttps://doi.org/10.1109/cluster.2018.00043openalex-snapshot
Computing Exact Vertex Eccentricity on Massive-Scale Distributed Graphs
inferred← citeshttps://doi.org/10.1109/hoti.2019.00013openalex-snapshot
The First Supercomputer with HyperX Topology: A Viable Alternative to Fat-Trees?
inferred← citeshttps://doi.org/10.1109/hpca56546.2023.10071102openalex-snapshot
SGCN: Exploiting Compressed-Sparse Features in Deep Graph Convolutional Network Accelerators
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/icispc51671.2020.00020openalex-snapshot
The Design of Discrete Memory-Accessing Library of Unstructured-grid for Domestic Heterogeneous Many-Core Architecture
inferred← citeshttps://doi.org/10.1109/ipdps.2018.00118openalex-snapshot
Scalable Breadth-First Search on a GPU Cluster
inferred← citeshttps://doi.org/10.1109/ipdpsw50202.2020.00128openalex-snapshot
Implementing an Attack Graph Generator in CUDA
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/sc.2018.00059openalex-snapshot
ShenTu: Processing Multi-Trillion Edge Graphs on Millions of Cores in Seconds
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.2021.3100785openalex-snapshot
TianheGraph: Customizing Graph Search for Graph500 on Tianhe Supercomputer
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/3627535.3638498openalex-snapshot
GraphCube: Interconnection Hierarchy-aware Graph Processing
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/3696410.3714833openalex-snapshot
GraphCSR: A Space and Time-Efficient Sparse Matrix Representation for Web-scale Graph Processing
inferred← citeshttps://doi.org/10.1145/3712285.3759831openalex-snapshot
TianheEngine: Hierarchy-aware Adaptive Partitioning System for Trillion-scale Graph Processing
inferred← citeshttps://doi.org/10.1145/3721145.3725740openalex-snapshot
YH-Light: Yielding Hierarchy-aware Partitioner for Large-scale 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.24963/ijcai.2019/175openalex-snapshot
Direction-Optimizing Breadth-First Search with External Memory Storage
inferred← citeshttps://doi.org/10.29099/ijair.v2i2.58openalex-snapshot
Solution Search Simulation The Shortest Step On Chess Horse Using Breadth-First Search Algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.2102.01254openalex-snapshot
Customizing Graph500 for Tianhe Pre-exacale system
inferred← citeshttps://doi.org/10.59254/sbpo-2019-106960openalex-snapshot
Estudo sobre o uso do framework OpenMP na paralelização de um algoritmo para o problema de busca em largura.
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.