{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T13:40:57Z","timestamp":1777902057059,"version":"3.51.4"},"reference-count":22,"publisher":"SAGE Publications","issue":"4-5","license":[{"start":{"date-parts":[[2004,5,1]],"date-time":"2004-05-01T00:00:00Z","timestamp":1083369600000},"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":["SIMULATION"],"published-print":{"date-parts":[[2004,5]]},"abstract":"<jats:p>Broadcast is an important communication operation required by many real-world applications encountered in parallel, cluster, and grid computing environments. Broadcasting on regular networks has been widely investigated in the past. However, most of the existing algorithms handle broadcast in a sequential manner and do not scale well; as a consequence, many applications cannot be efficiently supported using existing algorithms. In an effort to avoid this limitation, this article presents a new broadcast algorithm based on coded path routing. In addition to its simplicity, the proposed algorithm has shown to be capable of performing the broadcast operation in a fixed number of message-passing steps, irrespective of the network size. An extensive simulation study has been conducted to evaluate the performance of the proposed algorithm under different traffic working conditions. The analysis reveals that the new algorithm exhibits superior performance characteristics over those of the well-known recursive-doubling and extended-dominating node algorithms.<\/jats:p>","DOI":"10.1177\/0037549704044325","type":"journal-article","created":{"date-parts":[[2004,9,13]],"date-time":"2004-09-13T20:00:29Z","timestamp":1095105629000},"page":"207-220","source":"Crossref","is-referenced-by-count":0,"title":["A Simulation Study of Scalable Broadcast in High-Performance Regular Networks"],"prefix":"10.1177","volume":"80","author":[{"given":"A. Y.","family":"Al-Dubai","sequence":"first","affiliation":[{"name":"Department of Computing Science, University of Glasgow, Glasgow G12 8RZ, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Ould-Khaoua","sequence":"additional","affiliation":[{"name":"Department of Computing Science, University of Glasgow, Glasgow G12 8RZ, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. S.","family":"Obaidat","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Monmouth University, W. Long Branch, NJ                         07764,"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2004,5,1]]},"reference":[{"key":"atypb1","first-page":"155","volume-title":"Proceedings of the 20th IEEE International Performance, Computing & Communications Conference (ICPPP\u20192001)","author":"Al-Dubai, A. Y."},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1996.0074"},{"key":"atypb3","volume-title":"Interconnection networks: An engineering approach","author":"Duato, J.","year":"1997"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1109\/71.334899"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1016\/S1383-7621(99)00049-1"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1109\/2.191995"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1109\/71.744844"},{"key":"atypb8","volume-title":"CSIM: A C-based, process-oriented simulation language","author":"Schwetman, H. D.","year":"1985"},{"key":"atypb9","first-page":"57","volume-title":"Proceedings of MASCOTS\u20191993","author":"McKinley, P. K."},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1109\/71.744837"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1109\/71.569654"},{"key":"atypb12","first-page":"288","volume-title":"Proceedings of the International Conference on Parallel Processing","author":"McKinley, P. K."},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.2000.1642"},{"key":"atypb14","volume-title":"Efficient collective communication on multidimensional meshes with wormhole routing","author":"Watts, J.","year":"1994"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1372"},{"key":"atypb16","first-page":"8","volume-title":"Proceedings of the 1995 Challenges in Parallel Processing Workshop","author":"Panda, D. K."},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1109\/2.476198"},{"key":"atypb18","first-page":"116","volume-title":"Proceedings of the International Symposium on Computer Architecture","author":"Lin, X."},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1016\/S1383-7621(00)00007-2"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1109\/71.485503"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(02)00014-2"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1109\/71.663877"}],"container-title":["SIMULATION"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0037549704044325","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0037549704044325","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T11:18:32Z","timestamp":1777634312000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/0037549704044325"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,5]]},"references-count":22,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2004,5]]}},"alternative-id":["10.1177\/0037549704044325"],"URL":"https:\/\/doi.org\/10.1177\/0037549704044325","relation":{},"ISSN":["0037-5497","1741-3133"],"issn-type":[{"value":"0037-5497","type":"print"},{"value":"1741-3133","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,5]]}}}