File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Contention-Free Complete Exchange Algorithms on Clusters

TitleContention-Free Complete Exchange Algorithms on Clusters
Authors
Issue Date2000
PublisherIEEE Computer Society.
Citation
IEEE International Conference on Cluster Computing Proceedings, Chemnitz, Germany, 28 November - 1 December 2000, p. 57-64 How to Cite?
AbstractTo construct a large commodity clustec a hierarchical network is generally adopted for connecting the host muchines, where a Gigabit backbone switch connects a few commodity switches with uplinks to achieve scaled bisectional bandwidth. This type of interconnection usually results in link contention and has congestion developed at the uplink ports. Moreover, the non-detenninistic delays on scheduling communication events in clusters accelerate the building up of congestion amongst these uplink ports, which lead to severe packets drop and hinder the overall performance. In this paper, we focus on the practical design of high-speed complete exchange algorithm on a commodity cluster interconnected by a hierarchical Ethemet-based network. By exploiting some architectural characteristics of the interconnection in optimizing the performunce of a complete exchange algorithm, we introduce a congestion control mechanism - global windowing that monitors and regulates the trafic load, together with a permutation scheme - reorder scheme that effectively alleviates the congestion problem. We evaluate our algorithm and compare its performance with other algorithms in a PC cluster connected by various types of switches, including Gigabit Ethernet, input-buffered and shared-memory Fast Ethernet switches.
Persistent Identifierhttp://hdl.handle.net/10722/45626
ISSN

 

DC FieldValueLanguage
dc.contributor.authorTam, ATCen_HK
dc.contributor.authorWang, CLen_HK
dc.date.accessioned2007-10-30T06:30:35Z-
dc.date.available2007-10-30T06:30:35Z-
dc.date.issued2000en_HK
dc.identifier.citationIEEE International Conference on Cluster Computing Proceedings, Chemnitz, Germany, 28 November - 1 December 2000, p. 57-64en_HK
dc.identifier.issn1552-5244en_HK
dc.identifier.urihttp://hdl.handle.net/10722/45626-
dc.description.abstractTo construct a large commodity clustec a hierarchical network is generally adopted for connecting the host muchines, where a Gigabit backbone switch connects a few commodity switches with uplinks to achieve scaled bisectional bandwidth. This type of interconnection usually results in link contention and has congestion developed at the uplink ports. Moreover, the non-detenninistic delays on scheduling communication events in clusters accelerate the building up of congestion amongst these uplink ports, which lead to severe packets drop and hinder the overall performance. In this paper, we focus on the practical design of high-speed complete exchange algorithm on a commodity cluster interconnected by a hierarchical Ethemet-based network. By exploiting some architectural characteristics of the interconnection in optimizing the performunce of a complete exchange algorithm, we introduce a congestion control mechanism - global windowing that monitors and regulates the trafic load, together with a permutation scheme - reorder scheme that effectively alleviates the congestion problem. We evaluate our algorithm and compare its performance with other algorithms in a PC cluster connected by various types of switches, including Gigabit Ethernet, input-buffered and shared-memory Fast Ethernet switches.en_HK
dc.format.extent835117 bytes-
dc.format.extent1786 bytes-
dc.format.extent6534 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherIEEE Computer Society.en_HK
dc.relation.ispartofIEEE International Conference on Cluster Computing Proceedings-
dc.rights©2000 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.en_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.titleContention-Free Complete Exchange Algorithms on Clustersen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1552-5244&volume=&spage=57&epage=64&date=2000&atitle=Contention-Free+Complete+Exchange+Algorithms+on+Clustersen_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/CLUSTR.2000.889001en_HK
dc.identifier.hkuros57359-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats