{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:25:00Z","timestamp":1757629500258,"version":"3.44.0"},"reference-count":29,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,12,1]],"date-time":"1989-12-01T00:00:00Z","timestamp":628473600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1989,12,1]],"date-time":"1989-12-01T00:00:00Z","timestamp":628473600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1989,12]]},"DOI":"10.1016\/0743-7315(89)90032-4","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"482-502","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["A new parallel sorting approach with sorting memory module"],"prefix":"10.1016","volume":"7","author":[{"given":"Chuan-Qi","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhixi","family":"Fang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaobo","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-7315(89)90032-4_BIB1","series-title":"Proc. 15th ACM Symposium on the Theory of Computing","first-page":"1","article-title":"An O(N log N) sorting network","author":"Ajtai","year":"1983"},{"key":"10.1016\/0743-7315(89)90032-4_BIB2","first-page":"307","article-title":"Sorting networks and their applications","volume":"Vol. 32","author":"Batcher","year":"1968"},{"key":"10.1016\/0743-7315(89)90032-4_BIB3","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1109\/TC.1978.1674957","article-title":"Optimal sorting algorithms for parallel computers","volume":"C-27","author":"Baudet","year":"1978","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(89)90032-4_BIB4","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1109\/TC.1985.5009384","article-title":"A minimum VLSI network for O(logN) time sorting","volume":"C-34","author":"Bilardi","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(89)90032-4_BIB5","series-title":"Proc. 14th ACM Symposium on the Theory of Computing","first-page":"338","article-title":"Routing, merging and sorting on parallel models of computation","author":"Borodin","year":"1982"},{"key":"10.1016\/0743-7315(89)90032-4_BIB6","series-title":"Proc. NATO Advanced Research Workshop on High Speed Computation","article-title":"Large-scale and high-speed multiprocessor system for scientific applications-Cray X-MP-2 series","author":"Chen","year":"1983"},{"key":"10.1016\/0743-7315(89)90032-4_BIB7","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1109\/TC.1983.1676201","article-title":"The NYU ultracomputer-Designing an MIMD shared memory parallel computer","author":"Gottlieb","year":"1983","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/0743-7315(89)90032-4_BIB8","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1137\/0603047","article-title":"Sorting and merging in rounds","volume":"3","author":"Haggkvist","year":"1982","journal-title":"SIAM J. Algebraic Discrete Methods"},{"year":"1973","author":"Knuth","key":"10.1016\/0743-7315(89)90032-4_BIB9"},{"key":"10.1016\/0743-7315(89)90032-4_BIB10","series-title":"Proc. 1984 International Conference on Parallel Processing","article-title":"The effects of program restructuring, algorithm change and architecture choice on program performance","author":"Kuck","year":"1984"},{"key":"10.1016\/0743-7315(89)90032-4_BIB11","doi-asserted-by":"crossref","first-page":"967","DOI":"10.1126\/science.231.4741.967","article-title":"Parallel supercomputing today and the Cedar approach","volume":"231","author":"Kuck","year":"1986","journal-title":"Science"},{"key":"10.1016\/0743-7315(89)90032-4_BIB12","doi-asserted-by":"crossref","first-page":"1145","DOI":"10.1109\/T-C.1975.224157","article-title":"Access and alignment of data in an array processor","volume":"C-24","author":"Lawrie","year":"1975","journal-title":"IEEE Trans. Comput."},{"year":"1983","series-title":"Complexity Issues in VLSL Optimal Layouts for the Shuffle-Exchange Graph and Other Networks","author":"Leighton","key":"10.1016\/0743-7315(89)90032-4_BIB13"},{"key":"10.1016\/0743-7315(89)90032-4_BIB14","series-title":"Proc. 1983 Workshop Graphtheor, Concepts in Computer Science","first-page":"200","article-title":"Parallel computation using meshes of tress","author":"Leighton","year":"1983"},{"year":"1984","series-title":"Theory of parallel computation and VLSI","author":"Leighton","key":"10.1016\/0743-7315(89)90032-4_BIB15"},{"issue":"1","key":"10.1016\/0743-7315(89)90032-4_BIB16","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF01744433","article-title":"New lower bound techniques for VLSI","volume":"17","author":"Leighton","year":"1984","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0743-7315(89)90032-4_BIB17","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1109\/TC.1985.5009385","article-title":"Tight bounds on the complexity of parallel sorting","volume":"C-34","author":"Leighton","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(89)90032-4_BIB18","series-title":"Proc. 1985 International Conference on Parallel Processing","article-title":"The IBM RP3: Introduction and architecture","author":"Pfister","year":"1985"},{"key":"10.1016\/0743-7315(89)90032-4_BIB19","series-title":"Proc. IEEE 1985 International Conference on Parallel Processing","article-title":"A methodology for predicting multi-processor performance","author":"Pfister","year":"1985"},{"key":"10.1016\/0743-7315(89)90032-4_BIB20","series-title":"Proc. 15th ACM Symposium on the Theory of Computing","first-page":"10","article-title":"A logarithmic time sort for linear size networks","author":"Reif","year":"1983"},{"key":"10.1016\/0743-7315(89)90032-4_BIB21","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1109\/TC.1979.1675280","article-title":"A model of SIMD machines and a comparison of various interconnection networks","volume":"C-28","author":"Seigel","year":"1979","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(89)90032-4_BIB22","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1109\/TC.1985.5009386","article-title":"Minimum storage sorting networks","volume":"C-34","author":"Seigel","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(89)90032-4_BIB23","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1109\/T-C.1971.223205","article-title":"Parallel processing with the perfect shuffle","volume":"C-20","author":"Stone","year":"1971","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(89)90032-4_BIB24","series-title":"Proc. 1986 International Conference on Parallel Processing","first-page":"528","article-title":"Processor self-scheduling for multiple-nested parallel loops","author":"Tang","year":"1986"},{"key":"10.1016\/0743-7315(89)90032-4_BIB25","series-title":"Proc. 11th ACM Symposium on the Theory of Computing","first-page":"81","article-title":"Area-time complexity for VLSI","author":"Thompson","year":"1979"},{"key":"10.1016\/0743-7315(89)90032-4_BIB26","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1109\/TC.1983.1676178","article-title":"The VLSI complexity of sorting","volume":"C-32","author":"Thompson","year":"1983","journal-title":"IEEE Trans. Comput."},{"year":"1983","series-title":"Computational Aspects of VLSI","author":"Ullman","key":"10.1016\/0743-7315(89)90032-4_BIB27"},{"key":"10.1016\/0743-7315(89)90032-4_BIB28","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1109\/TC.1980.1675651","article-title":"On a class of multistage interconnection networks","volume":"C-29","author":"Wu","year":"1980","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(89)90032-4_BIB29","series-title":"Proc. 4th International Conference on Distributed Computing Systems","first-page":"486","article-title":"A synchronization scheme and its application for large multiprocessor systems","author":"Zhu","year":"1984"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731589900324?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731589900324?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:31:06Z","timestamp":1757514666000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743731589900324"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,12]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,12]]}},"alternative-id":["0743731589900324"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(89)90032-4","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1989,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A new parallel sorting approach with sorting memory module","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(89)90032-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1989 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}