Resource placement in torus-based networks

No abstract is available for this paper.

• Publication year

  1996

• Venue

  Proceedings of the International Conference on Parallel Processing

• Publication date

  1996-04-15

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1109/IPPS.1996.508077
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Topics in toroidal interconnection networks

  1996cited by this paper
• Spare processor allocation for fault tolerance in torus-based multicomputers

  1996cited by this paper
• Resource Allocation in Cube Network Systems Based on the Covering Radius

  1996cited by this paper
• Lee Distance and Topological Properties of k-ary n-cubes

  1995cited by this paper
• Resource Placement with Multiple Adjacency Constraints in k-ary n-Cubes

  1995cited by this paper
• Efficient Resource Placement in Hypercubes Using Multiple-Adjacency Codes

  1994cited by this paper
• Submicron Systems Architecture

  1993cited by this paper
• 1993 International Conference on Parallel Processing ON RESOURCE ALLOCATION IN BINARY n-CUBE NETWORK SYSTEMS

  1993cited by this paper
• The J-machine Multicomputer: An Architectural Evaluation

  1993cited by this paper
• Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992)

  1992cited by this paper
• Resource Placement in k-Ary n-Cubes

  1992cited by this paper
• Fault-Tolerant Resource Placement in Hypercube Computers

  1991cited by this paper
• Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes

  1991influential reference
• PERFECT DOMINATING SETS

  1990cited by this paper
• Resource Allocation in Hypercube Systems

  1990cited by this paper
• Submicron Systems Architecture Project: Semiannual Technical Report

  1989cited by this paper
• The architecture and programming of the Ametek series 2010 multicomputer

  1988cited by this paper
• On the covering radius of codes

  1985cited by this paper
• Algebraic coding theory

  1984cited by this paper
• Generalized Hypercube and Hyperbus Structures for a Computer Network

  1984cited by this paper
• Some properties of nonbinary error-correcting codes

  1958cited by this paper
• Binary block coding

  1957cited by this paper

• Satellite Computing Network Construction: Optimal Computing Node Deployment in Multi-Layer LEO Mega-Constellations

  2026cites this paper
• Geographically distributed data management to support large-scale data analysis

  2023cites this paper
• QoS-Aware Resource Placement for LEO Satellite Edge Computing

  2022cites this paper
• Transfer of resource allocation between overlapping and embedded communities in multiagent social networks

  2021cites this paper
• Mega Satellite Constellation System Optimization: From a Network Control Structure Perspective

  2021influential citation
• The Method of Determining the Optimal Communication Structure

  2018cites this paper
• 2-Correcting Lee Codes: (Quasi)-Perfect Spectral Conditions and Some Constructions

  2018cites this paper
• Posicionamento do Número Mínimo de Recursos que Maximizam Caminhos Vértice-Disjuntos em uma Rede de Topologia Arbitrária

  2018cites this paper
• On Improving Communication System Performance in Some Virtual Private Networks

  2018cites this paper
• 50 Years of the Golomb–Welch Conjecture

  2017cites this paper
• Resource placement in the 4-dimensional cube-type processor networks with soft degradation

  2017cites this paper
• Quasi-Perfect Lee Codes from Quadratic Curves over Finite Fields

  2016cites this paper
• The method for optimal server placement in the hypercube networks

  2015cites this paper
• Data placement using Dewey Encoding in a hierarchical data grid

  2015cites this paper
• An Analytical Method of Server Placement in Regular Networks and Its Evaluation by Simulation Experiments

  2015cites this paper
• On Some Resources Placement Schemes in the 4-Dimensional Soft Degradable Hypercube Processors Network

  2014cites this paper
• Topological Characterization of Hamming and Dragonfly Networks and Its Implications on Routing

  2014cites this paper
• Length two path-centred surface areas for the arrangement graph

  2014cites this paper
• Deriving length two path centered surface area for the arrangement graph: a generating function approach

  2014cites this paper
• An approach to conditional diagnosability analysis under the PMC model and its application to torus networks

  2014cites this paper
• On vertex-pancyclicity and edge-pancyclicity of the WK-Recursive network

  2014cites this paper
• Resources placement in the 4-dimensional fault-tolerant hypercube processors network

  2013cites this paper
• A Prediction-Based Replica Replacement Strategy in Data Grid

  2013cites this paper
• On Resource Placement in Gaussian and EJ Interconnection Networks

  2013cites this paper
• A dynamic replica management strategy in data grid

  2012cites this paper
• On the surface area of the augmented cubes

  2012cites this paper
• Optimizing server placement in distributed systems in the presence of competition

  2011cites this paper
• Resource placement in Cartesian product of networks

  2010cites this paper
• Independent Spanning Trees on Multidimensional Torus Networks

  2010cites this paper
• The Bipancycle-Connectivity and the m-Pancycle-Connectivity of the k-ary n-cube

  2010cites this paper
• Optimizing server placement for parallel I/O in switch-based clusters

  2009cites this paper
• The panconnectivity and the pancycle-connectivity of the generalized base-b hypercube

  2009influential citation
• On perfect Lee codes

  2009cites this paper
• Chromatic sets of power graphs and their application to resource placement in multicomputer networks

  2009cites this paper
• Strongly Hamiltonian laceability of the even k-ary n-cube

  2009cites this paper
• Resource placement in three-dimensional tori

  2009cites this paper
• Resource Placement in Cube-Connected Cycles

  2008cites this paper
• Optimal replica placement in hierarchical Data Grids with locality assurance

  2008cites this paper
• The bipancycle-connectivity of the hypercube

  2008cites this paper
• Resource Placement in the Edge Product of Graphs

  2008cites this paper
• A List-Based Strategy for Optimal Replica Placement in Data Grid Systems

  2008cites this paper
• Theoretical Research on Topological Properties of Generalized K-Ary n-Cube Interconnection Network

  2008cites this paper
• Optimal Number of Replicas with QoS Assurance in Data Grid Environment

  2008cites this paper
• Optimal number of replicas in data grid environment

  2008cites this paper
• The pancyclicity and the Hamiltonian-connectivity of the generalized base-b hypercube

  2008cites this paper
• Design and Analysis of a Backpressure Congestion Control Algorithm in Wireless Sensor Network

  2007cites this paper
• The m-pancycle-connectivity of a WK-Recursive network

  2007cites this paper
• OSASMAC: Opportunistic Secure Adaptive Sensor MAC Protocol

  2007cites this paper
• Distant-Based Resource Placement in Product Networks

  2007cites this paper
• Optimal Placement Replication on Data Grid Environments

  2007cites this paper
• Parallel Construction of Independent Spanning Trees on Multidimensional Tori

  2007cites this paper
• Resource Placement in Networks Using Chromatic Sets of Power Graphs

  2007cites this paper
• Reliable low latency I/O in torus-based interconnection networks

  2007cites this paper
• The bipanconnectivity and m-panconnectivity of the folded hypercube

  2007cites this paper
• Optimal Interleaving on Tori

  2006cites this paper
• Fast decoding of quasi-perfect Lee distance codes

  2006cites this paper
• Optimal placement of replicas in data grid environments with locality assurance

  2006cites this paper
• Optimal replica placement strategy for hierarchical data grid systems

  2006cites this paper
• Optimal Replica Placement in Data Grid Environments with Locality Assurance

  2006cites this paper
• Quasi-perfect resource placements for two-dimensional toroidal networks

  2005cites this paper
• The impact of spatial layout of jobs on I/O hotspots in mesh networks

  2005cites this paper
• Perfect Distance-d Placements in 2D Toroidal Networks

  2004influential citation
• Optimal t-interleaving on tori

  2004cites this paper
• Optimized network data storage and topology control

  2004cites this paper
• Optimizing I/O server placement for parallel I/O on switch-based irregular networks

  2004cites this paper
• On resource placements in 3D tori

  2003cites this paper
• Higher dimensional hexagonal networks

  2003cites this paper
• Perfect r-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh

  2003cites this paper
• Self-organization of cellular environment and reproduction of the network logical structure

  2003cites this paper
• Quasi-perfect Lee distance codes

  2003cites this paper
• Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks

  2002cites this paper
• Regular Triangulated Toroidal Graphs with Applications to Cellular and Interconnection Networks

  2002cites this paper
• Perfect r-domination in the Kronecker product of three cycles

  2002cites this paper
• Coding theory framework for target location in distributed sensor networks

  2001cites this paper
• On some properties of k-ary n-cubes

  2001cites this paper
• The impact of spatial layout of jobs on parallel I/O performance

  1999cites this paper
• Lower bounds on communication loads and optimal placements in torus networks

  1998cites this paper
• Resource placements in 2D tori

  1998cites this paper
• I/O placement strategies and their data locality sensitivities in k/spl times/k toroidal networks

  1997cites this paper
• Spare processor allocation for fault tolerance in torus-based multicomputers

  1996cites this paper
• NODE PLACEMENT FOR PERFORMANCE AND RELIABILITY IN TORUS NETWORKS

  year unknowninfluential citation
• Optimizing Server Placement for Parallel I/o in Switch-based Clusters Keywords: Cluster Computing Parallel I/o I/o Server Placement Load Balancing Switch-based Cluster Irregular Network Load-balancing Matching Algorithm Load-balancing Tree-traversing Algorithm

  year unknowncites this paper