乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T23:51:14Z","timestamp":1676850674910},"reference-count":34,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"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":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1006\/jpdc.2000.1636","type":"journal-article","created":{"date-parts":[[2002,9,18]],"date-time":"2002-09-18T18:06:38Z","timestamp":1032372398000},"page":"891-907","source":"Crossref","is-referenced-by-count":7,"title":["Parallel Sorting Algorithm Using Multiway Merge and Its Implementation on a Multi-Mesh Network"],"prefix":"10.1006","volume":"60","author":[{"given":"Bhabani P.","family":"Sinha","sequence":"first","affiliation":[]},{"given":"Amar","family":"Mukherjee","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1006\/jpdc.2000.1636_RF1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0040401","article-title":"Network complexity of sorting and graph problems and simulating CRCW PRAMs by interconnection networks","author":"Aggarwal","year":"1988"},{"key":"10.1006\/jpdc.2000.1636_RF2","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0196-6774(82)90010-4","article-title":"Parallel complexity of sorting problems","volume":"3","author":"Aigner","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1006\/jpdc.2000.1636_RF3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579338","article-title":"An O(nlogn) sorting network","volume":"3","author":"Ajtai","year":"1983","journal-title":"Combinatorica"},{"key":"10.1006\/jpdc.2000.1636_RF4","doi-asserted-by":"crossref","first-page":"1367","DOI":"10.1109\/TC.1987.5009478","article-title":"Optimal parallel merging and sorting without memory conflicts","volume":"36","author":"Akl","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1006\/jpdc.2000.1636_RF5","first-page":"307","article-title":"Sorting networks and their applications","volume":"32","author":"Batcher","year":"1968","journal-title":"AFIPS Spring Joint Computing Conf."},{"key":"10.1006\/jpdc.2000.1636_RF6","series-title":"Proc. 27th IEEE Symp. FOCS","article-title":"Parallel merge sort","author":"Cole","year":"1986"},{"key":"10.1006\/jpdc.2000.1636_RF7","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1109\/71.159046","article-title":"Sorting in mesh connected multiprocessors","volume":"3","author":"Corbett","year":"1992","journal-title":"IEEE Trans. Parallel Distrib. Systems"},{"key":"10.1006\/jpdc.2000.1636_RF8","series-title":"Proc. 22nd Ann. ACM Symp. Theory of Computing","article-title":"Deterministic sorting in nearly logarithmic time on the hypercube and related computers","author":"Cypher","year":"1990"},{"key":"10.1006\/jpdc.2000.1636_RF9","series-title":"Proc. Int. Conf. Parallel Processing, Pennsylvania State Univ., August 1998","article-title":"Optimal sorting in reduced architectures","author":"Cypher","year":"1988"},{"key":"10.1006\/jpdc.2000.1636_RF10","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1109\/12.769436","article-title":"A new network topology with multiple meshes","volume":"48","author":"Das","year":"1999","journal-title":"IEEE Trans. Comput."},{"key":"10.1006\/jpdc.2000.1636_RF11","series-title":"Proc. Ninth Int. Parallel Processing Symposium, Santa Barbara, April 25\u201328, 1995","article-title":"Multi-Mesh\u2014An efficient topology for parallel processing","author":"Das","year":"1995"},{"key":"10.1006\/jpdc.2000.1636_RF12","doi-asserted-by":"crossref","first-page":"1132","DOI":"10.1109\/12.628397","article-title":"An efficient sorting algorithm on the Multi-Mesh network","volume":"46","author":"De","year":"1997","journal-title":"IEEE Trans. Comput."},{"key":"10.1006\/jpdc.2000.1636_RF13","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1109\/71.532111","article-title":"Fast parallel sorting under logP: Experience with the CM-5","volume":"7","author":"Dusseau","year":"1996","journal-title":"IEEE Trans. Parallel Distrib. Comput."},{"key":"10.1006\/jpdc.2000.1636_RF14","series-title":"The Art of Computer Programming, Sorting and Searching","author":"Knuth","year":"1973"},{"key":"10.1006\/jpdc.2000.1636_RF15","series-title":"Proc. Fourth Ann. STACS'87","article-title":"Optimal sorting on multidimensionally mesh-connected arrays","volume":"247","author":"Kunde","year":"1987"},{"key":"10.1006\/jpdc.2000.1636_RF16","series-title":"Proc. Third Aegean Workshop Computing","article-title":"Routing and sorting in mesh-connected arrays","volume":"319","author":"Kunde","year":"1988"},{"key":"10.1006\/jpdc.2000.1636_RF17","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1109\/TC.1985.5009385","article-title":"Tight bounds on the complexity of parallel sorting","volume":"34","author":"Leighton","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1006\/jpdc.2000.1636_RF18","series-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes","author":"Leighton","year":"1992"},{"key":"10.1006\/jpdc.2000.1636_RF19","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1006\/jagm.1994.1030","article-title":"Randomized routing and sorting in fixed-connection networks","volume":"17","author":"Leighton","year":"1994","journal-title":"J. Algorithms"},{"key":"10.1006\/jpdc.2000.1636_RF20","series-title":"Proc. 31st Ann. Symp. FOCS","article-title":"A (fairly) simple circuit that (usually) sorts","author":"Leighton","year":"1990"},{"key":"10.1006\/jpdc.2000.1636_RF21","author":"Mukherjee","year":"1981","journal-title":"Tech. Report"},{"key":"10.1006\/jpdc.2000.1636_RF22","author":"Mukhopadhyay","year":"1972","journal-title":"Tech. Report"},{"key":"10.1006\/jpdc.2000.1636_RF23","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1145\/322326.322329","article-title":"Parallel permutation and sorting algorithms and a new generalized connection network","volume":"29","author":"Nassimi","year":"1982","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1006\/jpdc.2000.1636_RF24","doi-asserted-by":"crossref","first-page":"1221","DOI":"10.1109\/71.476164","article-title":"Sorting n2 numbers on n\u00d7n meshes","volume":"6","author":"Nigam","year":"1995","journal-title":"IEEE Trans. Parallel Distrib. Comput."},{"key":"10.1006\/jpdc.2000.1636_RF25","series-title":"Proc. 30th Ann. Symp. FOCS","article-title":"On the network complexity of selection","author":"Plaxton","year":"1989"},{"key":"10.1006\/jpdc.2000.1636_RF26","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1109\/TC.1978.1675167","article-title":"New parallel sorting schemes","volume":"27","author":"Preparata","year":"1978","journal-title":"IEEE Trans. Comput."},{"key":"10.1006\/jpdc.2000.1636_RF27","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1145\/7531.7532","article-title":"A logarithmic time sort for linear size networks","volume":"34","author":"Reif","year":"1987","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1006\/jpdc.2000.1636_RF28","series-title":"Proc. 22nd IEEE Symp. FOCS","article-title":"A fast probabilistic parallel sorting algorithm","author":"Reischuk","year":"1981"},{"key":"10.1006\/jpdc.2000.1636_RF29","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1109\/12.16500","article-title":"Parallel sorting in two-dimensional VLSI models of computation","volume":"38","author":"Scherson","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1006\/jpdc.2000.1636_RF30","series-title":"Proc. 18th ACM STOC","article-title":"An optimal sorting algorithm for mesh connected computers","author":"Schnorr","year":"1986"},{"key":"10.1006\/jpdc.2000.1636_RF31","article-title":"The VLSI complexity of sorting","volume":"32","author":"Thompson","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1006\/jpdc.2000.1636_RF32","first-page":"263","article-title":"Sorting on a mesh-connected parallel computer","volume":"20","author":"Thompson","year":"1977","journal-title":"Comm. Assoc. Comput. Mach."},{"key":"10.1006\/jpdc.2000.1636_RF33","series-title":"Proc. Int. Conf. High Performance Computing","article-title":"An efficient sorting algorithm on mesh connected computers with multiple broadcasting","author":"Tsai","year":"1995"},{"key":"10.1006\/jpdc.2000.1636_RF34","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1109\/71.481593","article-title":"Multiway merging in parallel","volume":"7","author":"Wen","year":"1996","journal-title":"IEEE Trans. Parallel Distrib. Comput."}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731500916368?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731500916368?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T20:50:07Z","timestamp":1557348607000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743731500916368"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":34,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["S0743731500916368"],"URL":"https:\/\/doi.org\/10.1006\/jpdc.2000.1636","relation":{},"ISSN":["0743-7315"],"issn-type":[{"value":"0743-7315","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}