On the public citation graph
Resource placement in torus-based networks
0 signed · 93 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.1002/j.1538-7305.1957.tb02410.xopenalex-snapshot
Binary Block Coding
inferredcites →https://doi.org/10.1109/12.250606openalex-snapshot
Efficient resource placement in hypercubes using multiple-adjacency codes
inferredcites →https://doi.org/10.1109/12.403718openalex-snapshot
Lee distance and topological properties of k-ary n-cubes
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/71.494628openalex-snapshot
Resource allocation in cube network systems based on the covering radius
inferredcites →https://doi.org/10.1109/dmcc.1990.556296openalex-snapshot
Resource Allocation in Hypercube Systems
inferredcites →https://doi.org/10.1109/ftcs.1996.534613openalex-snapshot
Spare processor allocation for fault tolerance in torus-based multicomputers
inferredcites →https://doi.org/10.1109/icpp.1993.125openalex-snapshot
On Resources Allocation in Binary n-Cube Network Systems
inferredcites →https://doi.org/10.1109/ipps.1996.508077openalex-snapshot
Resource placement in torus-based networks
inferredcites →https://doi.org/10.1109/isca.1993.698563openalex-snapshot
The J-machine Multicomputer: An Architectural Evaluation
inferredcites →https://doi.org/10.1109/tc.1984.1676437openalex-snapshot
Generalized Hypercube and Hyperbus Structures for a Computer Network
inferredcites →https://doi.org/10.1109/tit.1958.1057446openalex-snapshot
Some properties of nonbinary error-correcting codes
inferredcites →https://doi.org/10.1109/tit.1985.1057039openalex-snapshot
On the covering radius of codes
inferredcites →https://doi.org/10.1145/62297.62302openalex-snapshot
The architecture and programming of the Ametek series 2010 multicomputer
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-319-44354-6_2openalex-snapshot
An Analytical Method of Server Placement in Regular Networks and Its Evaluation by Simulation Experiments
inferred← citeshttps://doi.org/10.1007/978-3-319-92459-5_1openalex-snapshot
The Method of Determining the Optimal Communication Structure
inferred← citeshttps://doi.org/10.1007/978-3-319-92459-5_6openalex-snapshot
On Improving Communication System Performance in Some Virtual Private Networks
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-74510-5_18openalex-snapshot
Resource Placement in Networks Using Chromatic Sets of Power Graphs
inferred← citeshttps://doi.org/10.1007/s10623-006-0025-3openalex-snapshot
Fast decoding of quasi-perfect Lee distance codes
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.1007/s11227-008-0257-2openalex-snapshot
The panconnectivity and the pancycle-connectivity of the generalized base-b hypercube
inferred← citeshttps://doi.org/10.1007/s11227-011-0641-1openalex-snapshot
On the surface area of the augmented cubes
inferred← citeshttps://doi.org/10.1007/s11227-014-1085-1openalex-snapshot
Deriving length two path centered surface area for the arrangement graph: a generating function approach
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.compeleceng.2007.05.011openalex-snapshot
The pancyclicity and the Hamiltonian-connectivity of the generalized base-b hypercube
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2009.01.002openalex-snapshot
Strongly Hamiltonian laceability of the even k-ary n-cube
inferred← citeshttps://doi.org/10.1016/j.ins.2007.04.013openalex-snapshot
The m-pancycle-connectivity of a WK-Recursive network
inferred← citeshttps://doi.org/10.1016/j.ins.2008.08.011openalex-snapshot
The bipancycle-connectivity of the hypercube
inferred← citeshttps://doi.org/10.1016/j.ins.2014.07.037openalex-snapshot
On vertex-pancyclicity and edge-pancyclicity of the WK-Recursive network
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.2003.07.001openalex-snapshot
Higher dimensional hexagonal networks
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/j.knosys.2021.107081openalex-snapshot
Transfer of resource allocation between overlapping and embedded communities in multiagent social networks
inferred← citeshttps://doi.org/10.1016/j.parco.2009.09.004openalex-snapshot
Resource placement in three-dimensional tori
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.07.005openalex-snapshot
The bipanconnectivity and m -panconnectivity of the folded hypercube
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.07.006openalex-snapshot
An approach to conditional diagnosability analysis under the PMC model and its application to torus networks
inferred← citeshttps://doi.org/10.1016/s0020-0190(03)00268-0openalex-snapshot
Perfect r-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh
inferred← citeshttps://doi.org/10.1016/s0168-9002(03)00495-9openalex-snapshot
Self-organization of cellular environment and reproduction of the network logical structure
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.1080/00207160.2013.829215openalex-snapshot
Length two path-centred surface areas for the arrangement graph
inferred← citeshttps://doi.org/10.1109/12.841129openalex-snapshot
Lower bounds on communication loads and optimal placements in torus networks
inferred← citeshttps://doi.org/10.1109/81.974881openalex-snapshot
Perfect r-domination in the Kronecker product of three cycles
inferred← citeshttps://doi.org/10.1109/aina.2008.131openalex-snapshot
Resource Placement in the Edge Product of Graphs
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/ftcs.1996.534613openalex-snapshot
Spare processor allocation for fault tolerance in torus-based multicomputers
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/icfec54809.2022.00016openalex-snapshot
QoS-Aware Resource Placement for LEO Satellite Edge Computing
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.2001.934861openalex-snapshot
On some properties of k-ary n-cubes
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/icycs.2008.285openalex-snapshot
Theoretical Research on Topological Properties of Generalized K-Ary n-Cube Interconnection Network
inferred← citeshttps://doi.org/10.1109/ipps.1998.669952openalex-snapshot
Resource placements in 2D tori
inferred← citeshttps://doi.org/10.1109/ipps.1998.669957openalex-snapshot
Lower bounds on communication loads and optimal placements in torus networks
inferred← citeshttps://doi.org/10.1109/isit.2004.1365060openalex-snapshot
Optimal t-interleaving on tori
inferred← citeshttps://doi.org/10.1109/itcc.2001.918778openalex-snapshot
Coding theory framework for target location in distributed sensor networks
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.2002.1146711openalex-snapshot
Grid coverage for surveillance and target location in distributed sensor networks
inferred← citeshttps://doi.org/10.1109/tc.2009.98openalex-snapshot
Independent Spanning Trees on Multidimensional Torus Networks
inferred← citeshttps://doi.org/10.1109/tc.2011.254openalex-snapshot
On Resource Placement in Gaussian and EJ Interconnection Networks
inferred← citeshttps://doi.org/10.1109/tcomm.2025.3638621openalex-snapshot
Satellite Computing Network Construction: Optimal Computing Node Deployment in Multi-Layer LEO Mega-Constellations
inferred← citeshttps://doi.org/10.1109/tit.2003.811922openalex-snapshot
Quasi-perfect Lee distance codes
inferred← citeshttps://doi.org/10.1109/tit.2017.2786675openalex-snapshot
50 Years of the Golomb–Welch Conjecture
inferred← citeshttps://doi.org/10.1109/tit.2018.2789921openalex-snapshot
2-Correcting Lee Codes: (Quasi)-Perfect Spectral Conditions and Some Constructions
inferred← citeshttps://doi.org/10.1109/twc.2021.3100247openalex-snapshot
Mega Satellite Constellation System Optimization: From a Network Control Structure Perspective
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
inferred← citeshttps://doi.org/10.15439/2015f157openalex-snapshot
The method for optimal server placement in the hypercube networks
inferred← citeshttps://doi.org/10.3390/electronics15163587openalex-snapshot
Space-Based Control Node Placement for Joint Handover and Migration Delay Optimization in LEO Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1608.06748openalex-snapshot
Quasi-Perfect Lee Codes from Quadratic Curves over Finite Fields
inferred← citeshttps://doi.org/10.5753/sbrc.2018.2465openalex-snapshot
Posicionamento do Número Mínimo de Recursos que Maximizam Caminhos Vértice-Disjuntos em uma Rede de Topologia Arbitrária
inferred← citeshttps://doi.org/10.7155/jgaa.00058openalex-snapshot
A 6-Regular Torus Graph Family with Applications to Cellular and Interconnection Networks
inferred← citeshttps://doi.org/10.7907/91r7-mh71.openalex-snapshot
Optimized network data storage and topology control
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.