Distant-Based Resource Placement in Product Networks

No abstract is available for this paper.

• Publication year

  2007

• Venue

  International Conference on Parallel and Distributed Computing: Applications and Technologies

• Publication date

  2007-12-03

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1109/PDCAT.2007.19
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Fault diameter of Cartesian product graphs

  2005cited by this paper
• On the Total Domination Number of Cartesian Products of Graphs

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

  2004cited by this paper
• Constructing Edge-Disjoint Spanning Trees in Product Networks

  2003cited by this paper
• On resource placements in 3D tori

  2003cited by this paper
• On the fractional chromatic number, the chromatic number, and graph products

  2002cited by this paper
• An Efficient Partitioning Algorithm for Distributed Virtual Environment Systems

  2002cited by this paper
• Minimal Fault Diameter for Highly Resilient Product Networks

  2000cited by this paper
• A Theory for Total Exchange in Multidimensional Interconnection Networks

  1998cited by this paper
• Generalized Algorithm for Parallel Sorting on Product Networks

  1997cited by this paper
• Efficient VLSI Layouts for Homogeneous Product Networks

  1997cited by this paper
• Coloring graph products - A survey

  1996cited by this paper
• Resource placement in torus-based networks

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

  1996cited by this paper
• Placement of resources in the star network

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

  1996cited by this paper
• Reliable broadcasting in product networks

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

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

  1991cited by this paper
• Distributing resources in hypercube computers

  1988cited by this paper
• On the group of the composition of two graphs

  1959cited by this paper
• The composition of graphs

  1959cited by this paper

• A Framework for Implementing Asynchronous Replication Scheme in Utility-Based Computing Environment

  2015cites this paper
• On the Topological Properties of Grid-Based Interconnection Networks: Surface Area and Volume of Radial Spheres

  2011cites this paper