文档介绍：A Request-Grant-Accept Switching Algorithm
For An Input Queued Switch
PG student
Department of CSE
Mepco Schlenk Engineering College
Sivakasi.
Dr. Kannan Balasubramanian
Professor
Department of CSE
Mepco schlenk Engineering College
Sivakasi
Abstract— An iterative switching algorithm for an input queued switch consists of a number of iterations in every time step, where each putes a disjoint matching. If input i is matched to output j in a given iteration, a packet is forwarded from i to j in the corresponding time of the iterative switching algorithms use Request Grant Accept arbitration type. This particular type of arbitration the puted in one iteration is not necessarily maximal. Multiple iterations make the time step larger and reduce the speed of the switch. We present a new iterative switching algorithm called ∏-RGA. In ∏-RGA algorithm the number of iterations is possibly limited to one, hence reducing the time step and allowing the switch to run at a higher speed. ∏-RGA achieves relatively high throughput in practice under uniform and non-uniform traffic patterns with one iteration and no speedup.
We measure the throughput of the algorithm and number of iterations taken to perform the putation.
Keywords— Input queued switch, iterative switching algorithms,
matching algorithms, number of iterations, speedup.