{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T22:57:03Z","timestamp":1777676223754,"version":"3.51.4"},"reference-count":11,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2004,2,1]],"date-time":"2004-02-01T00:00:00Z","timestamp":1075593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The International Journal of High Performance Computing Applications"],"published-print":{"date-parts":[[2004,2]]},"abstract":"<jats:p>The performance of the MPI's collective communications is critical in most MPI-based applications. A general algorithm for a given collective communication operation may not give good performance on all systems due to the differences in architectures, network parameters and the storage capacity of the underlying MPI implementation. Hence, collective communications have to be tuned for the system on which they will be executed. In order to determine the optimum parameters of collective communications on a given system in a time-efficient manner, the collective communications need to be modeled efficiently. In this paper, we discuss various techniques for modeling collective communications.<\/jats:p>","DOI":"10.1177\/1094342004041297","type":"journal-article","created":{"date-parts":[[2004,4,21]],"date-time":"2004-04-21T21:27:18Z","timestamp":1082582838000},"page":"159-167","source":"Crossref","is-referenced-by-count":10,"title":["Towards an Accurate Model for Collective Communications"],"prefix":"10.1177","volume":"18","author":[{"given":"Sathish S.","family":"Vadhiyar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Graham E.","family":"Fagg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jack J.","family":"Dongarra","sequence":"additional","affiliation":[{"name":"COMPUTER SCIENCE DEPARTMENT UNIVERSITY OF TENNESSEE, KNOXVILLE, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2004,2,1]]},"reference":[{"key":"atypb1","doi-asserted-by":"crossref","unstructured":"Culler, D., Karp, R., Patterson, D., Sahay, A., Schauser, K. E., Santos, E., Subramonian, R., and von Eicken, T. May 1993. LogP: towards a realistic model of parallel computation . In Proceedings of the Symposium on Principles and Practice of Parallel Programming, San Diego, CA, pp. 1\u201312 .","DOI":"10.1145\/155332.155333"},{"key":"atypb2","doi-asserted-by":"crossref","unstructured":"Fagg, G. E. and Dongarra, J. J. 2000. FT-MPI: fault tolerant MPI, supporting dynamic applications in a dynamic world . In Proceedings of EuroPVM-MPI 2000, Lecture Notes in Computer Science Vol. 1908, Springer-Verlag, Berlin, pp. 346\u2013353 .","DOI":"10.1007\/3-540-45255-9_47"},{"key":"atypb3","doi-asserted-by":"crossref","unstructured":"Fagg, G. E., Vadhiyar, S. S., and Dongarra, J. J. 2000. ACCT: automatic collective communications tuning . In Proceedings of EuroPVM-MPI 2000, Lecture Notes in Computer Science Vol. 1908, Springer-Verlag, Berlin, pp. 354\u2013361 .","DOI":"10.1007\/3-540-45255-9_48"},{"key":"atypb4","doi-asserted-by":"crossref","unstructured":"Frigo, M. 1998. FFTW: an adaptive software architecture for the FFT . In Proceedings of the ICASSP Conference, Vol. 3, pp. 1381-1381 .","DOI":"10.1109\/ICASSP.1998.681704"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01379320"},{"key":"atypb6","unstructured":"Huse, L. P. September 1999. Collective communication on dedicated clusters of workstations . In Proceedings of the 6th European PVM\/MPI Users\u2019 Group Meeting, Barcelona, Spain, LNCS Vol. 1697, Springer-Verlag, Berlin. pp. 469\u2013476 ."},{"key":"atypb7","unstructured":"Kielmann, T., Bal, H. E., and Gorlatch, S. May 2000. Bandwidth-efficient collective communication for clustered wide area systems. In IPDPS 2000, Cancun, Mexico ."},{"key":"atypb8","unstructured":"Rabenseifner, R. 1997. A new optimized MPI reduce algorithm. http:\/\/www.hlrs.de\/organization\/par\/services\/models\/mpi\/myreduce.html."},{"key":"atypb9","unstructured":"Snir, M., Otto, S., Huss-Lederman, S., Walker, D., and Dongarra, J. 1998. MPI \u2013 the complete reference. In The MPI Core, Vol. 1, 2nd edition."},{"key":"atypb10","doi-asserted-by":"crossref","unstructured":"Vadhiyar, S. S., Fagg, G. E., and Dongarra, J. J. November 2000. Automatically tuned collective communications . In Proceedings of SuperComputing2000, Dallas, TX.","DOI":"10.1109\/SC.2000.10024"},{"key":"atypb11","doi-asserted-by":"crossref","unstructured":"Whaley, R. C. and Dongarra, J. 1998. Automatically tuned linear algebra software. In SC98: High Performance Networking and Computing, Orlando, FL. See .","DOI":"10.1109\/SC.1998.10004"}],"container-title":["The International Journal of High Performance Computing Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1094342004041297","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1094342004041297","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T08:18:03Z","timestamp":1777450683000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/1094342004041297"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,2]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,2]]}},"alternative-id":["10.1177\/1094342004041297"],"URL":"https:\/\/doi.org\/10.1177\/1094342004041297","relation":{},"ISSN":["1094-3420","1741-2846"],"issn-type":[{"value":"1094-3420","type":"print"},{"value":"1741-2846","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,2]]}}}