Fault-Tolerant Multiprocessors with Redundant-Path Interconnection Networks
IEEE Transactions on Computers - The MIT Press scientific computation series
Space multiplexing of waveguides in optically interconnected multiprocessor systems
The Computer Journal - Special issue on object-oriented programming
Pipelined communications in optically interconnected arrays
Journal of Parallel and Distributed Computing
IEEE Transactions on Computers
Dynamic reconfiguration of optically interconnected networks with time-division multiplexing
Journal of Parallel and Distributed Computing
A high-speed interconnection paradigm and its applications to optical interconnection networks
A high-speed interconnection paradigm and its applications to optical interconnection networks
Time-Division Optical Communications in Multiprocessor Arrays
IEEE Transactions on Computers
Using the Dual Path Property of Omega Networks to Obtain Conflict-Free Message Routing
IEEE Transactions on Parallel and Distributed Systems
Resource allocation in rectangular SW banyans
ISCA '82 Proceedings of the 9th annual symposium on Computer Architecture
Study of multistage SIMD interconnection networks
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
Banyan networks for partitioning multiprocessor systems
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
IEEE Transactions on Parallel and Distributed Systems
TDM and TWDM de Bruijn Networks and ShuffleNets for Optical Communications
IEEE Transactions on Computers
IEEE/ACM Transactions on Networking (TON)
On scheduling all-to-all personalized connections and cost-effective designs in WDM rings
IEEE/ACM Transactions on Networking (TON)
Distributed Path Reservation Algorithms for Multiplexed All-Optical Interconnection Networks
IEEE Transactions on Computers
Performing Permutations on Interconnection Networks by Regularly Changing Switch States
IEEE Transactions on Parallel and Distributed Systems
Compiled communication for all-optical TDM networks
Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
Optimal All-to-All Personalized Exchange in a Class of Optical Multistage Networks
IEEE Transactions on Parallel and Distributed Systems
Embedding Binary X-Trees and Pyramids in Processor Arrays with Spanning Buses
IEEE Transactions on Parallel and Distributed Systems
Modeling Compiled Communication Costs in Multiplexed Optical Networks
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Does Time-Division Multiplexing Close the Gap between Memory and Optical Communication Speeds?
PCRCW '97 Proceedings of the Second International Workshop on Parallel Computer Routing and Communication
IEEE Transactions on Parallel and Distributed Systems
Recent developments in optical multistage networks
Optical networks
HPCA '95 Proceedings of the 1st IEEE Symposium on High-Performance Computer Architecture
HPCA '96 Proceedings of the 2nd IEEE Symposium on High-Performance Computer Architecture
Distributed, Dynamic Control of Circuit-Switched Banyan Networks
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Low Diameter Interconnections for Routing in High-Performance Parallel Systems
IEEE Transactions on Computers
Analysis of space-time tradeoffs in photonic switching networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
A high speed scheduler/controller for unbuffered banyan networks
Computer Communications
| Hi-index | 0.01 |
Time division multiplexed multistage interconnection networks (TDM-MIN's) are proposed for multiprocessor communications. Connections required by an application are partitioned into a number of subsets, called mappings, such that connections in each mapping can be established in an MIN without conflict. Switch settings for establishing connections in each mapping are determined and stored in shift registers. By repeatedly changing switch settings, connections in each mapping are established for a time slot in a round-robin fashion. Thus, all connections required by an application may be established in an MIN in a time division multiplexed way. TDM-MIN's can emulate a completely connected network using N time slots. It can also emulate regular networks such as rings, meshes, cube-connected-cycles (CCC), binary trees, and n-dimensional hypercubes using 2, 4, 3, 4, and n time slots, respectively. The problem of partitioning an arbitrary set of requests into a minimal number of mappings is NP-hard. Simple heuristic algorithms are presented and their performances are shown to be close to optimal. The flexibility of TDM-MIN's allows for the support of run-time requests through dynamic reconfigurations. The techniques are especially suitable for hybrid electro-optical systems with optical interconnects.