{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T06:10:23Z","timestamp":1698127823051},"reference-count":23,"publisher":"Wiley","issue":"7","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":5062,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1992,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A natural communication problem in a multicomputer system, such as the hypercube, is that a processor (called the <jats:italic>source<\/jats:italic>) wants to send a message to a number of other processors <jats:italic>(destinations)<\/jats:italic>. A message\u2010routing paradigm for such a multidestination communication has been formulated as finding a subgraph called an <jats:italic>Optimal Communication Tree<\/jats:italic> (OCT). We prove that the problem of finding an OCT is NP\u2010hard for the <jats:italic>n<\/jats:italic>\u2010cube graph as well as for a graph whose maximum degree is at most three. Heuristics for finding <jats:italic>suboptimal<\/jats:italic> communication trees for the hypercube multicomputer are discussed.<\/jats:p>","DOI":"10.1002\/net.3230220703","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T13:21:24Z","timestamp":1178976084000},"page":"627-646","source":"Crossref","is-referenced-by-count":2,"title":["A message\u2010routing strategy for multicomputer systems"],"prefix":"10.1002","volume":"22","author":[{"given":"Hyeong\u2010Ah","family":"Choi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdol\u2010Hossein","family":"Esfahanian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"Ametek Computer Research Division Ametek System 14 User's Guide: C Edition Version 2.0 May (1986)."},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1983.1095818"},{"key":"e_1_2_1_4_2","unstructured":"J. E.BrandenburgandD. S.Scott Embeddings of communication trees and grids into hypercubes. Technical Report Intel Scientific Computers (1985)."},{"key":"e_1_2_1_5_2","unstructured":"H.\u2010A.Choi A.\u2010H.Esfahanian andB.Houck Optimal communication trees with application to hypercube multicomputers.Proceedings of the 6th International Conference on Theory and Applications of Graph Theory Kalamazoo MI(1988)."},{"key":"e_1_2_1_6_2","doi-asserted-by":"crossref","unstructured":"W. J.DallyandC. L.Seitz Deadlock\u2010free message routing in multiprocessor interconnection networks.IEEE Trans. Comput.(1987)547\u2013553.","DOI":"10.1109\/TC.1987.1676939"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230090404"},{"key":"e_1_2_1_8_2","unstructured":"G. C.Fox The impact of specialized processors in elementary particles physics.Conference on Scientific Calculation with Ensemble Computers Pauda Italy(1983)."},{"key":"e_1_2_1_9_2","volume-title":"Computer and Intractability","author":"Garey M. R.","year":"1979"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1137\/0132072"},{"key":"e_1_2_1_11_2","unstructured":"D. C.GrunwaldandD. A.Reed Benchmarking hypercube hardware and software. Technical Report UIUCDCS\u2010R\u201086\u20101303 Department of Computer Science University of Illinois at Urbana\u2010Champaign (1986)."},{"key":"e_1_2_1_12_2","volume-title":"Graph Theory","author":"Harary F.","year":"1972"},{"key":"e_1_2_1_13_2","unstructured":"J. P.Hayes T. N.Mudge Q. F.Stout S.Colley andJ.Palmer Architecture of a hypercube supercomputer.Proceedings of 1986 International Conference on Parallel Processing August(1986)653\u2013660."},{"key":"e_1_2_1_14_2","unstructured":"C. T.HoandL. S.Johnson Distributed routing algorithms for broadcasting and personalized communication in hypercubes.Proceedings of the 1986 International Conference on Parallel Processing August(1986)640\u2013648."},{"key":"e_1_2_1_15_2","volume-title":"Computer Architecture and Parallel Processing","author":"Hwang K.","year":"1984"},{"key":"e_1_2_1_16_2","unstructured":"Y.Lan L. M.Ni andA.\u2010H.Esfahanian Relay approach message routing in hypercube multiprocessors.Proceedings of the 3rd International Conference on Supercomputing May(1988)174\u2013183."},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(90)90066-X"},{"key":"e_1_2_1_18_2","doi-asserted-by":"crossref","unstructured":"T. C.LeeandJ. P.Hayes Routing and broadcasting in faulty hypercube computers.The 3rd Conference on Hypercube Concurrent Computers and Applications January(1988)346\u2013354.","DOI":"10.1145\/62297.62335"},{"key":"e_1_2_1_19_2","unstructured":"C.MolerandD.Scott Communication utilities for the iPSC. iPSC Technical Report No. 2 Intel Scientific Computers (1986)."},{"key":"e_1_2_1_20_2","unstructured":"A. L. N.Reddy P.Banerjee andA. G.Abraham I\/O embedding in hypercubes. Proceedings of the 1988 International Conference on Parallel Processing August (1988) Vol. I 331\u2013338."},{"key":"e_1_2_1_21_2","unstructured":"Y.SaadandM.Schultz Data communication in hypercubes. Research Report 428 Department Computer Science Yale University (1985)."},{"key":"e_1_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1984.1676496"},{"key":"e_1_2_1_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/2465.2467"},{"key":"e_1_2_1_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02612335"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230220703","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230220703","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T09:40:09Z","timestamp":1698054009000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230220703"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,12]]},"references-count":23,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1992,12]]}},"alternative-id":["10.1002\/net.3230220703"],"URL":"https:\/\/doi.org\/10.1002\/net.3230220703","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,12]]}}}