{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T19:31:46Z","timestamp":1694633506018},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. of Comput. Sci. & Technol."],"published-print":{"date-parts":[[1998,9]]},"DOI":"10.1007\/bf02948504","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T09:08:16Z","timestamp":1221210496000},"page":"455-463","source":"Crossref","is-referenced-by-count":0,"title":["Research on the optimal parallel algorithms of broadcast-class problems"],"prefix":"10.1007","volume":"13","author":[{"given":"Xiaofeng","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Biao","family":"Shou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shirong","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02948504_CR1","doi-asserted-by":"crossref","unstructured":"Gibbons P B. A more practical PRAM model. InProc. ACM Symposium on Parallel Algorithms and Architectures, ACM, 1989, pp. 158\u2013168.","DOI":"10.1145\/72935.72953"},{"issue":"8","key":"BF02948504_CR2","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"L G Valiant","year":"1990","unstructured":"Valiant L G. A bridging model for parallel computation.Communications of the ACM, August 1990, 33(8): 103\u2013111.","journal-title":"Communications of the ACM"},{"key":"BF02948504_CR3","doi-asserted-by":"crossref","unstructured":"Culler D E, Karp R M, Patterson D Aet al. Log P: Towards a realistic model of parallel computation. InProc. 4th ACM PPOPP, May 1993.","DOI":"10.1145\/155332.155333"},{"key":"BF02948504_CR4","doi-asserted-by":"crossref","unstructured":"Karp R M, Sahay A, Santos Eet al. Optimal broadcast and summation in theLog P model. Tech. Rep. UCB\/CSD 92\/721, UC Berkeley, 1992.","DOI":"10.1145\/165231.165250"},{"key":"BF02948504_CR5","unstructured":"Sahay A. Hiding communication costs in bandwidth-limited parallel FFT computation. Tech. Rep. UCB\/CSD 92\/722, UC Berkeley, 1992."}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02948504.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02948504\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02948504","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,16]],"date-time":"2021-09-16T09:43:21Z","timestamp":1631785401000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02948504"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,9]]},"references-count":5,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1998,9]]}},"alternative-id":["BF02948504"],"URL":"https:\/\/doi.org\/10.1007\/bf02948504","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,9]]}}}