A new interconnection topology for incrementally expansible multicomputer systems is described, which combines the easy expansibility of tree structures with the compactness of the n-dimensional hypercube. The additio...
详细信息
A new interconnection topology for incrementally expansible multicomputer systems is described, which combines the easy expansibility of tree structures with the compactness of the n-dimensional hypercube. The addition of n-cube links to the binary tree structure provides direct paths between nodes which have frequent data exchange in algorithms such as sorting and fast Fourier transforms (FFT"s). The derivation of a family of such Hypertree structures is outlined, and the basic properties such as average path length, uniformity of the distribution of message traffic, and routing algorithms are analyzed.
The original routing algorithm of the ARPANET, in service for over a decade, has recently been removed from the ARPANET and replaced with a new and different algorithm. Although the new algorithm, like the old, is a d...
详细信息
In this paper, a unique topologically based nonminimum distance routing algorithm is presented. It offers both maximal completion rates and minimal via usage. The algorithm is based on a topological transformation of ...
详细信息
A communication network for a tree-structured assembly (X-TREE) of single-chip processors is described, and considerations for selecting this particular approach are discussed. The communication links between the proc...
详细信息
Two analytic models of a store-and-forward communications network are constructed, one to find the optimal message routing and the other to illustrate the equilibrium (stationary state) maintained by an adaptive routi...
详细信息
In this paper we describe a router which has the capabilities of automatic rip-up and rerouting. The system employs a "look-ahead" feature for determining if as yet unrouted nets are unroutable. Backtrack pr...
详细信息
This paper discusses a new routing program. The program initially partitions a printed circuit board into regions called saturated zones. These saturated zones are subsequently merged by routing into larger and larger...
详细信息
This paper presents an algorithm for finding optimum routings for interconnection paths in a channel between two parallel rows of circuit cells. A routing algorithm thus need only avoid overlapping collinear horizonta...
详细信息
暂无评论