On the public citation graph

LFTI: A New Performance Metric for Assessing Interconnect Designs for Extreme-Scale HPC Systems

https://doi.org/10.1109/ipdps.2014.38
0 signed · 28 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/0026-2692(93)90111-qopenalex-snapshot
Computer architecture: a quantitative approach
inferredcites →https://doi.org/10.1109/clustr.2008.4663762openalex-snapshot
Multistage switches are not crossbars: Effects of static routing in high-performance networks
inferredcites →https://doi.org/10.1109/clustr.2009.5289145openalex-snapshot
Oblivious routing schemes in extended generalized Fat Tree networks
inferredcites →https://doi.org/10.1109/ipdps.2011.249openalex-snapshot
Characterization of the Communication Patterns of Scientific Applications on Blue Gene/P
inferredcites →https://doi.org/10.1109/isca.2008.19openalex-snapshot
Technology-Driven, Highly-Scalable Dragonfly Topology
inferredcites →https://doi.org/10.1109/mc.2009.370openalex-snapshot
Tofu: A 6D Mesh/Torus Interconnect for Exascale Computers
inferredcites →https://doi.org/10.1109/sc.2006.10openalex-snapshot
Adaptive Routing in High-Radix Clos Network
inferredcites →https://doi.org/10.1109/tnet.2006.886738openalex-snapshot
Multi-Path TCP: A Joint Congestion Control and Routing Scheme to Exploit Path Diversity in the Internet
inferredcites →https://doi.org/10.1145/1555754.1555783openalex-snapshot
Indirect adaptive routing on large scale interconnection networks
inferredcites →https://doi.org/10.1145/2503210.2503229openalex-snapshot
A new routing scheme for Jellyfish and its performance with HPC workloads
inferredcites →https://doi.org/10.48550/arxiv.1110.1687openalex-snapshot
Jellyfish: Networking Data Centers Randomly

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-018-7239-1openalex-snapshot
Analyzing time-dimension communication characterizations for representative scientific applications on supercomputer systems
inferred← citeshttps://doi.org/10.1016/j.future.2017.05.004openalex-snapshot
Improved routing algorithms in the dual-port datacenter networks HCN and BCN
inferred← citeshttps://doi.org/10.1109/candar.2016.0019openalex-snapshot
LOREN: A Scalable Routing Method for Layout-Conscious Random Topologies
inferred← citeshttps://doi.org/10.1109/cluster.2015.56openalex-snapshot
Fast Calculation of Max-Min Fair Rates for Multi-commodity Flows in Fat-Tree Networks
inferred← citeshttps://doi.org/10.1109/hpcc-css-icess.2015.15openalex-snapshot
Time-Dimension Communication Characterization of Representative Scientific Applications on Tianhe-2
inferred← citeshttps://doi.org/10.1109/ipdps.2016.44openalex-snapshot
Random Regular Graph and Generalized De Bruijn Graph with k-Shortest Path Routing
inferred← citeshttps://doi.org/10.1109/ipdps65963.2026.00072openalex-snapshot
EvalNet: A Practical Toolchain for Generation and Analysis of Extreme-Scale Interconnects
inferred← citeshttps://doi.org/10.1109/sc.2016.35openalex-snapshot
Enhancing InfiniBand with OpenFlow-Style SDN Capability
inferred← citeshttps://doi.org/10.1109/sc.2016.64openalex-snapshot
Measuring and Understanding Throughput of Network Topologies
inferred← citeshttps://doi.org/10.1109/sc41405.2020.00031openalex-snapshot
FatPaths: Routing in Supercomputers and Data Centers when Shortest Paths Fall Short
inferred← citeshttps://doi.org/10.1109/tpds.2017.2741492openalex-snapshot
Random Regular Graph and Generalized De Bruijn Graph with $k$ -Shortest Path Routing
inferred← citeshttps://doi.org/10.1109/tpds.2017.2746078openalex-snapshot
Rapid Calculation of Max-Min Fair Rates for Multi-Commodity Flows in Fat-Tree Networks
inferred← citeshttps://doi.org/10.1145/3349620openalex-snapshot
Modeling Universal Globally Adaptive Load-Balanced Routing
inferred← citeshttps://doi.org/10.1145/3392717.3392756openalex-snapshot
Global link arrangement for practical Dragonfly
inferred← citeshttps://doi.org/10.1145/3796701.3815941openalex-snapshot
A Separation Between Optimal Demand-Oblivious and Demand-Aware Network Throughput
inferred← citeshttps://doi.org/10.1587/transinf.2017pap0019openalex-snapshot
A Layout-Oriented Routing Method for Low-Latency HPC Networks
inferred← citeshttps://doi.org/10.5555/3014904.3014953openalex-snapshot
Enhancing infiniband with openflow-style SDN capability
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.