On the public citation graph
Large-scale energy-efficient graph traversal: A path to efficient data-intensive supercomputing
0 signed · 60 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.1006/jpdc.2000.1674openalex-snapshot
A Multithreaded Message Passing Interface (MPI) Architecture: Performance and Program Issues
inferredcites →https://doi.org/10.1007/978-3-540-77004-6_10openalex-snapshot
Approximating Betweenness Centrality
inferredcites →https://doi.org/10.1088/1748-9326/3/3/034008openalex-snapshot
Worldwide electricity used in data centers
inferredcites →https://doi.org/10.1093/comjnl/42.3.193openalex-snapshot
Compressing Integers for Fast File Access
inferredcites →https://doi.org/10.1109/18.52473openalex-snapshot
The entropy of ordered sequences and order statistics
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/iiswc.2011.6114175openalex-snapshot
Performance characteristics of Graph500 on large-scale distributed environment
inferredcites →https://doi.org/10.1109/ipdps.2007.370687openalex-snapshot
Advanced Shortest Paths Algorithms on a Massively-Multithreaded Architecture
inferredcites →https://doi.org/10.1109/ipdps.2012.43openalex-snapshot
Fast and Efficient Graph Traversal Algorithm for CPUs: Maximizing Single-Node Efficiency
inferredcites →https://doi.org/10.1109/mspec.2011.5676366openalex-snapshot
Better benchmarking for supercomputers
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.46openalex-snapshot
Scalable Graph Exploration on Multicore Processors
inferredcites →https://doi.org/10.1109/tc.1985.6312192openalex-snapshot
Fat-trees: Universal networks for hardware-efficient supercomputing
inferredcites →https://doi.org/10.1109/tpds.2007.70811openalex-snapshot
Efficient Breadth-First Search on the Cell/BE Processor
inferredcites →https://doi.org/10.1137/1.9781611972801.48openalex-snapshot
Radius Plots for Mining Tera-byte Scale Graphs: Algorithms, Patterns, and Observations
inferredcites →https://doi.org/10.1145/1298306.1298311openalex-snapshot
Measurement and analysis of online social networks
inferredcites →https://doi.org/10.1145/1772690.1772751openalex-snapshot
What is Twitter, a social network or a news media?
inferredcites →https://doi.org/10.1145/1810085.1810091openalex-snapshot
Overlapping communication and computation by using a hybrid MPI/SMPSs approach
inferredcites →https://doi.org/10.1145/1810479.1810534openalex-snapshot
A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers)
inferredcites →https://doi.org/10.1145/2063384.2063471openalex-snapshot
Parallel breadth-first search on distributed memory systems
inferredcites →https://doi.org/10.1145/262762.262763openalex-snapshot
A query language for a Web-site management system
inferredcites →https://doi.org/10.1177/1094342010391989openalex-snapshot
The International Exascale Software Project roadmap
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-02215-0_4openalex-snapshot
Language and Hardware Acceleration Backend for Graph Processing
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-35225-7_13openalex-snapshot
Mozart : Efficient Composition of Library Functions for Heterogeneous Execution
inferred← citeshttps://doi.org/10.1007/978-3-319-03889-6_5openalex-snapshot
Efficient Hybrid Breadth-First Search on GPUs
inferred← citeshttps://doi.org/10.1007/978-3-319-20119-1_33openalex-snapshot
Quantifying Communication in Graph Analytics
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/s41019-016-0024-yopenalex-snapshot
Efficient Breadth-First Search on Massively Parallel and Distributed-Memory Machines
inferred← citeshttps://doi.org/10.1016/j.jpdc.2017.09.007openalex-snapshot
Accelerating breadth-first graph search on a single server by dynamic edge trimming
inferred← citeshttps://doi.org/10.1016/j.parco.2025.103147openalex-snapshot
ALBBA: An efficient ALgebraic Bypass BFS Algorithm on long vector architectures
inferred← citeshttps://doi.org/10.1049/cdt2.12041openalex-snapshot
Synchronization in graph analysis algorithms on the Partially Ordered Event‐Triggered Systems many‐core architecture
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/fdl.2017.8303899openalex-snapshot
Language and hardware acceleration backend for graph processing
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/hpcs48598.2019.9188058openalex-snapshot
Leveraging energy-efficient non-lossy compression for data-intensive applications
inferred← citeshttps://doi.org/10.1109/hpgdmp.2016.010openalex-snapshot
Power-Efficient Breadth-First Search with DRAM Row Buffer Locality-Aware Address Mapping
inferred← citeshttps://doi.org/10.1109/icpads.2016.0130openalex-snapshot
An Energy-Efficient Implementation of LU Factorization on Heterogeneous Systems
inferred← citeshttps://doi.org/10.1109/ipdps.2016.71openalex-snapshot
FastBFS: Fast Breadth-First Graph Search on a Single Server
inferred← citeshttps://doi.org/10.1109/ipdps.2019.00032openalex-snapshot
Excavating the Potential of GPU for Accelerating Graph Traversal
inferred← citeshttps://doi.org/10.1109/ipdpsw.2016.209openalex-snapshot
Modeling the Performance and Energy Impact of Dynamic Power Steering
inferred← citeshttps://doi.org/10.1109/sc.2014.72openalex-snapshot
Application Centric Energy-Efficiency Study of Distributed Multi-Core and Hybrid CPU-GPU Systems
inferred← citeshttps://doi.org/10.1109/sc.2018.00061openalex-snapshot
iSpan: Parallel Identification of Strongly Connected Components with Spanning Trees
inferred← citeshttps://doi.org/10.1109/sc41406.2024.00107openalex-snapshot
Doubling Graph Traversal Efficiency to 198 TeraTEPS on the Supercomputer Fugaku
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.2021.3100785openalex-snapshot
TianheGraph: Customizing Graph Search for Graph500 on Tianhe Supercomputer
inferred← citeshttps://doi.org/10.1140/epjb/e2015-60180-8openalex-snapshot
Colloquium: Large scale simulations on GPU clusters
inferred← citeshttps://doi.org/10.1145/3182656openalex-snapshot
Dynamic Merging of Frontiers for Accelerating the Evaluation of Betweenness Centrality
inferred← citeshttps://doi.org/10.1145/3543542openalex-snapshot
i S pan : Parallel Identification of Strongly Connected Components with Spanning Trees
inferred← citeshttps://doi.org/10.1145/3710848.3710859openalex-snapshot
BerryBees: Breadth First Search by Bit-Tensor-Cores
inferred← citeshttps://doi.org/10.1177/1094342014524240openalex-snapshot
Using the Intel Many Integrated Core to accelerate graph traversal
inferred← citeshttps://doi.org/10.14529/jsfi150205openalex-snapshot
Energy-efficient Algorithms for Ultrascale Systems
inferred← citeshttps://doi.org/10.70675/7514aa15zc8c4z4114z9f8ez0d113a0fe2b2openalex-snapshot
Discover, model and combine energy leverages for large scale energy efficient infrastructures
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.