File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Barrier synchronization on wormhole-routed networks

TitleBarrier synchronization on wormhole-routed networks
Authors
KeywordsBandwidth-preempting technique
Barrier message
Barrier synchronization
Data message
Network topology
Tree-based routing
Issue Date2001
PublisherI E E E. The Journal's web site is located at http://www.computer.org/tpds
Citation
Ieee Transactions On Parallel And Distributed Systems, 2001, v. 12 n. 6, p. 583-597 How to Cite?
AbstractIn this paper, we propose an efficient barrier synchronization scheme on networks with arbitrary topologies. We first present a distributed method in building a barrier routing tree. The barrier messages can be delivered adaptively according to the hierarchy of the established barrier tree to void congestion and faulty nodes in the network. We then propose a new technique, called bandwidth-preempting technique, for a blocked barrier message to preempt a channel occupied by a data message so that the latency of a barrier message can be controlled without affecting much of the overall system performance. We also propose an analytical performance model and present simulation results for the performance evaluation of the proposed scheme. Performance evaluations show that the proposed scheme outperforms the existing algorithms for barrier synchronization.
Persistent Identifierhttp://hdl.handle.net/10722/44790
ISSN
2015 Impact Factor: 2.661
2015 SCImago Journal Rankings: 1.590
References

 

DC FieldValueLanguage
dc.contributor.authorSun, Yen_HK
dc.contributor.authorCheung, PYSen_HK
dc.contributor.authorLin, Xen_HK
dc.date.accessioned2007-10-30T06:10:18Z-
dc.date.available2007-10-30T06:10:18Z-
dc.date.issued2001en_HK
dc.identifier.citationIeee Transactions On Parallel And Distributed Systems, 2001, v. 12 n. 6, p. 583-597en_HK
dc.identifier.issn1045-9219en_HK
dc.identifier.urihttp://hdl.handle.net/10722/44790-
dc.description.abstractIn this paper, we propose an efficient barrier synchronization scheme on networks with arbitrary topologies. We first present a distributed method in building a barrier routing tree. The barrier messages can be delivered adaptively according to the hierarchy of the established barrier tree to void congestion and faulty nodes in the network. We then propose a new technique, called bandwidth-preempting technique, for a blocked barrier message to preempt a channel occupied by a data message so that the latency of a barrier message can be controlled without affecting much of the overall system performance. We also propose an analytical performance model and present simulation results for the performance evaluation of the proposed scheme. Performance evaluations show that the proposed scheme outperforms the existing algorithms for barrier synchronization.en_HK
dc.format.extent2506139 bytes-
dc.format.extent4863 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherI E E E. The Journal's web site is located at http://www.computer.org/tpdsen_HK
dc.relation.ispartofIEEE Transactions on Parallel and Distributed Systemsen_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rights©2001 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.subjectBandwidth-preempting techniqueen_HK
dc.subjectBarrier messageen_HK
dc.subjectBarrier synchronizationen_HK
dc.subjectData messageen_HK
dc.subjectNetwork topologyen_HK
dc.subjectTree-based routingen_HK
dc.titleBarrier synchronization on wormhole-routed networksen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1045-9219&volume=12&issue=6&spage=583&epage=597&date=2001&atitle=Barrier+synchronization+on+wormhole-routed+networksen_HK
dc.identifier.emailCheung, PYS:paul.cheung@hku.hken_HK
dc.identifier.authorityCheung, PYS=rp00077en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/71.932712en_HK
dc.identifier.scopuseid_2-s2.0-0035363108en_HK
dc.identifier.hkuros54447-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0035363108&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume12en_HK
dc.identifier.issue6en_HK
dc.identifier.spage583en_HK
dc.identifier.epage597en_HK
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridSun, Y=8915654300en_HK
dc.identifier.scopusauthoridCheung, PYS=7202595335en_HK
dc.identifier.scopusauthoridLin, X=8208832700en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats