On the public citation graph

Level-wise Scheduling Algorithm for Fat Tree Interconnection Networks

0 signed · 17 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.1109/71.598274openalex-snapshot
Performance evaluation of switch-based wormhole networks
inferredcites →https://doi.org/10.1109/fmpc.1992.234900openalex-snapshot
Benchmarking the CM-5 multicomputer
inferredcites →https://doi.org/10.1109/ipps.1995.395925openalex-snapshot
Experience with active messages on the Meiko CS-2
inferredcites →https://doi.org/10.1109/ipps.1996.508067openalex-snapshot
Adaptive source routing in multistage interconnection networks
inferredcites →https://doi.org/10.1109/issoc.2003.1267730openalex-snapshot
New adaptive routing algorithm for extended generalized fat trees on-chip
inferredcites →https://doi.org/10.1109/tc.1985.6312192openalex-snapshot
Fat-trees: Universal networks for hardware-efficient supercomputing
inferredcites →https://doi.org/10.1145/140901.141883openalex-snapshot
The network architecture of the Connection Machine CM-5 (extended abstract)

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-981-13-2372-0_1openalex-snapshot
Properties and Performance of Linearly Extensible Multiprocessor Interconnection Networks
inferred← citeshttps://doi.org/10.1007/978-981-13-2685-1_50openalex-snapshot
Level-Wise Scheduling Algorithm for Linearly Extensible Multiprocessor Systems
inferred← citeshttps://doi.org/10.1109/c-m.1978.218136openalex-snapshot
Hints on Test Data Selection: Help for the Practicing Programmer
inferred← citeshttps://doi.org/10.1109/hoti.2014.19openalex-snapshot
Quasi Fat Trees for HPC Clouds and Their Fault-Resilient Closed-Form Routing
inferred← citeshttps://doi.org/10.1109/ipdps.2008.4536345openalex-snapshot
Optimization of infiniband for scientific applications
inferred← citeshttps://doi.org/10.1109/tpds.2008.82openalex-snapshot
Compiler Techniques for Efficient Communications in Circuit Switched Networks for Multiprocessor Systems
inferred← citeshttps://doi.org/10.1109/tpds.2018.2842224openalex-snapshot
A Self-Adaptive Network for HPC Clouds: Architecture, Framework, and Implementation
inferred← citeshttps://doi.org/10.1109/tvlsi.2013.2263397openalex-snapshot
UNION: A Unified Inter/Intrachip Optical Network for Chip Multiprocessors
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.2842openalex-snapshot
Scheduling and reconfiguration of interconnection network switches
inferred← citeshttps://doi.org/10.4995/thesis/10251/8856openalex-snapshot
Low-Memory Techniques for Routing and Fault-Tolerance on the Fat-Tree Topology
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.