Skip to search formSkip to main contentSkip to account menu

Grid network

Known as: Toroidal networks and hypercubes 
A grid network is a computer network consisting of a number of (computer) systems connected in a grid topology. In a regular grid topology, each node… 
Wikipedia (opens in a new tab)

Related topics

Related topics

11 relations
Cluster managerContext-aware networkCube-connected cyclesDe Bruijn graph

Broader (1)

Network topology

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2001
2001
Hamiltonicity of the Hierarchical Cubic Network
Abstract. The hierarchical cubic network was proposed as an alternative to the hypercube. In this paper, using Gray codes, we… 
1998
1998
A scalable control topology for multicast communications
Large-scale multicast applications for the Internet require the availability of multicast protocols that enhance the basic… 
Highly Cited
1997
Highly Cited
1997
Deterministic Many-to-Many Hot Potato Routing
We consider algorithms for many-to-many hot potato routing. In hot potato (deflection) routing, a packet cannot be buffered, and… 
Highly Cited
1996
Highly Cited
1996
ServerNet deadlock avoidance and fractahedral topologies
This paper examines the problems of deadlock avoidance in multistage networks, and proposes a new class of scalable topologies… 
Highly Cited
1994
Highly Cited
1994
Embedding of Rings and Meshes onto Faulty Hypercubes Using Free Dimensions
Fault tolerance in hypercubes is achieved by exploiting inherent redundancy and executing tasks on faulty hypercubes. The authors… 
Highly Cited
1992
Highly Cited
1992
Hyper Petersen network: yet another hypercube-like topology
The authors propose and analyze a new hypercubelike topology, called the hyper-Petersen (HP) network, which is constructed from… 
1991
1991
Load balancing on a hypercube
  • Jinwoon WooS. Sahni
  • [] Proceedings. The Fifth International Parallel…
  • 1991
  • Corpus ID: 206930906
Assuming there is a hypercube with p=2/sup d/ processors and that each hypercube processor, PE(i), has L/sub i/ units of load… 
1990
1990
A Distributed Management Scheme for Partitionable Parallel Computers
A distributed scheme for dynamic partitioning is investigated. Distributed procedures to split a subsystem and to combine… 
Highly Cited
1987
Highly Cited
1987
Supporting Divide-and-Conquer Algorithms for Image Processing
  • Q. Stout
  • J. Parallel Distributed Comput.
  • 1987
  • Corpus ID: 3073446
Highly Cited
1981
Highly Cited
1981
A Cluster Structure as an Interconnection Network for Large Multimicrocomputer Systems
This paper presents a cluster structure, characterized by a set of structure parameters and a set of interconnection functions… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)