A 2-D optical three-stage Clos interconnection network, which is made up of a number of feasible crossbars of medium size, is implemented for dynamic data communications. The network is nonblocking and can handle a la...
详细信息
A 2-D optical three-stage Clos interconnection network, which is made up of a number of feasible crossbars of medium size, is implemented for dynamic data communications. The network is nonblocking and can handle a large number of communication lines (compared with crossbar networks of realizable size). Doth one-to-one and one-to-many routing algorithms are discussed. Applications based on the Clos network are proposed for SIMD (single instruction multiple data) parallel computations and four-level programmable logic arrays (PLAs).
An approximation of Newton's method has been used recently in routing algorithms in computer networks, which is based on the assumption that the matrix of second derivatives of the objective function (Hessian) is ...
详细信息
An approximation of Newton's method has been used recently in routing algorithms in computer networks, which is based on the assumption that the matrix of second derivatives of the objective function (Hessian) is diagonal. It is demonstrated that in message-switched networks some specific nondiagonal elements exist and therefore the Hessian is not diagonal. Moreover, it is found that these elements are of the same order as the diagonal ones.
Pathparse is a tool with a practical approach to disambiguating problematic routes for services such as electronic mail. Pathparse resolves syntactic and host name ambiguities with the aid of a database that describes...
详细信息
Pathparse is a tool with a practical approach to disambiguating problematic routes for services such as electronic mail. Pathparse resolves syntactic and host name ambiguities with the aid of a database that describes host connections. The parser generates a set of path/user pairs; heuristics are used to select one among these, which may then be used by a conventional mail handler.
We present an optimal oblivious randomized algorithm for permutation routing on the MIMD version of Mesh. Our routing algorithm routes n2 elements on an n×n Mesh in 2n+O(log n) parallel communication steps with v...
详细信息
Presented is a new parallel processing wire routing algorithm that can control path quality in two point connections and find a quasi-minimum Steiner tree for multi-point connections. A parallel rip-up technique for f...
详细信息
In this paper we show that any two-terminal channel routing problem of density d can be solved in a two-layer grid of width ω =(3/2)d + 0(1) by using a model in which two wires are permitted to overlap for not more t...
详细信息
A new heuristic algorithm for two-dimensional routing utilizing two distinct layers is described. It is assumed that all terminals are on the boundary of a rectilinear routing region with or without cutout sections. T...
详细信息
A general method for automatic routing, based on a channel splitting approach, is presented. A weighted graph depicting multilayer partitions and allowing expected channel occupancy estimation is introduced. Problems ...
详细信息
This paper has focused on the realization of every arbitrary permutation with the shuffle-exchange network. Permutation properties of shuffle-exchange networks are studied and are used to demonstrate several universal...
详细信息
This paper has focused on the realization of every arbitrary permutation with the shuffle-exchange network. Permutation properties of shuffle-exchange networks are studied and are used to demonstrate several universal networks. It is concluded that 3(log2 N) –1 passes through a single-stage regular shuffle exchange network are sufficient to realize every arbitrary permutation where N is network size. A routing algorithm is also developed to calculate control settings of the shuffle-exchange switches for the permutation realization. Three optimal universal networks, namely, expanded direct- connection shuffle-exchange network, multiple-pass omega network, and modified shuffle-exchange network are then exploited for better interconnection purposes. In addition, this work specifies the inherent relationship between the shuffle-exchange network and the Benes binary network so that designers can have a broad prospect.
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.
暂无评论