File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: D-LQF: An efficient distributed scheduling algorithm for input-queued switches

TitleD-LQF: An efficient distributed scheduling algorithm for input-queued switches
Authors
KeywordsDistributed operations
Exhaustive service
Extensive simulations
High-speed switches
Input queued switch
Issue Date2011
PublisherIEEE.
Citation
The 2011 IEEE International Conference on Communications (ICC 2011), Kyoto, Japan, 5-9 June 2011. In Proceedings of the IEEE ICC, 2011, p. 1-5 How to Cite?
AbstractDue to the massive use of parallel and distributed operations of inputs and outputs, iterative scheduling algorithms are attractive in finding a maximal size matching for an input-queued switch. For constructing a large high-speed switch, a distributed multi-chip implementation of an iterative scheduling algorithm should be followed. Since different chips may locate on different switch linecards and linecards can be separated by tens of meters, the propagation delay between chips/linecards is non-negligible. This calls for a pipelined implementation of a single-iteration scheduling algorithm. In this paper, an efficient, pipelined single-iteration algorithm called Distributed Longest Queue First (D-LQF) is proposed. In D-LQF, exhaustive service policy is adopted for reusing the matched input-output pairs in the previous time slot. To avoid incorrectly granting an empty VOQ from transmission (caused by inter-chip latency), each output keeps track of the lengths of all VOQs destined to it. As compared with other single-iteration scheduling algorithms, extensive simulation results show that D-LQF provides the best delay-throughput performance. © 2011 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/140253
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorHe, Cen_HK
dc.contributor.authorYeung, KLen_HK
dc.date.accessioned2011-09-23T06:09:19Z-
dc.date.available2011-09-23T06:09:19Z-
dc.date.issued2011en_HK
dc.identifier.citationThe 2011 IEEE International Conference on Communications (ICC 2011), Kyoto, Japan, 5-9 June 2011. In Proceedings of the IEEE ICC, 2011, p. 1-5en_HK
dc.identifier.issn0536-1486en_HK
dc.identifier.urihttp://hdl.handle.net/10722/140253-
dc.description.abstractDue to the massive use of parallel and distributed operations of inputs and outputs, iterative scheduling algorithms are attractive in finding a maximal size matching for an input-queued switch. For constructing a large high-speed switch, a distributed multi-chip implementation of an iterative scheduling algorithm should be followed. Since different chips may locate on different switch linecards and linecards can be separated by tens of meters, the propagation delay between chips/linecards is non-negligible. This calls for a pipelined implementation of a single-iteration scheduling algorithm. In this paper, an efficient, pipelined single-iteration algorithm called Distributed Longest Queue First (D-LQF) is proposed. In D-LQF, exhaustive service policy is adopted for reusing the matched input-output pairs in the previous time slot. To avoid incorrectly granting an empty VOQ from transmission (caused by inter-chip latency), each output keeps track of the lengths of all VOQs destined to it. As compared with other single-iteration scheduling algorithms, extensive simulation results show that D-LQF provides the best delay-throughput performance. © 2011 IEEE.en_HK
dc.languageengen_US
dc.publisherIEEE.-
dc.relation.ispartofProceedings of the IEEE International Conference on Communications, ICC 2011en_HK
dc.rightsIEEE International Conference on Communications. Copyright © IEEE.-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
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.subjectDistributed operations-
dc.subjectExhaustive service-
dc.subjectExtensive simulations-
dc.subjectHigh-speed switches-
dc.subjectInput queued switch-
dc.titleD-LQF: An efficient distributed scheduling algorithm 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/icc.2011.5962553en_HK
dc.identifier.scopuseid_2-s2.0-80052147946en_HK
dc.identifier.hkuros195087en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-80052147946&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage1-
dc.identifier.epage5-
dc.description.otherThe 2011 IEEE International Conference on Communications (ICC 2011), Kyoto, Japan, 5-9 June 2011. In Proceedings of the IEEE ICC, 2011, p. 1-5-
dc.identifier.scopusauthoridHe, C=48861573400en_HK
dc.identifier.scopusauthoridYeung, KL=7202424908en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats