699 research outputs found
Routing in Optical Multistage Interconnection Networks: a Neural Network Solution
There has been much interest in using optics to implement computer
interconnection networks. However, there has been little discussion of
any routing methodologies besides those already used in electronics.
In this paper, a neural network routing methodology is proposed that can
generate control bits for an optical multistage interconnection
network (OMIN). Though we present no optical implementation of this
methodology, we illustrate its control for an optical interconnection
network. These OMINs may be used as communication media for shared memory,
distributed computing systems.The routing methodology makes use of an
Artificial Neural Network (ANN) that functions as a parallel computer for
generating the routes. The neural network routing scheme may be applied to
electrical as well as optical interconnection networks.However, since
the ANN can be implemented using optics, this routing approach is especially
appealing for an optical computing environment. The parallel nature of the ANN
computation may make this routing scheme faster than conventional routing
approaches, especially for OMINs that are irregular. Furthermore, the neural
network routing scheme is fault-tolerant. Results are shown for generating
routes in a 16 times 16, 3 stage OMIN.
(Also cross-referenced as UMIACS-TR-94-21.
Devices and networks for optical switching
This thesis is concerned with some aspects of the application of optics to switching and computing. Two areas are dealt with: the design of switching networks which use optical interconnects, and the development and application of the t-SEED optical logic device. The work on optical interconnects looks at the multistage interconnection network which has been proposed as a hybrid switch using both electronics and optics. It is shown that the architecture can be mapped from one dimensional to two dimensional format, so that the machine makes full use of the space available to the optics. Other mapping rules are described which allow the network to make optimum use of the optical interconnects, and the endpoint is a hybrid optical-electronic machine which should be able to outperform an all-electronic equivalent. The development of the t-SEED optical logic device is described, which is the integration of a phototransistor with a multiple quantum well optical modulator. It is found to be important to have the modulator underneath rather than on top of the transistor to avoid unwanted thyristor action. In order for the transistor to have a high gain the collector must have a low doping level, the exit window in the substrate must be etched all the way to the emitter layer, and the etch must not damage the emitter-base junction. A real optical gain of 1.6 has been obtained, which is higher than has ever been reached before but is not as high as should be possible. Improvements to the device are suggested. A new model of the Fabry-Perot cavity is introduced which helps considerably in the interpretation of experimental measurements made on the quantum well modulators. Also a method of improving the contrast of the multiple quantum well modulator by grading the well widths is proposed which may find application in long wavelength transmission modulators. Some systems which make use of the t-SEED are considered. It is shown that the t-SEED device has the right characteristics for use as a neuron element in the optical implementation of a neural network. A new image processing network for clutter removal in binary images is introduced which uses the t-SEED, and a brief performance analysis suggests that the network may be superior to an all-electronic machine
Simulated Annealing Routing and Wavelength Lower Bound Estimation on WDM Optical Multistage Networks
Multistage interconnection networks (MINs) are popular in switching and communication applications and have been used in telecommunication and parallel computing systems for many years. Crosstalk a major problem introduced by an optical MIN, is caused by coupling two signals within a switching element. We focus on an efïŹcient solution to avoiding crosstalk by routing trafïŹc through an N3N optical network to avoid coupling two signals within each switching element using wavelength-division multiplexing (WDM) and a time-division approach. Under the constraint of avoiding crosstalk, the interest is on realizing a permutation that uses the minimum number of passes for routing. This routing problem is an NP-hard problem. Many heuristic algorithms are already designed by researchers to perform this routing such as a sequential algorithm, a degree-descending algorithm, etc. The genetic algorithm is used successfully to improve the performance over the heuristic algorithms. The drawback of the genetic algorithm is its long running times. We use the simulated annealing algorithm to improve the performance of solving the problem and optimizing the result. In addition, a wavelength lower bound estimate on the minimum number of passes required is calculated and compared to the results obtained using heuristic, genetic, and simulated annealing algorithms. Many cases are tested and the results are compared to the results of other algorithms to show the advantages of simulated annealing algorithm
Performance evaluation of data-driven techniques for the softwarized and agnostic management of an NĂN photonic switch
The emerging Software Defined Networking (SDN) paradigm paves the way for flexible and automatized management at each layer. The SDN-enabled optical network requires each network elementâs software abstraction to enable complete control by the centralized network controller. Nowadays, silicon photonics due to its low energy consumption, low latency, and small footprint is a promising technology for implementing photonic switching topologies, enabling transparent lightpath routing in re-configurable add-drop multiplexers. To this aim, a model for the complete management of photonic switching systemsâ control states is fundamental for network control. Typically, photonics-based switches are structured by exploiting the modern technology of Photonic Integrated Circuit (PIC) that enables complex elementary cell structures to be driven individually. Thus PIC switchesâ control states are combinations of a large set of elementary controls, and their definition is a challenging task. In this scenario, we propose the use of several data-driven techniques based on Machine Learning (ML) to model the control states of a PIC NĂN photonic switch in a completely blind manner. The proposed ML-based techniques are trained and tested in a completely topological and technological agnostic way, and we envision their application in a real-time control plane. The proposed techniquesâ scalability and accuracy are validated by considering three different switching topologies: the Honey-Comb Rearrangeable Optical Switch (HCROS), Spanke-BeneĆĄ, and the BeneĆĄ network. Excellent results in terms of predicting the control states are achieved for all of the considered topologies
Information Switching Processor (ISP) contention analysis and control
Future satellite communications, as a viable means of communications and an alternative to terrestrial networks, demand flexibility and low end-user cost. On-board switching/processing satellites potentially provide these features, allowing flexible interconnection among multiple spot beams, direct to the user communications services using very small aperture terminals (VSAT's), independent uplink and downlink access/transmission system designs optimized to user's traffic requirements, efficient TDM downlink transmission, and better link performance. A flexible switching system on the satellite in conjunction with low-cost user terminals will likely benefit future satellite network users
Using Recurrent Neural Networks to Learn the Structure of Interconnection Networks
A modified Recurrent Neural Network (RNN) is used to learn a
Self-Routing Interconnection Network (SRIN)
from a set of routing examples. The RNN is modified so
that it has several distinct initial states. This
is equivalent to a single RNN learning multiple different
synchronous sequential machines. We define such a
sequential machine structure as augmented and show that
a SRIN is essentially an Augmented Synchronous Sequential Machine (ASSM).
As an example, we learn a small six-switch SRIN.
After training we extract the network's internal representation
of the ASSM and corresponding SRIN.
(Also cross-referenced as UMIACS-TR-94-20.
Efficient and Robust Neuromorphic Computing Design
In recent years, brain inspired neuromorphic computing system (NCS) has been intensively studied in both circuit level and architecture level. NCS has demonstrated remarkable advantages for its high-energy efficiency, extremely compact space occupation and parallel data processing. However, due to the limited hardware resources, severe IR-Drop and process variation problems for synapse crossbar, and limited synapse device resolution, itâs still a great challenge for hardware
NCS design to catch up with the fast development of software deep neural networks (DNNs). This dissertation explores model compression and acceleration methods for deep neural networks to save both memory and computation resources for the hardware implementation of DNNs. Firstly, DNNsâ weights quantization work is presented to use three orthogonal methods to learn synapses with one-level precision, namely, distribution-aware quantization, quantization regularization and bias tuning, to make image classification accuracy comparable to the state-ofthe-art. And then a two-step framework named group scissor, including rank clipping and group connection deletion methods, is presented to address the problems on large synapse crossbar
consuming and high routing congestion between crossbars.
Results show that after applying weights quantization methods, accuracy drop can be well controlled within negligible level for MNIST and CIFAR-10 dataset, compared to an ideal system without quantization. And for the group scissor framework method, crossbar area and routing area could be reduced to 8% (at most) of original size, indicating that the hardware implementation area has been saved a lot. Furthermore, the system scalability has been improved significantly
- âŠ