Journal Article10.1109/TNET.2005.863706
Matching output queueing with a multiple input/output-queued switch
Hyoung-II Lee,Seung-Woo Seo +1 more
16
TL;DR: It is demonstrated that the MIOQ switch requires two crossbar switches in parallel and two physical memories at each input and output to emulate an output-queued switch with no speedup of any component.
read more
Abstract: We have previously proposed an efficient switch architecture called multiple input/output-queued (MIOQ) switch and showed that the MIOQ switch can match the performance of an output-queued switch statistically. In this paper, we prove theoretically that the MIOQ switch can match the output queueing exactly , not statistically, with no speedup of any component. More specifically, we show that the MIOQ switch with two parallel switches (which we call a parallel MIOQ (PMIOQ) switch in this paper) can provide exact emulation of an output-queued switch with a broad class of service scheduling algorithms including FIFO, weighted fair queueing (WFQ) and strict priority queueing regardless of incoming traffic pattern and switch size. To do that, we first propose the stable strategic alliance (SSA) algorithm that can produce a stable many-to-many assignment, and prove its finite, stable and deterministic properties. Next, we apply the SSA algorithm to the scheduling of a PMIOQ switch with two parallel switches, and show that the stability condition of the SSA algorithm guarantees for the PMIOQ switch to emulate an output-queued switch exactly. To avoid possible conflicts in a parallel switch, each input-output pair matched by the SSA algorithm must be mapped to one of two crossbar switches. For this mapping, we also propose a simple algorithm that requires at most 2N steps for all matched input-output pairs. In addition, to relieve the implementation burden of N input buffers being accessed simultaneously, we propose a buffering scheme called redundant buffering which requires two memory devices instead of N physically-separate memories. In conclusion, we demonstrate that the MIOQ switch requires two crossbar switches in parallel and two physical memories at each input and output to emulate an output-queued switch with no speedup of any component.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Cyclic stable matching for three-sided networking services
Lin Cui,Weijia Jia +1 more
TL;DR: It is shown that the problem of seeking an optimal stable matching with maximum cardinality is NP-hard and efficient algorithms for the restricted model of TMSC problem to find a stable matching are proposed.
36
Patent
Method and system of profiling applications that use virtual memory
Brian Cruickshank,Oliver P. Sohm +1 more
- 15 May 2006
TL;DR: In this paper, the authors present a method and system of profiling applications that use virtual memory, which is similar to the one described in this paper, but with a different virtual to physical memory mapping.
33
A Switch Design for Real-Time Industrial Networks
Qixin Wang,Sathish Gopalakrishnan,Xue Liu,Lui Sha +3 more
- 22 Apr 2008
TL;DR: This work proposes a real-time switch design using a crossbar switching fabric that simplifies analysis, provides isolation, and facilitates future hierarchical scheduling and flow aggregation, and is better adapted to providing high bandwidths and low latencies.
Adapting a Main-Stream Internet Switch Architecture for Multihop Real-Time Industrial Networks
TL;DR: It is proved that the global scheduling can be reduced to a preemptive open shop scheduling problem; as long as every input/output needs to send/fetch no more than M cells per M cell-time clock-period, all outputs schedules do not conflict; and the scheduling algorithm takes O(N4) time.
Contention-tolerant crossbar packet switches
TL;DR: It is proved that 100% throughput can be achieved with internal speedup 2 or using two layers of CTC(N) fabric mathematically, and two approaches are considered: using internal speed up and using space multiplexing withoutinternal speedup.
10
References
•Book
Introduction to Algorithms
Thomas H. Cormen,Charles E. Leiserson,Ronald L. Rivest +2 more
- 01 Jan 1990
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
24.8K
Introduction to algorithms: 4. Turtle graphics
TL;DR: In this article, a language similar to logo is used to draw geometric pictures using this language and programs are developed to draw geometrical pictures using it, which is similar to the one we use in this paper.
15.4K
College Admissions and the Stability of Marriage
David Gale,Lloyd S. Shapley +1 more
TL;DR: In this article, the authors studied the relationship between college admission and the stability of marriage in the United States, and found that college admission is correlated with the number of stable marriages.
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case
Abhay Parekh,Robert G. Gallager +1 more
TL;DR: Worst-case bounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of generalized processor sharing (GPS) servers and the effectiveness of PGPS in guaranteeing worst-case session delay is demonstrated under certain assignments.
The iSLIP scheduling algorithm for input-queued switches
TL;DR: This paper presents a scheduling algorithm called iSLIP, an iterative, round-robin algorithm that can achieve 100% throughput for uniform traffic, yet is simple to implement in hardware, and describes the implementation complexity of the algorithm.