File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: An analytical comparison of nearest neighbor algorithms for load balancing in parallel computers

TitleAn analytical comparison of nearest neighbor algorithms for load balancing in parallel computers
Authors
KeywordsComputers
Computer architecture
Issue Date1995
PublisherIEEE. The Journal's web site is located at http://www.ipdps.org
Citation
The IEEE 9th International Parallel Processing Symposium, Santa Barbara, CA., 25-28 April 1995. In International Parallel Processing Symposium Proceedings, 1995, p. 472-479 How to Cite?
AbstractWith nearest neighbor load balancing algorithms, a processor makes balancing decisions based on its local information and manages work load migrations within its neighborhood. This paper compares a couple of fairly well-known nearest neighbor algorithms, the dimension exchange and the diffusion methods and their variants in terms of their performances in both one-port and all-port communication architectures. It turns out that the dimension exchange method outperforms the diffusion method in the one-port communication model, and that the strength of the diffusion method is in asynchronous implementations in the all-port communication model. The underlying communication networks considered assume the most popular topologies, the mesh and the torus and their special cases: the hypercube and the k-ary n-cube.
Persistent Identifierhttp://hdl.handle.net/10722/45548
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorXu, CZen_HK
dc.contributor.authorMonien, Ben_HK
dc.contributor.authorLuling, Ren_HK
dc.contributor.authorLau, FCMen_HK
dc.date.accessioned2007-10-30T06:28:56Z-
dc.date.available2007-10-30T06:28:56Z-
dc.date.issued1995en_HK
dc.identifier.citationThe IEEE 9th International Parallel Processing Symposium, Santa Barbara, CA., 25-28 April 1995. In International Parallel Processing Symposium Proceedings, 1995, p. 472-479en_HK
dc.identifier.issn1063-7133en_HK
dc.identifier.urihttp://hdl.handle.net/10722/45548-
dc.description.abstractWith nearest neighbor load balancing algorithms, a processor makes balancing decisions based on its local information and manages work load migrations within its neighborhood. This paper compares a couple of fairly well-known nearest neighbor algorithms, the dimension exchange and the diffusion methods and their variants in terms of their performances in both one-port and all-port communication architectures. It turns out that the dimension exchange method outperforms the diffusion method in the one-port communication model, and that the strength of the diffusion method is in asynchronous implementations in the all-port communication model. The underlying communication networks considered assume the most popular topologies, the mesh and the torus and their special cases: the hypercube and the k-ary n-cube.en_HK
dc.languageengen_HK
dc.publisherIEEE. The Journal's web site is located at http://www.ipdps.orgen_HK
dc.relation.ispartofInternational Parallel Processing Symposium Proceedings-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rights©1995 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.subjectComputersen_HK
dc.subjectComputer architectureen_HK
dc.titleAn analytical comparison of nearest neighbor algorithms for load balancing in parallel computersen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1063-7133&volume=&spage=472&epage=479&date=1995&atitle=An+analytical+comparison+of+nearest+neighbor+algorithms+for+load+balancing+in+parallel+computersen_HK
dc.identifier.emailLau, Francis CM: fcmlau@cs.hku.hk-
dc.identifier.authorityLau, Francis CM=rp00221-
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/IPPS.1995.395973en_HK
dc.identifier.scopuseid_2-s2.0-0029227482-
dc.identifier.hkuros1243-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0029227482&selection=ref&src=s&origin=recordpage-
dc.identifier.spage472-
dc.identifier.epage479-
dc.publisher.placeUnited States-
dc.identifier.scopusauthoridXu, Chengzhong=8701888000-
dc.identifier.scopusauthoridMonien, Burkhard=7004261863-
dc.identifier.scopusauthoridLuling, Reinhard=6507296482-
dc.identifier.scopusauthoridLau, Francis CM=7102749723-
dc.customcontrol.immutablesml 160105 - merged-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats