7 research outputs found
Permutation Routing in the Hypercube and Grid Topologies
The problem of edge disjoint path routing arises from applications in distributed memory parallel computing. We examine this problem in both the directed hypercube and two-dimensional grid topologies. Complexity results are obtained for these problems where the routing must consist entirely of shortest length paths. Additionally, approximation algorithms are presented for the case when the routing request is of a special form known as a permutation. Permutations simply require that no vertex in the graph may be used more than once as either a source or target for a routing request. Szymanski conjectured that permutations are always routable in the directed hypercube, and this remains an open problem
Random Routing and Concentration in Quantum Switching Networks
Flexible distribution of data in the form of quantum bits or qubits
among spatially separated entities is an essential component of
envisioned scalable quantum computing architectures. Accordingly, we
consider the problem of dynamically permuting groups of quantum bits,
i.e., qubit packets, using networks of reconfigurable quantum
switches.
We demonstrate and then explore the equivalence between the quantum
process of creation of packet superpositions and the process of
randomly routing packets in the corresponding classical network. In
particular, we consider an n × n Baseline network for which we
explicitly relate the pairwise input-output routing probabilities in
the classical random routing scenario to the probability amplitudes of
the individual packet patterns superposed in the quantum output state.
We then analyze the effect of using quantum random routing on a
classically non-blocking configuration like the Benes network. We
prove that for an n × n quantum Benes network, any input
packet assignment with no output contention is probabilistically
self-routable. In particular, we prove that with random routing on the
first (log n-1) stages and bit controlled self-routing on the last
log n stages of a quantum Benes network, the output packet
pattern corresponding to routing with no blocking is always present in
the output quantum state with a non-zero probability. We give a lower
bound on the probability of observing such patterns on measurement at
the output and identify a class of 2n-1 permutation patterns for
which this bound is equal to 1, i.e., for all the permutation
patterns in this class the following is true: in every pattern
in the quantum output assignment all the valid input packets are
present at their correct output addresses.
In the second part of this thesis we give the complete design of
quantum sparse crossbar concentrators. Sparse crossbar concentrators
are rectangular grids of simple 2 × 2 switches or crosspoints,
with the switches arranged such that any k inputs can be connected
to some k outputs. We give the design of the quantum crosspoints for
such concentrators and devise a self-routing method to concentrate
quantum packets. Our main result is a rigorous proof that certain
crossbar structures, namely, the fat-slim and banded quantum crossbars
allow, without blocking, the realization of all concentration patterns
with self-routing.
In the last part we consider the scenario in which quantum packets are
queued at the inputs to an n × n quantum non-blocking
switch. We assume that each packet is a superposition of m classical
packets. Under the assumption of uniform traffic, i.e., any output is
equally likely to be accessed by a packet at an input we find the
minimum value of m such that the output quantum state contains at
least one packet pattern in which no two packets contend for the same
output. Our calculations show that for m=9 the probability of a
non-contending output pattern occurring in the quantum output is
greater than 0.99 for all n up to 64
Automated Debugging Methodology for FPGA-based Systems
Electronic devices make up a vital part of our lives. These are seen from mobiles, laptops, computers, home automation, etc. to name a few. The modern designs constitute billions of transistors. However, with this evolution, ensuring that the devices fulfill the designer’s expectation under variable conditions has also become a great challenge. This requires a lot of design time and effort. Whenever an error is encountered, the process is re-started. Hence, it is desired to minimize the number of spins required to achieve an error-free product, as each spin results in loss of time and effort.
Software-based simulation systems present the main technique to ensure the verification of the design before fabrication. However, few design errors (bugs) are likely to escape the simulation process. Such bugs subsequently appear during the post-silicon phase. Finding such bugs is time-consuming due to inherent invisibility of the hardware. Instead of software simulation of the design in the pre-silicon phase, post-silicon techniques permit the designers to verify the functionality through the physical implementations of the design. The main benefit of the methodology is that the implemented design in the post-silicon phase runs many order-of-magnitude faster than its counterpart in pre-silicon. This allows the designers to validate their design more exhaustively.
This thesis presents five main contributions to enable a fast and automated debugging solution for reconfigurable hardware. During the research work, we used an obstacle avoidance system for robotic vehicles as a use case to illustrate how to apply the proposed debugging solution in practical environments.
The first contribution presents a debugging system capable of providing a lossless trace of debugging data which permits a cycle-accurate replay. This methodology ensures capturing permanent as well as intermittent errors in the implemented design. The contribution also describes a solution to enhance hardware observability. It is proposed to utilize processor-configurable concentration networks, employ debug data compression to transmit the data more efficiently, and partially reconfiguring the debugging system at run-time to save the time required for design re-compilation as well as preserve the timing closure.
The second contribution presents a solution for communication-centric designs. Furthermore, solutions for designs with multi-clock domains are also discussed.
The third contribution presents a priority-based signal selection methodology to identify the signals which can be more helpful during the debugging process. A connectivity generation tool is also presented which can map the identified signals to the debugging system.
The fourth contribution presents an automated error detection solution which can help in capturing the permanent as well as intermittent errors without continuous monitoring of debugging data. The proposed solution works for designs even in the absence of golden reference.
The fifth contribution proposes to use artificial intelligence for post-silicon debugging. We presented a novel idea of using a recurrent neural network for debugging when a golden reference is present for training the network. Furthermore, the idea was also extended to designs where golden reference is not present
Managing scheduled routing with a high-level communications language
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1997.Includes bibliographical references (p. 152-156).by Christopher D. Metcalf.Ph.D
O(n) routing in rearrangeable networks
In (2n- 1)-stage rearrangeable networks, the routing time for any arbitrary permutation is X(n²) compared to its propagation delay O(n) only. Here, we attempt to identify the sets of permutations, which are routable in O(n) time in these networks. We define four classes of self-routable permutations for Benes network. An O(n) algorithm is presented here, that identi®es if any permutation P belongs to one of the proposed self-routable classes, and if yes, it also generates the necessary control vectors for routing P. Therefore, the identification, as well as the switch setting, both problems are resolved in O(n) time by this algorithm. It covers all the permutations that are self-routable by anyone of the proposed techniques. Some interesting relationships are also explored among these four classes of permutations, by applying the concept of "group-transformations" [N. Das, B.B. Bhattacharya, J. Dattagupta, Hierarchical classification of permutation classes in multistage interconnection networks, IEEE Trans. Comput. (1993) 665--677] on these permutations. The concepts developed here for Benes network, can easily be extended to a class of (2n-1)-stage networks, which are topologically equivalent to Benes network. As a result, the set of permutations routable in a (2n-1)-stage rearrangeable network, in a time comparable to its propagation delay has been extended to a large extent