File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Minimizing the communication overhead of iterative scheduling algorithms for input-queued switches

TitleMinimizing the communication overhead of iterative scheduling algorithms for input-queued switches
Authors
KeywordsiSLIP
Input-queued switch
Single-iteration scheduling algorithm
Issue Date2011
PublisherIEEE. The Journal's web site is located at http://www.ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000308
Citation
Globecom - IEEE Global Telecommunications Conference, 2011 How to Cite?
AbstractCommunication overhead should be minimized when designing iterative scheduling algorithms for input-queued packet switches. In general, the overall communication overhead is a function of the number of iterations required per time slot (M) and the data bits exchanged in an input-output pair per iteration (B). In this paper, we aim at maximizing switch throughput while minimizing communication overhead. We first propose a single-iteration scheduling algorithm called Highest Rank First (HRF). In HRF, the highest priority is given to the preferred input-output pair calculated in each local port at a RR (Round Robin) order. Only when the preferred VOQ(i,j) is empty, input i sends a request with a rank number r to each output. The request from a longer VOQ carries a smaller r. Higher scheduling priority is given to the request with a smaller r. To further cut down its communication overhead to 1 bit per request, we design HRF with Request Compression (HRF/RC). The basic idea is that we transmit a single bit code in request phase. Then r can be decoded at output ports from the current and historical codes received. The overall communication overhead for HRF/RC becomes 2 bits only, i.e. 1 bit in request phase and 1 bit in grant phase. We show that HRF/RC renders a much lower hardware cost than multi-iteration algorithms and a single-iteration algorithm π-RGA [11]. Compared with other iterative algorithms with the same communication overhead (i.e. SRR [10] and 1-iteration iSLIP [6]), simulation results show that HRF/RC always produces the best delay-throughput performance. © 2011 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/140256
References

 

DC FieldValueLanguage
dc.contributor.authorHu, Ben_HK
dc.contributor.authorYeung, KLen_HK
dc.contributor.authorZhang, Zen_HK
dc.date.accessioned2011-09-23T06:09:19Z-
dc.date.available2011-09-23T06:09:19Z-
dc.date.issued2011en_HK
dc.identifier.citationGlobecom - IEEE Global Telecommunications Conference, 2011en_HK
dc.identifier.urihttp://hdl.handle.net/10722/140256-
dc.description.abstractCommunication overhead should be minimized when designing iterative scheduling algorithms for input-queued packet switches. In general, the overall communication overhead is a function of the number of iterations required per time slot (M) and the data bits exchanged in an input-output pair per iteration (B). In this paper, we aim at maximizing switch throughput while minimizing communication overhead. We first propose a single-iteration scheduling algorithm called Highest Rank First (HRF). In HRF, the highest priority is given to the preferred input-output pair calculated in each local port at a RR (Round Robin) order. Only when the preferred VOQ(i,j) is empty, input i sends a request with a rank number r to each output. The request from a longer VOQ carries a smaller r. Higher scheduling priority is given to the request with a smaller r. To further cut down its communication overhead to 1 bit per request, we design HRF with Request Compression (HRF/RC). The basic idea is that we transmit a single bit code in request phase. Then r can be decoded at output ports from the current and historical codes received. The overall communication overhead for HRF/RC becomes 2 bits only, i.e. 1 bit in request phase and 1 bit in grant phase. We show that HRF/RC renders a much lower hardware cost than multi-iteration algorithms and a single-iteration algorithm π-RGA [11]. Compared with other iterative algorithms with the same communication overhead (i.e. SRR [10] and 1-iteration iSLIP [6]), simulation results show that HRF/RC always produces the best delay-throughput performance. © 2011 IEEE.en_HK
dc.languageengen_US
dc.publisherIEEE. The Journal's web site is located at http://www.ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000308-
dc.relation.ispartofGLOBECOM - IEEE Global Telecommunications Conferenceen_HK
dc.rights©2011 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectiSLIPen_HK
dc.subjectInput-queued switchen_HK
dc.subjectSingle-iteration scheduling algorithmen_HK
dc.titleMinimizing the communication overhead of iterative scheduling algorithms for input-queued switchesen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailYeung, KL:kyeung@eee.hku.hken_HK
dc.identifier.authorityYeung, KL=rp00204en_HK
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/GLOCOM.2011.6134339en_HK
dc.identifier.scopuseid_2-s2.0-84863172232-
dc.identifier.hkuros195091en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-84857218605&selection=ref&src=s&origin=recordpageen_HK
dc.description.otherProceedings of the IEEE Global Telecommunications Conference (GLOBECOM 2011), Houston, TX, USA, 5-9 December 2011-
dc.identifier.scopusauthoridHu, B=36617158500en_HK
dc.identifier.scopusauthoridYeung, KL=7202424908en_HK
dc.identifier.scopusauthoridZhang, Z=55005636600en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats