{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:30:13Z","timestamp":1742398213726},"reference-count":33,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"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":[[1999,2]]},"DOI":"10.1016\/s0167-8191(98)00105-7","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T04:06:40Z","timestamp":1051243600000},"page":"137-157","source":"Crossref","is-referenced-by-count":3,"title":["Fundamental data movement operations and its applications on a hyper-bus broadcast network"],"prefix":"10.1016","volume":"25","author":[{"given":"Horng-Ren","family":"Tsai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shi-Jinn","family":"Horng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tzong-Wann","family":"Kao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shung-Shing","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shun-Shan","family":"Tsai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(98)00105-7_BIB1","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/TC.1986.1676658","article-title":"Optimal bounds for finding maximum on array of processors with k global buses","volume":"35","author":"Aggarwal","year":"1986","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-8191(98)00105-7_BIB2","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1006\/jagm.1993.1018","article-title":"Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values","volume":"14","author":"Berkman","year":"1993","journal-title":"J. Algorithms"},{"key":"10.1016\/S0167-8191(98)00105-7_BIB3","doi-asserted-by":"crossref","unstructured":"D. Bhagavathi, V. Bokka, H. Gurla, S. Olariu, J.L. Schwing, I. Stojmenovic, J. Zhang, Time-optimal visibility-related algorithms on meshes with multiple broadcasting, Int. Parallel Processing Symp. (1994) 110\u2013114","DOI":"10.1109\/IPPS.1994.288313"},{"key":"10.1016\/S0167-8191(98)00105-7_BIB4","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1109\/TC.1984.1676405","article-title":"Finding maximum on an array processor with a global bus","volume":"33","author":"Bokhari","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-8191(98)00105-7_BIB5","unstructured":"P. Chaudhuri, Parallel Algorithms: Design and Analysis, Prentice-Hall, Reading, 1992"},{"key":"10.1016\/S0167-8191(98)00105-7_BIB6","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1109\/71.80135","article-title":"Designing efficient parallel algorithms on mesh-connected computers with multiple broadcasting","volume":"1","author":"Chen","year":"1990","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"key":"10.1016\/S0167-8191(98)00105-7_BIB7","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1109\/71.342133","article-title":"Prefix computations on a generalized mesh-connected computers with multiple buses","volume":"6","author":"Chung","year":"1995","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"key":"10.1016\/S0167-8191(98)00105-7_BIB8","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF01758749","article-title":"Optimal parallel algorithms for point-set and polygon problems","volume":"7","author":"Cole","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/S0167-8191(98)00105-7_BIB9","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1109\/TC.1986.1676745","article-title":"Broadcast communications and distributed algorithms","volume":"35","author":"Dechter","year":"1986","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-8191(98)00105-7_BIB10","unstructured":"T.Y. Feng, A survey of interconnection networks, IEEE Computer (1981) 12\u201327"},{"key":"10.1016\/S0167-8191(98)00105-7_BIB11","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0020-0190(93)90137-X","article-title":"Leftmost one computation on meshes with row broadcasting","volume":"47","author":"Gurla","year":"1993","journal-title":"Inform. Processing Lett."},{"key":"10.1016\/S0167-8191(98)00105-7_BIB12","unstructured":"S.J. Horng, Generalized mesh-connected computers with hyperbus broadcasting for a computer network, IEICE Trans. Inform. Syst. E79-D(8) (1996) 1107\u20131115"},{"key":"10.1016\/S0167-8191(98)00105-7_BIB13","unstructured":"K. Hwang, Advanced Computer Architecture: Parallelism, Scalability, Programmability, McGraw-Hill, Reading, 1993"},{"key":"10.1016\/S0167-8191(98)00105-7_BIB14","doi-asserted-by":"crossref","first-page":"1707","DOI":"10.1016\/0031-3203(94)90088-4","article-title":"Efficient algorithms for computing two nearest neighbor problems on a RAP","volume":"27","author":"Kao","year":"1994","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0167-8191(98)00105-7_BIB15","unstructured":"S.K. Kim, Optimal parallel algorithms on sorted intervals, The 27th Annu. Allerton Conf. Commun., Control, Comput. (1989) 766\u2013776"},{"key":"10.1016\/S0167-8191(98)00105-7_BIB16","unstructured":"V. Kumar, A. Grama, A. Gupta, G. Karypis, Introduction to Parallel Computing: Design and Analysis of Algorithms, Benjamin\/Cummings, Reading, 1994"},{"key":"10.1016\/S0167-8191(98)00105-7_BIB17","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0743-7315(87)90003-7","article-title":"Array processor with multiple broadcasting","volume":"2","author":"Kumar","year":"1987","journal-title":"J. Parallel and Distributed Comput."},{"key":"10.1016\/S0167-8191(98)00105-7_BIB18","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0020-0190(78)90066-2","article-title":"The all nearest neighbor problem for convex polygons","volume":"7","author":"Lee","year":"1978","journal-title":"Inform. Processing Lett."},{"key":"10.1016\/S0167-8191(98)00105-7_BIB19","doi-asserted-by":"crossref","unstructured":"S.P. Levitan, C.C. Foster, Finding an extremum in a network, Int. Symp. Comput. Architecture (1982) 321\u2013325","DOI":"10.1145\/1067649.801741"},{"key":"10.1016\/S0167-8191(98)00105-7_BIB20","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1109\/34.21792","article-title":"Polymorphic-torus architecture for computer vision","volume":"11","author":"Li","year":"1989","journal-title":"IEEE Trans, Pattern Anal. Machine Intell."},{"key":"10.1016\/S0167-8191(98)00105-7_BIB21","unstructured":"J.M. Marberg, E. Gafni, Sorting and selection in multi-channel broadcast networks, Int. Conf. Parallel Processing (1985) 846\u2013850"},{"key":"10.1016\/S0167-8191(98)00105-7_BIB22","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/0743-7315(89)90022-1","article-title":"Connection autonomy and SIMD computers: A VLSI implementation","volume":"7","author":"Maresca","year":"1989","journal-title":"J. Parallel and Distributed comput."},{"key":"10.1016\/S0167-8191(98)00105-7_BIB23","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1109\/12.277290","article-title":"Parallel computations on reconfigurable meshes","volume":"42","author":"Miller","year":"1993","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"10.1016\/S0167-8191(98)00105-7_BIB24","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1142\/S0129053394000159","article-title":"Data movement techniques on reconfigurable meshes, with applications","volume":"6","author":"Olariu","year":"1994","journal-title":"Int. J. High Speed Comput."},{"key":"10.1016\/S0167-8191(98)00105-7_BIB25","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1007\/BF01994843","article-title":"A constant-time channel-assignment algorithm on reconfigurable meshes","volume":"32","author":"Olariu","year":"1992","journal-title":"BIT"},{"key":"10.1016\/S0167-8191(98)00105-7_BIB26","doi-asserted-by":"crossref","unstructured":"S. Olariu and I. Stojmenovic, Time-optimal proximity algorithms on meshes with multiple broadcasting, Int. Parallel Processing Symp. (1994) 94\u2013101","DOI":"10.1109\/IPPS.1994.288314"},{"key":"10.1016\/S0167-8191(98)00105-7_BIB27","unstructured":"F.P. Preparata, M.I. Shamos, Computational Geometry: An Introduction, Springer-Verlog, Reading, 1988"},{"key":"10.1016\/S0167-8191(98)00105-7_BIB28","unstructured":"D.A. Pucknell, K. Eshranghian, Basic VLSI Design, Section 5.3.3, Prentice-Hall, Reading, 1994, pp. 134\u2013138"},{"key":"10.1016\/S0167-8191(98)00105-7_BIB29","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0166-218X(90)90084-P","article-title":"Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and matching algorithm","volume":"39","author":"Schieber","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0167-8191(98)00105-7_BIB30","doi-asserted-by":"crossref","unstructured":"D.B. Shu, G. Nash, C. Weems, Image understanding architecture and applications, in: J.L.C. Sanz (Ed.), Advanced in Machine Vision, Springer, New York, 1989, pp. 297\u2013355","DOI":"10.1007\/978-1-4612-4532-2_9"},{"key":"10.1016\/S0167-8191(98)00105-7_BIB31","doi-asserted-by":"crossref","unstructured":"Q.F. Stout, Meshes with multiple buses, The 27th IEEE Symp. Found. Comput. Sci. (1986) 264\u2013273","DOI":"10.1109\/SFCS.1986.32"},{"key":"10.1016\/S0167-8191(98)00105-7_BIB32","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1109\/71.80177","article-title":"Constant time algorithms for transitive closure and some related graph problems on processor arrays with a reconfigurable bus system","volume":"1","author":"Wang","year":"1990","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"key":"10.1016\/S0167-8191(98)00105-7_BIB33","doi-asserted-by":"crossref","first-page":"1468","DOI":"10.1109\/12.61071","article-title":"Parallel graph algorithms based upon broadcast communications","volume":"39","author":"Yang","year":"1990","journal-title":"IEEE Trans. Comput."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819198001057?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819198001057?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T03:22:16Z","timestamp":1555557736000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819198001057"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1999,2]]}},"alternative-id":["S0167819198001057"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(98)00105-7","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}