File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Realistic communication model for parallel computing on cluster

TitleRealistic communication model for parallel computing on cluster
Authors
Issue Date1999
PublisherIEEE Computer Society.
Citation
The 1st IEEE Computer Society International Workshop on Cluster Computing, Melbourne, VIC., Australia, 2-3 December 1999, p. 92-101 How to Cite?
AbstractWe present a model for parallel computation on commodity cluster. Our cluster model is targeted as a tool for performance analysis and algorithm design. We abstract the communication event by means of local and remote data movements, and explicitly expose the contention problems by capturing them in our parameters. To validate our model, we compare the prediction accuracy of our model with the Postal model for the popular tree-based broadcast algorithm. Our model provides good prediction accuracy and answers to some performance issues that are missing in existing models. We examine the gather collective operation, in which contention delay dominates its overall execution time. Based on the model, we design a communication schedule for the gather operation that is based on the upper and lower bounds, in which the congestion behavior could be under our control and achieve optimal results by avoiding data loss.
Persistent Identifierhttp://hdl.handle.net/10722/45614
ISBN

 

DC FieldValueLanguage
dc.contributor.authorTam, ACTen_HK
dc.contributor.authorWang, CLen_HK
dc.date.accessioned2007-10-30T06:30:19Z-
dc.date.available2007-10-30T06:30:19Z-
dc.date.issued1999en_HK
dc.identifier.citationThe 1st IEEE Computer Society International Workshop on Cluster Computing, Melbourne, VIC., Australia, 2-3 December 1999, p. 92-101en_HK
dc.identifier.isbn0-7695-0343-8en_HK
dc.identifier.urihttp://hdl.handle.net/10722/45614-
dc.description.abstractWe present a model for parallel computation on commodity cluster. Our cluster model is targeted as a tool for performance analysis and algorithm design. We abstract the communication event by means of local and remote data movements, and explicitly expose the contention problems by capturing them in our parameters. To validate our model, we compare the prediction accuracy of our model with the Postal model for the popular tree-based broadcast algorithm. Our model provides good prediction accuracy and answers to some performance issues that are missing in existing models. We examine the gather collective operation, in which contention delay dominates its overall execution time. Based on the model, we design a communication schedule for the gather operation that is based on the upper and lower bounds, in which the congestion behavior could be under our control and achieve optimal results by avoiding data loss.en_HK
dc.format.extent201956 bytes-
dc.format.extent1802 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 Computer Society International Workshop on Cluster Computing-
dc.rights©1999 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.titleRealistic communication model for parallel computing on clusteren_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0-7695-0343-8&volume=&spage=92&epage=101&date=1999&atitle=Realistic+communication+model+for+parallel+computing+on+clusteren_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/IWCC.1999.810813en_HK
dc.identifier.hkuros51479-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats