Queues allocation for multiple input-queued switches

J. S.C. Wu, R. Miler, Tsern-Huei Lee, Ying-Dar Lin

研究成果: Conference contribution同行評審

摘要

To meet the increasing requirement for high speed switches, a multiple input-queued (MIQ) switch is explored. Rather than handling the scheduling problem heavily focused on by many researchers, a proposed dynamic queue allocation algorithm is used to handle non-uniform or hot-spot traffic. Although the performance of the original algorithm is analyzed by N.K. Sharma and M.R. Pinnu (see Parallel Computing, vol.23, p.777-81, 1997) and the orderly property is enhanced by us, Wu and Lin, (see Parallel Computing, vol.24, p.2143-8, 1998), the correctness of the algorithm has not been proven yet. In this report, with the help of the inherent properties of FIFO queues, we prove that the algorithm, and the related MIQ switch, is free from deadlock.

原文English
主出版物標題Joint 4th IEEE International Conference on ATM, ICATM 2001 and High Speed Intelligent Internet Symposium
發行者Institute of Electrical and Electronics Engineers Inc.
頁面143-147
頁數5
ISBN(電子)0780370937, 9780780370937
DOIs
出版狀態Published - 1 一月 2001
事件4th IEEE International Conference on ATM, ICATM 2001 and High Speed Intelligent Internet Symposium - Seoul, Korea, Republic of
持續時間: 22 四月 200125 四月 2001

出版系列

名字Joint 4th IEEE International Conference on ATM, ICATM 2001 and High Speed Intelligent Internet Symposium

Conference

Conference4th IEEE International Conference on ATM, ICATM 2001 and High Speed Intelligent Internet Symposium
國家Korea, Republic of
城市Seoul
期間22/04/0125/04/01

指紋 深入研究「Queues allocation for multiple input-queued switches」主題。共同形成了獨特的指紋。

引用此