{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T03:05:08Z","timestamp":1780455908563,"version":"3.54.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1992,5,1]],"date-time":"1992-05-01T00:00:00Z","timestamp":704678400000},"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":[[1992,5]]},"DOI":"10.1016\/0167-8191(92)90089-p","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:52:02Z","timestamp":1062611522000},"page":"543-550","source":"Crossref","is-referenced-by-count":12,"title":["A parallel partition for enhanced parallel QuickSort"],"prefix":"10.1016","volume":"18","author":[{"given":"R.S","family":"Francis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"L.J.H","family":"Pannan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(92)90089-P_BIB1","first-page":"483","article-title":"Validity of the single processor approach to achieving large scale computing capabilities","volume":"30","author":"Amdahl","year":"1967"},{"key":"10.1016\/0167-8191(92)90089-P_BIB2","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1109\/TC.1982.1675993","article-title":"Experience with multiprocessor algorithms","volume":"C-31","author":"Deminet","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(92)90089-P_BIB3","series-title":"Performance analysis of parallel Quicksort in shared-memory multiprocessors","author":"Dubois","year":"1988"},{"key":"10.1016\/0167-8191(92)90089-P_BIB4","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1080\/00207168208803323","article-title":"The Parallel Quicksort Algorithm Part I \u2014 Run time analysis","volume":"12","author":"Evans","year":"1982","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/0167-8191(92)90089-P_BIB5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1080\/00207168208803331","article-title":"The Parallel Quicksort Algorithm Part II \u2014 Simulation","volume":"12","author":"Evans","year":"1982","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/0167-8191(92)90089-P_BIB6","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1007\/BF01934992","article-title":"Analysis of the performance of the Parallel Quicksort method","volume":"25","author":"Evans","year":"1985","journal-title":"BIT"},{"key":"10.1016\/0167-8191(92)90089-P_BIB7","first-page":"169","article-title":"Compiler integral multiprocessor simulation","volume":"1","author":"Francis","year":"1991","journal-title":"Internat. J. Comput. Simulation"},{"key":"10.1016\/0167-8191(92)90089-P_BIB8","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1093\/comjnl\/5.1.10","article-title":"Quicksort","volume":"5","author":"Hoare","year":"1962","journal-title":"Computer J."},{"key":"10.1016\/0167-8191(92)90089-P_BIB9","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1016\/0167-8191(90)90074-J","article-title":"A fully vectorized quicksort","volume":"16","author":"Levin","year":"1990","journal-title":"Parallel Comput."},{"key":"10.1016\/0167-8191(92)90089-P_BIB10","first-page":"158","article-title":"A dynamic-trace-driven simulator for evaluating parallelism","volume":"1","author":"Mathieson","year":"1988"},{"key":"10.1016\/0167-8191(92)90089-P_BIB11","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0167-8191(87)90063-9","article-title":"Problem-heap: A paradigm for multiprocessor algorithms","volume":"4","author":"Moller-Nielson","year":"1987","journal-title":"Parallel Comput."},{"key":"10.1016\/0167-8191(92)90089-P_BIB12","first-page":"95","article-title":"Designing Efficient Algorithms for Parallel Computers","author":"Quinn","year":"1987"},{"key":"10.1016\/0167-8191(92)90089-P_BIB13","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/0167-8191(88)90075-0","article-title":"Parallel sorting algorithms for tightly coupled multiprocessors","volume":"6","author":"Quinn","year":"1988","journal-title":"Parallel Comput."},{"key":"10.1016\/0167-8191(92)90089-P_BIB14","article-title":"Performance evaluation of multiple processor systems","author":"Rasking","year":"1978"},{"key":"10.1016\/0167-8191(92)90089-P_BIB15","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0167-8191(87)90062-7","article-title":"Timing results on some internal sorting algorithms on vector computers","volume":"4","author":"R\u00f6nsch","year":"1987","journal-title":"Parallel Comput."},{"key":"10.1016\/0167-8191(92)90089-P_BIB16","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1145\/359619.359631","article-title":"Implementing Quicksort programs","volume":"21","author":"Sedgewick","year":"1978","journal-title":"Comm. ACM"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919290089P?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919290089P?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T09:26:51Z","timestamp":1551086811000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016781919290089P"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,5]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1992,5]]}},"alternative-id":["016781919290089P"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(92)90089-p","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1992,5]]}}}