On the public citation graph

Resource allocation in cube network systems based on the covering radius

0 signed · 45 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/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1038/scientificamerican0687-108openalex-snapshot
The Connection Machine
inferredcites →https://doi.org/10.1109/12.2234openalex-snapshot
Topological properties of hypercubes
inferredcites →https://doi.org/10.1109/12.250606openalex-snapshot
Efficient resource placement in hypercubes using multiple-adjacency codes
inferredcites →https://doi.org/10.1109/18.42181openalex-snapshot
Short codes with a given covering radius
inferredcites →https://doi.org/10.1109/71.382319openalex-snapshot
Resource placement with multiple adjacency constraints in k-ary n-cubes
inferredcites →https://doi.org/10.1109/dmcc.1990.556296openalex-snapshot
Resource Allocation in Hypercube Systems
inferredcites →https://doi.org/10.1109/tit.1985.1057043openalex-snapshot
Covering radius---Survey and recent results
inferredcites →https://doi.org/10.1145/2465.2467openalex-snapshot
The cosmic cube
inferredcites →https://doi.org/10.1145/62297.62303openalex-snapshot
iPSC/2 system: a second generation hypercube
inferredcites →https://doi.org/10.1145/62297.62324openalex-snapshot
Distributing resources in hypercube computers

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-319-07013-1_13openalex-snapshot
On Some Resources Placement Schemes in the 4-Dimensional Soft Degradable Hypercube Processors Network
inferred← citeshttps://doi.org/10.1007/978-3-540-30141-7_53openalex-snapshot
DC-mesh: A Contracted High-Dimensional Mesh for Dynamic Clustering
inferred← citeshttps://doi.org/10.1007/978-3-540-30566-8_113openalex-snapshot
Optimizing I/O Server Placement for Parallel I/O on Switch-Based Irregular Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-46703-8_14openalex-snapshot
Cyclic Block Allocation: A New Scheme for Hierarchical Multicast Address Allocation
inferred← citeshttps://doi.org/10.1007/978-3-540-74510-5_18openalex-snapshot
Resource Placement in Networks Using Chromatic Sets of Power Graphs
inferred← citeshttps://doi.org/10.1007/s11227-006-8293-2openalex-snapshot
Optimizing I/O server placement for parallel I/O on switch-based irregular networks
inferred← citeshttps://doi.org/10.1016/j.camwa.2009.01.043openalex-snapshot
Chromatic sets of power graphs and their application to resource placement in multicomputer networks
inferred← citeshttps://doi.org/10.1016/j.jnca.2012.01.014openalex-snapshot
A dynamic replica management strategy in data grid
inferred← citeshttps://doi.org/10.1016/j.jnca.2014.11.009openalex-snapshot
Data placement using Dewey Encoding in a hierarchical data grid
inferred← citeshttps://doi.org/10.1016/j.jpdc.2005.02.005openalex-snapshot
Quasi-perfect resource placements for two-dimensional toroidal networks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2005.04.020openalex-snapshot
The impact of spatial layout of jobs on I/O hotspots in mesh networks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2008.08.002openalex-snapshot
Optimal replica placement in hierarchical Data Grids with locality assurance
inferred← citeshttps://doi.org/10.1016/j.jpdc.2008.10.001openalex-snapshot
Optimizing server placement for parallel I/O in switch-based clusters
inferred← citeshttps://doi.org/10.1016/j.jpdc.2009.06.005openalex-snapshot
Resource placement in Cartesian product of networks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2010.08.008openalex-snapshot
Optimizing server placement in distributed systems in the presence of competition
inferred← citeshttps://doi.org/10.1016/s0743-7315(03)00122-9openalex-snapshot
On resource placements in 3D tori
inferred← citeshttps://doi.org/10.1023/b:supe.0000022572.95414.27openalex-snapshot
Perfect Distance-d Placements in 2D Toroidal Networks
inferred← citeshttps://doi.org/10.1038/s41598-023-44789-xopenalex-snapshot
Geographically distributed data management to support large-scale data analysis
inferred← citeshttps://doi.org/10.1109/12.628393openalex-snapshot
Resource placement in torus-based networks
inferred← citeshttps://doi.org/10.1109/ams.2008.147openalex-snapshot
Optimal Number of Replicas with QoS Assurance in Data Grid Environment
inferred← citeshttps://doi.org/10.1109/ccgrid.2006.76openalex-snapshot
Optimal replica placement strategy for hierarchical data grid systems
inferred← citeshttps://doi.org/10.1109/i-span.2008.36openalex-snapshot
Resource Placement in Cube-Connected Cycles
inferred← citeshttps://doi.org/10.1109/icdfma.2008.4784420openalex-snapshot
Optimal number of replicas in data grid environment
inferred← citeshttps://doi.org/10.1109/icit.2007.57openalex-snapshot
Shape Based Object Classification for Automated Video Surveillance with Feature Selection
inferred← citeshttps://doi.org/10.1109/icit.2007.59openalex-snapshot
Optimal Placement Replication on Data Grid Environments
inferred← citeshttps://doi.org/10.1109/icpads.2006.74openalex-snapshot
Optimal placement of replicas in data grid environments with locality assurance
inferred← citeshttps://doi.org/10.1109/icpp.2008.31openalex-snapshot
A List-Based Strategy for Optimal Replica Placement in Data Grid Systems
inferred← citeshttps://doi.org/10.1109/ipps.1996.508077openalex-snapshot
Resource placement in torus-based networks
inferred← citeshttps://doi.org/10.1109/ispan.1999.778918openalex-snapshot
Ψ-cubes: recursive bused fat-hypercubes for multilevel snoopy caches
inferred← citeshttps://doi.org/10.1109/pdcat.2007.19openalex-snapshot
Distant-Based Resource Placement in Product Networks
inferred← citeshttps://doi.org/10.1109/pdcat.2007.32openalex-snapshot
Design and Analysis of a Backpressure Congestion Control Algorithm in Wireless Sensor Network
inferred← citeshttps://doi.org/10.1109/tc.2011.254openalex-snapshot
On Resource Placement in Gaussian and EJ Interconnection Networks
inferred← citeshttps://doi.org/10.1145/301816.301830openalex-snapshot
The impact of spatial layout of jobs on parallel I/O performance
inferred← citeshttps://doi.org/10.15439/2013f259openalex-snapshot
Resources placement in the 4-dimensional fault-tolerant hypercube processors network
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.