File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Nearest-neighbor algorithms for load-balancing in parallel computers

TitleNearest-neighbor algorithms for load-balancing in parallel computers
Authors
Issue Date1995
Citation
Concurrency Practice And Experience, 1995, v. 7 n. 7, p. 707-736 How to Cite?
AbstractTwo nearest-neighbor algorithms, the dimension-exchange and the diffusion methods and their variants - optimally tuned dimension-exchange (ODE) and optimally tuned diffusion (ODF) are compared. The comparison is made with respect to both one-port and all-port communication architectures and in considerations of various implementation strategies including synchronous/asynchronous invocation policies and static/dynamic random workload behaviors. Result show that the dimension exchange method outperforms the diffusion method in one-port communication model. In particular, the ODE algorithm is best suited for statically synchronous implementations of a load-balancing process regardless of its underlying communication models. The strength of the diffusion method is in asynchronous implementations in the all-port communication model; the ODF is algorithm performs best in that case.
Persistent Identifierhttp://hdl.handle.net/10722/152253
ISSN
2002 Impact Factor: 0.56

 

DC FieldValueLanguage
dc.contributor.authorXu, Chengzhongen_US
dc.contributor.authorMonien, Burkharden_US
dc.contributor.authorLuling, Reinharden_US
dc.contributor.authorLau, Francis CMen_US
dc.date.accessioned2012-06-26T06:36:45Z-
dc.date.available2012-06-26T06:36:45Z-
dc.date.issued1995en_US
dc.identifier.citationConcurrency Practice And Experience, 1995, v. 7 n. 7, p. 707-736en_US
dc.identifier.issn1040-3108en_US
dc.identifier.urihttp://hdl.handle.net/10722/152253-
dc.description.abstractTwo nearest-neighbor algorithms, the dimension-exchange and the diffusion methods and their variants - optimally tuned dimension-exchange (ODE) and optimally tuned diffusion (ODF) are compared. The comparison is made with respect to both one-port and all-port communication architectures and in considerations of various implementation strategies including synchronous/asynchronous invocation policies and static/dynamic random workload behaviors. Result show that the dimension exchange method outperforms the diffusion method in one-port communication model. In particular, the ODE algorithm is best suited for statically synchronous implementations of a load-balancing process regardless of its underlying communication models. The strength of the diffusion method is in asynchronous implementations in the all-port communication model; the ODF is algorithm performs best in that case.en_US
dc.languageengen_US
dc.relation.ispartofConcurrency Practice and Experienceen_US
dc.rightsConcurrency and Computation: Practice & Experience. Copyright © John Wiley & Sons Ltd.-
dc.titleNearest-neighbor algorithms for load-balancing in parallel computersen_US
dc.typeArticleen_US
dc.identifier.emailLau, Francis CM:fcmlau@cs.hku.hken_US
dc.identifier.authorityLau, Francis CM=rp00221en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0029388135en_US
dc.identifier.hkuros8374-
dc.identifier.volume7en_US
dc.identifier.issue7en_US
dc.identifier.spage707en_US
dc.identifier.epage736en_US
dc.identifier.scopusauthoridXu, Chengzhong=8701888000en_US
dc.identifier.scopusauthoridMonien, Burkhard=7004261863en_US
dc.identifier.scopusauthoridLuling, Reinhard=6507296482en_US
dc.identifier.scopusauthoridLau, Francis CM=7102749723en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats