File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Portable and scalable algorithm for irregular all-to-all communication

TitlePortable and scalable algorithm for irregular all-to-all communication
Authors
Issue Date2002
PublisherAcademic Press. The Journal's web site is located at http://www.elsevier.com/locate/jpdc
Citation
Journal Of Parallel And Distributed Computing, 2002, v. 62 n. 10, p. 1493-1526 How to Cite?
AbstractIn irregular all-to-all communication, messages are exchanged between every pair of processors. The message sizes vary from processor to processor and are known only at run time. This is a fundamental communication primitive in parallelizing irregularly structured scientific computations. Our algorithm reduces the total number of message start-ups. It also reduces node contention by smoothing out the lengths of the messages communicated. As compared to the earlier approaches, our algorithm provides deterministic performance and also reduces the buffer space at the nodes during message passing. The performance of the algorithm is characterised using a simple communication model of high-performance computing (HPC) platforms. We show the implementation on T3D and SP2 using C and the message passing interface standard. These can be easily ported to other HPC platforms. The results show the effectiveness of the proposed technique as well as the interplay among the machine size, the variance in message length, and the network interface. © 2002 Elsevier Science (USA).
Persistent Identifierhttp://hdl.handle.net/10722/89114
ISSN
2015 Impact Factor: 1.32
2015 SCImago Journal Rankings: 0.851
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorLiu, Wen_HK
dc.contributor.authorWang, CLen_HK
dc.contributor.authorPrasanna, VKen_HK
dc.date.accessioned2010-09-06T09:52:34Z-
dc.date.available2010-09-06T09:52:34Z-
dc.date.issued2002en_HK
dc.identifier.citationJournal Of Parallel And Distributed Computing, 2002, v. 62 n. 10, p. 1493-1526en_HK
dc.identifier.issn0743-7315en_HK
dc.identifier.urihttp://hdl.handle.net/10722/89114-
dc.description.abstractIn irregular all-to-all communication, messages are exchanged between every pair of processors. The message sizes vary from processor to processor and are known only at run time. This is a fundamental communication primitive in parallelizing irregularly structured scientific computations. Our algorithm reduces the total number of message start-ups. It also reduces node contention by smoothing out the lengths of the messages communicated. As compared to the earlier approaches, our algorithm provides deterministic performance and also reduces the buffer space at the nodes during message passing. The performance of the algorithm is characterised using a simple communication model of high-performance computing (HPC) platforms. We show the implementation on T3D and SP2 using C and the message passing interface standard. These can be easily ported to other HPC platforms. The results show the effectiveness of the proposed technique as well as the interplay among the machine size, the variance in message length, and the network interface. © 2002 Elsevier Science (USA).en_HK
dc.languageengen_HK
dc.publisherAcademic Press. The Journal's web site is located at http://www.elsevier.com/locate/jpdcen_HK
dc.relation.ispartofJournal of Parallel and Distributed Computingen_HK
dc.titlePortable and scalable algorithm for irregular all-to-all communicationen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0743-7315&volume=62&issue=10&spage=1493&epage=1526&date=2002&atitle=Portable+and+scalable+algorithm+for+irregular+all-to-all+communication+en_HK
dc.identifier.emailWang, CL:clwang@cs.hku.hken_HK
dc.identifier.authorityWang, CL=rp00183en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1016/S0743-7315(02)91862-9en_HK
dc.identifier.scopuseid_2-s2.0-0036798740en_HK
dc.identifier.hkuros95571en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0036798740&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume62en_HK
dc.identifier.issue10en_HK
dc.identifier.spage1493en_HK
dc.identifier.epage1526en_HK
dc.identifier.isiWOS:000178620200001-
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridLiu, W=7407340793en_HK
dc.identifier.scopusauthoridWang, CL=7501646188en_HK
dc.identifier.scopusauthoridPrasanna, VK=7005057102en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats