{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T07:09:16Z","timestamp":1648710556801},"reference-count":39,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[1998,2]]},"DOI":"10.1016\/s0167-8191(98)00009-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:18:22Z","timestamp":1027639102000},"page":"267-286","source":"Crossref","is-referenced-by-count":0,"title":["Unicast-based multicast algorithm in wormhole-routed star graph interconnection networks"],"prefix":"10.1016","volume":"24","author":[{"given":"Jelena","family":"Mi\u0161i\u0107","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(98)00009-X_BIB1","unstructured":"S.B. Akers, D. Harel, B. Krishnamurthy, The star graph: An attractive alternative to the n-cube, in: Proc. 1987 International Conference on Parallel Processing, 1987, pp. 393\u2013400."},{"issue":"4","key":"10.1016\/S0167-8191(98)00009-X_BIB2","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1109\/12.21148","article-title":"A group-theoretic model for symmetric interconnection networks","volume":"38","author":"Akers","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-8191(98)00009-X_BIB3","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0167-8191(93)90107-V","article-title":"A novel routing scheme on the star and pancake networks and its applications","volume":"19","author":"Akl","year":"1993","journal-title":"Parallel Comput."},{"key":"10.1016\/S0167-8191(98)00009-X_BIB4","doi-asserted-by":"crossref","unstructured":"S. Akl, K. Qiu, I. Stojmenovic, Data communication and computational geometry on the star and pancake interconnection networks, in: Proc. of the 3rd IEEE Symposium on Parallel and Distributed Processing, 1991, pp. 415\u2013422.","DOI":"10.1109\/SPDP.1991.218211"},{"issue":"4","key":"10.1016\/S0167-8191(98)00009-X_BIB5","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1109\/12.494105","article-title":"Embedding an arbitrary binary tree into star graph","volume":"45","author":"Bagherzadeh","year":"1996","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"10.1016\/S0167-8191(98)00009-X_BIB6","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0020-0190(96)00165-2","article-title":"A grid embedding into the star graph for image analysis solutions","volume":"60","author":"Nassif","year":"1996","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0167-8191(98)00009-X_BIB7","doi-asserted-by":"crossref","unstructured":"M.M. De Azevedo, S. Latifi, N. Bagherzadeh, Low expansion packings and embeddings of hypercubes into star graphs, in: Proc. 1996 IEEE 15. Annual International Phoenix Conference on Computers and Communication, 1996, pp. 115\u2013122.","DOI":"10.1109\/PCCC.1996.493622"},{"issue":"5","key":"10.1016\/S0167-8191(98)00009-X_BIB8","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1109\/TC.1987.1676939","article-title":"Deadlock-free message routing in multiprocessor interconnection networks","volume":"36","author":"Dally","year":"1987","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"10.1016\/S0167-8191(98)00009-X_BIB9","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF01660031","article-title":"The torus routing chip","volume":"1","author":"Dally","year":"1986","journal-title":"J. Distrib. Comput."},{"issue":"1","key":"10.1016\/S0167-8191(98)00009-X_BIB10","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/71.262586","article-title":"A comparative study of topological properties of hypercubes and star graphs","volume":"5","author":"Day","year":"1994","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10.1016\/S0167-8191(98)00009-X_BIB11","unstructured":"R.F. DeMara, D.I. Moldovan, Performance indices for parallel marker-propagation, in: Proc. 1991 Int. Conf. Parallel Processing, 1991, pp. 658\u2013659."},{"key":"10.1016\/S0167-8191(98)00009-X_BIB12","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1006\/jpdc.1995.1006","article-title":"Optimal communication algorithms on star graphs using spanning tree constructions","volume":"24","author":"Fragopoulou","year":"1995","journal-title":"J. Parallel Distrib. Comput."},{"issue":"5","key":"10.1016\/S0167-8191(98)00009-X_BIB13","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1109\/71.282562","article-title":"A parallel algorithm for computing Fourier transforms on the star graph","volume":"5","author":"Fragopoulou","year":"1994","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10.1016\/S0167-8191(98)00009-X_BIB14","doi-asserted-by":"crossref","unstructured":"G. Guerraoui, A generic multicast primitive to support transactions on replicated objects in distributed systems, in: Proc. of the 5th IEEE Computer Society Workshop on Future Trends of Distributed Computing System, 1995, pp. 334\u2013342.","DOI":"10.1109\/FTDCS.1995.525002"},{"issue":"9","key":"10.1016\/S0167-8191(98)00009-X_BIB15","doi-asserted-by":"crossref","first-page":"1249","DOI":"10.1109\/12.29465","article-title":"Optimum broadcasting and personalized communication in hypercubes","volume":"38","author":"Johnson","year":"1989","journal-title":"IEEE Trans. Comput."},{"issue":"11","key":"10.1016\/S0167-8191(98)00009-X_BIB16","first-page":"2174","article-title":"Fast SIMD algorithm using multicast wormhole routing on a mesh","volume":"21","author":"Kim","year":"1994","journal-title":"J. Korea Info. Sci. Soc."},{"key":"10.1016\/S0167-8191(98)00009-X_BIB17","doi-asserted-by":"crossref","unstructured":"V. Kumar, V. Singh, Scalability of parallel algorithms for the all-pairs shortest path problem. Tech. Rep. ACT-OODS-058-90, Rev. 1. MCC, Jan. 1991.","DOI":"10.1016\/0743-7315(91)90083-L"},{"issue":"8","key":"10.1016\/S0167-8191(98)00009-X_BIB18","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1109\/71.298203","article-title":"Deadlock-free multicast wormhole routing in 2D mesh multicomputers","volume":"5","author":"Lin","year":"1994","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"12","key":"10.1016\/S0167-8191(98)00009-X_BIB19","doi-asserted-by":"crossref","first-page":"1252","DOI":"10.1109\/71.334899","article-title":"Unicast-based multicast communication in wormhole-routed networks","volume":"5","author":"McKinley","year":"1994","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10.1016\/S0167-8191(98)00009-X_BIB20","doi-asserted-by":"crossref","unstructured":"P.K. McKinley, H. Xu, E. Kalns, L.M. Ni, ComPaSS: Efficient communication services for scalable architectures, in: Proc. Supercomputing '92, Nov. 1992, pp. 478\u2013487.","DOI":"10.1109\/SUPERC.1992.236656"},{"key":"10.1016\/S0167-8191(98)00009-X_BIB21","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1006\/jpdc.1994.1082","article-title":"Routing function and deadlock avoidance in a star graph interconnection network","volume":"22","author":"Mi\u0161i\u0107","year":"1994","journal-title":"J. Parallel Distrib. Comput."},{"issue":"7","key":"10.1016\/S0167-8191(98)00009-X_BIB22","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1109\/71.296314","article-title":"Communication aspects of the star graph interconnection network","volume":"5","author":"Mi\u0161i\u0107","year":"1994","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10.1016\/S0167-8191(98)00009-X_BIB23","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0020-0190(94)90092-2","article-title":"On fault tolerance of the star graph interconnection network","volume":"49","author":"Jovanovi\u0107","year":"1994","journal-title":"Infom. Process. Lett."},{"issue":"1","key":"10.1016\/S0167-8191(98)00009-X_BIB24","doi-asserted-by":"crossref","DOI":"10.1142\/S0218126691000215","article-title":"Embedding of cycles and grids in star graphs","volume":"1","author":"Jwo","year":"1991","journal-title":"J. Circuits Syst. Comput."},{"key":"10.1016\/S0167-8191(98)00009-X_BIB25","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0020-0190(93)90060-M","article-title":"On fault-diameter of the star graph","volume":"46","author":"Latifi","year":"1993","journal-title":"Infom. Process. Lett."},{"issue":"11","key":"10.1016\/S0167-8191(98)00009-X_BIB26","doi-asserted-by":"crossref","first-page":"1220","DOI":"10.1109\/71.329666","article-title":"Task allocation in the star graph","volume":"5","author":"Latifi","year":"1994","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10.1016\/S0167-8191(98)00009-X_BIB27","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1006\/jpdc.1995.1155","article-title":"Migration of tasks in interconnection network based on the star graph","volume":"31","author":"Latifi","year":"1994","journal-title":"J. Parallel Distrib. Comput."},{"issue":"11","key":"10.1016\/S0167-8191(98)00009-X_BIB28","doi-asserted-by":"crossref","first-page":"1398","DOI":"10.1109\/12.247843","article-title":"A routing and broadcasting scheme on faulty star graph","volume":"42","author":"Latifi","year":"1993","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-8191(98)00009-X_BIB29","unstructured":"A. Menn, A.K. Somani, An efficient sorting algorithm for the star graph interconnection network, in: Proc. of ICCP, Vol. III, pp. 1\u20138, 1990."},{"key":"10.1016\/S0167-8191(98)00009-X_BIB30","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/2.191995","article-title":"A survey of wormhole routing techniques in direct networks","volume":"26","author":"Ni","year":"1993","journal-title":"IEEE Comput."},{"key":"10.1016\/S0167-8191(98)00009-X_BIB31","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1006\/jpdc.1994.1015","article-title":"Packet routing and PRAM emulation on star graphs and leveled networks","volume":"20","author":"Palis","year":"1994","journal-title":"J. Parallel Distrib. Comput."},{"issue":"2","key":"10.1016\/S0167-8191(98)00009-X_BIB32","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1006\/jpdc.1993.1098","article-title":"Embedding meshes on the star graph","volume":"19","author":"Ranka","year":"1993","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/S0167-8191(98)00009-X_BIB33","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1006\/jpdc.1994.1066","article-title":"On some properties and algorithms for the star and pancake interconnection networks","volume":"22","author":"Qiu","year":"1994","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/S0167-8191(98)00009-X_BIB34","doi-asserted-by":"crossref","unstructured":"K. Qiu, S.G. Akl, Load balancing and selection on the star and pancake interconnection networks, in: Proc. 26th Hawaii International Conference on System Sciences, Maui, HI, Vol. 2, Jan. 1993, pp. 235\u2013242.","DOI":"10.1109\/HICSS.1993.284105"},{"issue":"12","key":"10.1016\/S0167-8191(98)00009-X_BIB35","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0898-1221(93)90188-2","article-title":"Topological properties of star graphs","volume":"25","author":"Sur","year":"1993","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/S0167-8191(98)00009-X_BIB36","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1006\/jpdc.1996.0028","article-title":"Conditional fault diameter of star graph networks","volume":"33","author":"Rouskov","year":"1996","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/S0167-8191(98)00009-X_BIB37","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0020-0190(93)90087-P","article-title":"Fault diameter of star graphs","volume":"48","author":"Rouskov","year":"1993","journal-title":"Infom. Process. Lett."},{"issue":"1","key":"10.1016\/S0167-8191(98)00009-X_BIB38","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0167-9260(94)90021-3","article-title":"On VLSI layouts of the star graph and related networks","volume":"17","author":"Sukora","year":"1994","journal-title":"Integration VLSI J."},{"key":"10.1016\/S0167-8191(98)00009-X_BIB39","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/0743-7315(92)90031-H","article-title":"Efficient implementation of barrier synchronization in wormhole-routed hypercube multicomputers","volume":"16","author":"Xu","year":"1992","journal-title":"J. Parallel Distrib. Comput."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016781919800009X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016781919800009X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T07:21:53Z","timestamp":1555572113000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S016781919800009X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["S016781919800009X"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(98)00009-x","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1998,2]]}}}