55 research outputs found
Generalized hypercube structures and hyperswitch communication network
This paper discusses an ongoing study that uses a recent development in communication control technology to implement hybrid hypercube structures. These architectures are similar to binary hypercubes, but they also provide added connectivity between the processors. This added connectivity increases communication reliability while decreasing the latency of interprocessor message passing. Because these factors directly determine the speed that can be obtained by multiprocessor systems, these architectures are attractive for applications such as remote exploration and experimentation, where high performance and ultrareliability are required. This paper describes and enumerates these architectures and discusses how they can be implemented with a modified version of the hyperswitch communication network (HCN). The HCN is analyzed because it has three attractive features that enable these architectures to be effective: speed, fault tolerance, and the ability to pass multiple messages simultaneously through the same hyperswitch controller
Constructing Two Edge-Disjoint Hamiltonian Cycles in Locally Twisted Cubes
The -dimensional hypercube network is one of the most popular
interconnection networks since it has simple structure and is easy to
implement. The -dimensional locally twisted cube, denoted by , an
important variation of the hypercube, has the same number of nodes and the same
number of connections per node as . One advantage of is that the
diameter is only about half of the diameter of . Recently, some
interesting properties of were investigated. In this paper, we
construct two edge-disjoint Hamiltonian cycles in the locally twisted cube
, for any integer . The presence of two edge-disjoint
Hamiltonian cycles provides an advantage when implementing algorithms that
require a ring structure by allowing message traffic to be spread evenly across
the locally twisted cube.Comment: 7 pages, 4 figure
Recommended from our members
Shortest paths in orthogonal graphs
Orthogonal graphs were introduced as a simple but powerful tool for the description and analysis of a class of interconnection networks. Routing, and hence finding shortest paths between any two nodes of an orthogonal graph, becomes an important problem. It is shown in this paper that routing in this class of graphs reduces to a node covering problem in the bipartite coverage graph of the orthogonal graph. A minimum cover clearly leads to a shortest path. In general, the problem of finding the mínimum node cover in a bipartite graph is NP-complete. However, the bipartite coverage graphs corresponding to orthogonal graphs have a regular pattern of edges. This allows the development of a routing algorithm which results in a minimum cover. The procedure executes in polynomial time in the number of bit-nodes of the bipartite graph. It therefore results in a shortest path algorithm whose time complexity is quadratic in the logarithm of the number of nodes in the original orthogonal graph
Simple scalable switched control network
Рассматривается проектирование локальных управляющих сетей на базе квазиполных орграфов. Считается, что сеть содержит активное вычислительное ядро произвольных размеров и множество пассивных абонентов, последние не взаимодействуют друг с другом. Абоненты активного ядра имеют бесконфликтный параллельный доступ друг к другу и ко всем пассивным абонентам. В отличие от предложенных ранее сетей на базе квазиполных графов новая база позволяет существенно уменьшить сложность сетей и улучшить их масштабируемость. При этом сохраняются важнейшие функционалы сетей: бесконфликтность параллельных передач, отсутствие дедлоков, самомаршрутизируемость, схемная и канальная отказоустойчивость
- …