{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T16:44:27Z","timestamp":1783529067203,"version":"3.55.0"},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[1999,12]]},"abstract":"<jats:p> This paper presents two simple all-to-all broadcasting algorithms on honeycomb mesh. Consider a network with n processors, one has personalized routing strategy at each node and it requires a 3n communication time complexity. This communication time can be reduced to n because the computation time is always assumed to be much lower than the communication time. The other is based on a Hamiltonian path and has a 2n communication time complexity. We show how they can be used to get parallel solutions to a class of problems on honeycomb networks, among others Prefix Sums, Maximal Vectors, Maximal Sum Subsegment, Parenthesis Matching, Decoding Binary Tree, and Sorting. In our knowledge, these all-to-all broadcast algorithms are the only ones so far exhibited on a honeycomb. <\/jats:p>","DOI":"10.1142\/s0129626499000505","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T13:10:49Z","timestamp":1051276249000},"page":"539-550","source":"Crossref","is-referenced-by-count":24,"title":["ALL-TO-ALL BROADCASTING ALGORITHMS ON HONEYCOMB NETWORKS AND APPLICATIONS"],"prefix":"10.1142","volume":"09","author":[{"given":"JEAN","family":"CARLE","sequence":"first","affiliation":[{"name":"Facult\u00e9 de Math\u00e9matiques et  d'Informatique, Universit\u00e9 de Picardie Jules Verne, 33 Rue Saint-Leu Amiens, 80039 Cedex 1, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"JEAN-FREDERIC","family":"MYOUPO","sequence":"additional","affiliation":[{"name":"Facult\u00e9 de Math\u00e9matiques et  d'Informatique, Universit\u00e9 de Picardie Jules Verne, 33 Rue Saint-Leu Amiens, 80039 Cedex 1, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"DAVID","family":"SEME","sequence":"additional","affiliation":[{"name":"Facult\u00e9 de Math\u00e9matiques et  d'Informatique, Universit\u00e9 de Picardie Jules Verne, 33 Rue Saint-Leu Amiens, 80039 Cedex 1, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"p_2","first-page":"515","author":"Akl S.G.","year":"1989","journal-title":"Proc. IFIP Congress"},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1016\/0262-8856(89)90044-9"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1109\/T-VT.1982.23925"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1016\/0097-8493(84)90038-4"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1109\/5.48829"},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054192000024"},{"key":"p_16","doi-asserted-by":"publisher","DOI":"10.1109\/71.485530"},{"key":"p_17","doi-asserted-by":"publisher","DOI":"10.1109\/71.629486"},{"key":"p_18","doi-asserted-by":"publisher","DOI":"10.1021\/ci00024a002"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626499000505","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T16:20:11Z","timestamp":1565108411000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626499000505"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,12]]},"references-count":9,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[1999,12]]}},"alternative-id":["10.1142\/S0129626499000505"],"URL":"https:\/\/doi.org\/10.1142\/s0129626499000505","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,12]]}}}