The crossbar is the most popular packet switch architecture. By adding small buffers at the crosspoints, important advantages can be obtained: (1) Crossbar scheduling is simplified. (2) High throughput is achievable. (3) Weighted scheduling becomes feasible. In this paper we study the fairness properties of a buffered crossbar with weighted fair schedulers. We show by means of simulation that, ...

MEMS optical switch technology is one of the key technologies in Wavelength Division Multiplexing (WDM) optical networks. Although the 2-D MEMS optical switch technology is mature, the commonly used crossbar architecture is not amenable to building large switches. In this paper, we propose a design of 2 × 2 switching modules, and use it to build large 2-D MEMS optical switches with architecture...

We present a new input-queued switch architecture designed to support deadline-ordered scheduling at extremely high-speeds. In particular, deadline-ordered scheduling is enabled through a combination of hardware-based sorted priority queues called P-heaps and a round-robin crossbar scheduler. The priority queues are implemented using a novel scalable pipelined heap-based architecture. Using a 0...

We propose a most economical design of the Optical Shared MemOry Supercomputer Interconnect System (OSMOSIS) all-optical, wavelength-space crossbar switch fabric. It is shown, by analysis and simulation, that the total number of on-off gates required for the proposed N × N switch fabric can scale asymptotically as N ln N if the number of input/output ports N can be factored into a product of sm...

Crossbar switch is a key component of communication switches used in networks. Allocation of resources has a direct impact on packet transmission. A poor allocation results in long transmission delays. Hence, switches must include an arbiter that efficiently allocates the crossbar’s resources. In this brief, a novel VLSI CMOS implementation of a high performance wrapped wave front arbitration (...

Most high-end switches use an input-queued or a combined inputand output-queued architecture. The switch fabrics of these architectures commonly use an iterative scheduling system such as iSLIP. Iterative schedulers are not very scalable and can be slow. We propose a new scheduling algorithm that finds a maximum matching of a modified I/O mapping graph in a single iteration (hence noniterative)...

Conventional processing infrastructures have been challenged by huge demand of stream-based applications. The industry responded by introducing traditional stream processing engines along-with emerged technologies. The ongoing paradigm embraces parallel computing as the most-suitable proposition. Pipelining and Parallelism have been intensively studied in recent years, yet parallel programming ...

Interconnection networks are important parts of modern computing systems, facilitating communication between a system’s components. Switches connecting various nodes of an interconnection network serve to move data in the network. The switch’s delay and throughput impact the overall performance of the network and thus the system. Scheduling efficient movement of data through a switch and config...

Internet routers frequently use a crossbar switch to interconnect linecards. The crossbar switch is scheduled using an algorithm that picks a new crossbar configuration every cycle. Several scheduling algorithms have been shown to guarantee 100% throughput under a variety of traffic patterns. The first such algorithm was the maximum weight matching (MWM) algorithm in which the weight is the sum...